./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_safe-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/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_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/fib_safe-11.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/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_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/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 deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 --- 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 21:03:14,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:03:14,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:03:14,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:03:14,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:03:14,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:03:14,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:03:14,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:03:14,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:03:14,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:03:14,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:03:14,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:03:14,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:03:14,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:03:14,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:03:14,145 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:03:14,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:03:14,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:03:14,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:03:14,157 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:03:14,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:03:14,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:03:14,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:03:14,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:03:14,175 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:03:14,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:03:14,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:03:14,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:03:14,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:03:14,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:03:14,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:03:14,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:03:14,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:03:14,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:03:14,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:03:14,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:03:14,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:03:14,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:03:14,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:03:14,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:03:14,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:03:14,194 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-02 21:03:14,244 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:03:14,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:03:14,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:03:14,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:03:14,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:03:14,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:03:14,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:03:14,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:03:14,249 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:03:14,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:03:14,251 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 21:03:14,251 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 21:03:14,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:03:14,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 21:03:14,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:03:14,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:03:14,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:03:14,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:03:14,253 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-02 21:03:14,253 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 21:03:14,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:03:14,253 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:03:14,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:03:14,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:03:14,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:03:14,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:03:14,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:03:14,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:03:14,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:03:14,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:03:14,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:03:14,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:03:14,257 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:03:14,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:03:14,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:03:14,257 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_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/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_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/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 -> deae7fd0ef95d67bb618281e50bfba6f50a83de212ef14f46660866b256c6152 [2022-11-02 21:03:14,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:03:14,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:03:14,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:03:14,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:03:14,595 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:03:14,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread/fib_safe-11.i [2022-11-02 21:03:14,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/data/b32525b03/06a84f782073401c9d17e3a23cfb016b/FLAG7233d4c68 [2022-11-02 21:03:15,282 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:03:15,282 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/sv-benchmarks/c/pthread/fib_safe-11.i [2022-11-02 21:03:15,296 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/data/b32525b03/06a84f782073401c9d17e3a23cfb016b/FLAG7233d4c68 [2022-11-02 21:03:15,545 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/data/b32525b03/06a84f782073401c9d17e3a23cfb016b [2022-11-02 21:03:15,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:03:15,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:03:15,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:03:15,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:03:15,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:03:15,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:15" (1/1) ... [2022-11-02 21:03:15,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@262d4df0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:15, skipping insertion in model container [2022-11-02 21:03:15,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:03:15" (1/1) ... [2022-11-02 21:03:15,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:03:15,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:03:16,021 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_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/sv-benchmarks/c/pthread/fib_safe-11.i[30815,30828] [2022-11-02 21:03:16,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:03:16,045 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:03:16,131 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_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/sv-benchmarks/c/pthread/fib_safe-11.i[30815,30828] [2022-11-02 21:03:16,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:03:16,186 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:03:16,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16 WrapperNode [2022-11-02 21:03:16,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:03:16,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:03:16,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:03:16,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:03:16,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,273 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-11-02 21:03:16,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:03:16,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:03:16,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:03:16,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:03:16,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,328 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,348 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:03:16,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:03:16,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:03:16,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:03:16,350 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (1/1) ... [2022-11-02 21:03:16,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:03:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:16,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:03:16,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:03:16,468 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-02 21:03:16,469 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-02 21:03:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-02 21:03:16,470 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-02 21:03:16,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:03:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-02 21:03:16,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:03:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:03:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:03:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:03:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-02 21:03:16,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:03:16,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:03:16,479 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 21:03:16,639 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:03:16,642 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:03:17,101 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:03:17,166 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:03:17,166 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 21:03:17,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:17 BoogieIcfgContainer [2022-11-02 21:03:17,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:03:17,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:03:17,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:03:17,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:03:17,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:03:15" (1/3) ... [2022-11-02 21:03:17,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f154ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:17, skipping insertion in model container [2022-11-02 21:03:17,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:03:16" (2/3) ... [2022-11-02 21:03:17,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f154ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:03:17, skipping insertion in model container [2022-11-02 21:03:17,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:17" (3/3) ... [2022-11-02 21:03:17,187 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_safe-11.i [2022-11-02 21:03:17,201 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 21:03:17,212 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:03:17,212 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-02 21:03:17,213 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 21:03:17,306 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-02 21:03:17,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-11-02 21:03:17,460 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-11-02 21:03:17,460 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:17,476 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 21:03:17,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 193 transitions, 396 flow [2022-11-02 21:03:17,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 191 transitions, 388 flow [2022-11-02 21:03:17,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:03:17,511 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;@15d06035, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:03:17,511 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-02 21:03:17,520 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-11-02 21:03:17,520 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:17,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:17,521 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 21:03:17,522 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 21:03:17,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1806377174, now seen corresponding path program 1 times [2022-11-02 21:03:17,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:17,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476472969] [2022-11-02 21:03:17,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:17,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:17,830 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 21:03:17,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:17,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476472969] [2022-11-02 21:03:17,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476472969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:17,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:17,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-02 21:03:17,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365070374] [2022-11-02 21:03:17,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:17,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 21:03:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 21:03:17,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 21:03:17,905 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 193 [2022-11-02 21:03:17,908 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 21:03:17,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:17,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 193 [2022-11-02 21:03:17,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:18,109 INFO L130 PetriNetUnfolder]: 9/295 cut-off events. [2022-11-02 21:03:18,109 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:03:18,116 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 21:03:18,119 INFO L137 encePairwiseOnDemand]: 181/193 looper letters, 6 selfloop transitions, 0 changer transitions 0/178 dead transitions. [2022-11-02 21:03:18,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 374 flow [2022-11-02 21:03:18,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 21:03:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 21:03:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-11-02 21:03:18,142 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9481865284974094 [2022-11-02 21:03:18,143 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 366 transitions. [2022-11-02 21:03:18,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 366 transitions. [2022-11-02 21:03:18,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:18,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 366 transitions. [2022-11-02 21:03:18,156 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 21:03:18,165 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 21:03:18,166 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 21:03:18,168 INFO L175 Difference]: Start difference. First operand has 190 places, 191 transitions, 388 flow. Second operand 2 states and 366 transitions. [2022-11-02 21:03:18,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 374 flow [2022-11-02 21:03:18,173 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 21:03:18,178 INFO L231 Difference]: Finished difference. Result has 180 places, 178 transitions, 360 flow [2022-11-02 21:03:18,180 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 21:03:18,184 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -10 predicate places. [2022-11-02 21:03:18,185 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 178 transitions, 360 flow [2022-11-02 21:03:18,186 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 21:03:18,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:18,186 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 21:03:18,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:03:18,187 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 21:03:18,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:18,188 INFO L85 PathProgramCache]: Analyzing trace with hash -929261081, now seen corresponding path program 1 times [2022-11-02 21:03:18,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:18,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011812732] [2022-11-02 21:03:18,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:18,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,288 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 21:03:18,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:18,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011812732] [2022-11-02 21:03:18,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011812732] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:18,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:18,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:18,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402300687] [2022-11-02 21:03:18,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:18,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:18,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:18,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:18,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:18,294 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 21:03:18,295 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 21:03:18,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:18,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 21:03:18,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:18,409 INFO L130 PetriNetUnfolder]: 48/393 cut-off events. [2022-11-02 21:03:18,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:18,414 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 21:03:18,418 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 19 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2022-11-02 21:03:18,418 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 179 transitions, 406 flow [2022-11-02 21:03:18,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-11-02 21:03:18,421 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8670120898100173 [2022-11-02 21:03:18,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-11-02 21:03:18,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-11-02 21:03:18,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:18,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-11-02 21:03:18,424 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 21:03:18,428 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 21:03:18,429 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 21:03:18,429 INFO L175 Difference]: Start difference. First operand has 180 places, 178 transitions, 360 flow. Second operand 3 states and 502 transitions. [2022-11-02 21:03:18,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 179 transitions, 406 flow [2022-11-02 21:03:18,433 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 21:03:18,438 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 362 flow [2022-11-02 21:03:18,438 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 21:03:18,440 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -9 predicate places. [2022-11-02 21:03:18,440 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 362 flow [2022-11-02 21:03:18,441 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 21:03:18,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:18,442 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 21:03:18,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:03:18,443 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 21:03:18,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:18,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837375, now seen corresponding path program 1 times [2022-11-02 21:03:18,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:18,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085828675] [2022-11-02 21:03:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,555 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 21:03:18,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:18,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085828675] [2022-11-02 21:03:18,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085828675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:18,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:18,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108247216] [2022-11-02 21:03:18,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:18,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:18,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:18,559 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 21:03:18,559 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 21:03:18,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:18,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 21:03:18,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:18,659 INFO L130 PetriNetUnfolder]: 34/261 cut-off events. [2022-11-02 21:03:18,659 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-02 21:03:18,663 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 21:03:18,666 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2022-11-02 21:03:18,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 177 transitions, 398 flow [2022-11-02 21:03:18,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:18,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-02 21:03:18,669 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-02 21:03:18,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-02 21:03:18,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-02 21:03:18,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:18,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-02 21:03:18,673 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 21:03:18,675 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 21:03:18,676 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 21:03:18,676 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 362 flow. Second operand 3 states and 505 transitions. [2022-11-02 21:03:18,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 177 transitions, 398 flow [2022-11-02 21:03:18,678 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 21:03:18,683 INFO L231 Difference]: Finished difference. Result has 179 places, 175 transitions, 358 flow [2022-11-02 21:03:18,684 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 21:03:18,686 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-02 21:03:18,687 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 358 flow [2022-11-02 21:03:18,687 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 21:03:18,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:18,688 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 21:03:18,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:03:18,689 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 21:03:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -418600324, now seen corresponding path program 1 times [2022-11-02 21:03:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:18,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220749730] [2022-11-02 21:03:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,809 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 21:03:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:18,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220749730] [2022-11-02 21:03:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220749730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:18,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:18,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024019006] [2022-11-02 21:03:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:18,814 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 21:03:18,815 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 21:03:18,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:18,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 21:03:18,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:18,916 INFO L130 PetriNetUnfolder]: 22/303 cut-off events. [2022-11-02 21:03:18,916 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:18,920 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 21:03:18,922 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 18 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-02 21:03:18,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 398 flow [2022-11-02 21:03:18,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-11-02 21:03:18,925 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8652849740932642 [2022-11-02 21:03:18,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2022-11-02 21:03:18,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2022-11-02 21:03:18,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:18,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2022-11-02 21:03:18,928 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 21:03:18,930 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 21:03:18,930 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 21:03:18,931 INFO L175 Difference]: Start difference. First operand has 179 places, 175 transitions, 358 flow. Second operand 3 states and 501 transitions. [2022-11-02 21:03:18,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 398 flow [2022-11-02 21:03:18,933 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 21:03:18,936 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 356 flow [2022-11-02 21:03:18,936 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 21:03:18,937 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -12 predicate places. [2022-11-02 21:03:18,938 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 356 flow [2022-11-02 21:03:18,938 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 21:03:18,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:18,939 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 21:03:18,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:03:18,939 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 21:03:18,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:18,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2063316520, now seen corresponding path program 1 times [2022-11-02 21:03:18,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:18,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010842257] [2022-11-02 21:03:18,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:18,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,995 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 21:03:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:18,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010842257] [2022-11-02 21:03:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010842257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:18,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:18,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394591782] [2022-11-02 21:03:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:18,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:18,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:18,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:18,999 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 21:03:19,000 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 21:03:19,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:19,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 21:03:19,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:19,086 INFO L130 PetriNetUnfolder]: 18/295 cut-off events. [2022-11-02 21:03:19,086 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 21:03:19,090 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 21:03:19,092 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-02 21:03:19,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 386 flow [2022-11-02 21:03:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-02 21:03:19,095 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-02 21:03:19,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-02 21:03:19,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-02 21:03:19,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:19,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-02 21:03:19,098 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 21:03:19,100 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 21:03:19,101 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 21:03:19,101 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 356 flow. Second operand 3 states and 504 transitions. [2022-11-02 21:03:19,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 386 flow [2022-11-02 21:03:19,103 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 21:03:19,106 INFO L231 Difference]: Finished difference. Result has 176 places, 172 transitions, 352 flow [2022-11-02 21:03:19,107 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 21:03:19,108 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -14 predicate places. [2022-11-02 21:03:19,108 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 352 flow [2022-11-02 21:03:19,109 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 21:03:19,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:19,109 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 21:03:19,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:03:19,110 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 21:03:19,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:19,110 INFO L85 PathProgramCache]: Analyzing trace with hash 940500773, now seen corresponding path program 1 times [2022-11-02 21:03:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:19,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96159036] [2022-11-02 21:03:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:19,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,156 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 21:03:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96159036] [2022-11-02 21:03:19,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96159036] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:19,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:19,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:19,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867864510] [2022-11-02 21:03:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:19,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:19,160 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-02 21:03:19,161 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 21:03:19,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:19,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-02 21:03:19,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:19,316 INFO L130 PetriNetUnfolder]: 69/506 cut-off events. [2022-11-02 21:03:19,316 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:19,320 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 21:03:19,323 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 20 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-02 21:03:19,324 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 173 transitions, 398 flow [2022-11-02 21:03:19,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-02 21:03:19,327 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8635578583765112 [2022-11-02 21:03:19,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-02 21:03:19,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-02 21:03:19,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:19,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-02 21:03:19,330 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 21:03:19,332 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 21:03:19,333 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 21:03:19,334 INFO L175 Difference]: Start difference. First operand has 176 places, 172 transitions, 352 flow. Second operand 3 states and 500 transitions. [2022-11-02 21:03:19,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 173 transitions, 398 flow [2022-11-02 21:03:19,336 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 21:03:19,340 INFO L231 Difference]: Finished difference. Result has 175 places, 171 transitions, 350 flow [2022-11-02 21:03:19,340 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 21:03:19,341 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -15 predicate places. [2022-11-02 21:03:19,342 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 171 transitions, 350 flow [2022-11-02 21:03:19,342 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 21:03:19,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:19,343 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 21:03:19,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:03:19,344 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 21:03:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash 193157200, now seen corresponding path program 1 times [2022-11-02 21:03:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:19,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14700630] [2022-11-02 21:03:19,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,401 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 21:03:19,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14700630] [2022-11-02 21:03:19,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14700630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:19,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:19,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543664564] [2022-11-02 21:03:19,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:19,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:19,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:19,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:19,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:19,406 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 21:03:19,407 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 21:03:19,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:19,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 21:03:19,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:19,497 INFO L130 PetriNetUnfolder]: 26/228 cut-off events. [2022-11-02 21:03:19,497 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:19,500 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 21:03:19,502 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 16 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-11-02 21:03:19,503 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 390 flow [2022-11-02 21:03:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2022-11-02 21:03:19,506 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8618307426597582 [2022-11-02 21:03:19,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2022-11-02 21:03:19,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2022-11-02 21:03:19,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:19,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2022-11-02 21:03:19,509 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 21:03:19,510 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 21:03:19,511 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 21:03:19,512 INFO L175 Difference]: Start difference. First operand has 175 places, 171 transitions, 350 flow. Second operand 3 states and 499 transitions. [2022-11-02 21:03:19,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 172 transitions, 390 flow [2022-11-02 21:03:19,514 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 21:03:19,517 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2022-11-02 21:03:19,517 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 21:03:19,518 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -16 predicate places. [2022-11-02 21:03:19,519 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2022-11-02 21:03:19,519 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 21:03:19,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:19,520 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 21:03:19,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:03:19,520 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 21:03:19,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1907786638, now seen corresponding path program 1 times [2022-11-02 21:03:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:19,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073866688] [2022-11-02 21:03:19,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,564 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 21:03:19,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:19,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073866688] [2022-11-02 21:03:19,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073866688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:19,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:19,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154732578] [2022-11-02 21:03:19,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:19,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:19,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:19,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:19,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:19,568 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 21:03:19,569 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 21:03:19,569 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:19,569 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 21:03:19,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:19,684 INFO L130 PetriNetUnfolder]: 49/471 cut-off events. [2022-11-02 21:03:19,684 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:19,688 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 21:03:19,690 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-11-02 21:03:19,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 382 flow [2022-11-02 21:03:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:19,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-02 21:03:19,693 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-02 21:03:19,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-02 21:03:19,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-02 21:03:19,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:19,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-02 21:03:19,696 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 21:03:19,697 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 21:03:19,698 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 21:03:19,698 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 505 transitions. [2022-11-02 21:03:19,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 382 flow [2022-11-02 21:03:19,700 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 21:03:19,702 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2022-11-02 21:03:19,703 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 21:03:19,704 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -18 predicate places. [2022-11-02 21:03:19,704 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2022-11-02 21:03:19,705 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 21:03:19,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:19,705 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 21:03:19,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:03:19,706 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 21:03:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash 430849023, now seen corresponding path program 1 times [2022-11-02 21:03:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:19,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771819805] [2022-11-02 21:03:19,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:19,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,784 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 21:03:19,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:19,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771819805] [2022-11-02 21:03:19,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771819805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:19,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:19,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 21:03:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687334950] [2022-11-02 21:03:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:19,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:19,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:19,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:19,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:19,791 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-02 21:03:19,792 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 21:03:19,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:19,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-02 21:03:19,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:19,963 INFO L130 PetriNetUnfolder]: 41/615 cut-off events. [2022-11-02 21:03:19,963 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:19,967 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 21:03:19,971 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-02 21:03:19,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 173 transitions, 388 flow [2022-11-02 21:03:19,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:19,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-11-02 21:03:19,973 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9015544041450777 [2022-11-02 21:03:19,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2022-11-02 21:03:19,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2022-11-02 21:03:19,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:19,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2022-11-02 21:03:19,976 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 21:03:19,977 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 21:03:19,978 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 21:03:19,978 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 522 transitions. [2022-11-02 21:03:19,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 173 transitions, 388 flow [2022-11-02 21:03:19,980 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 21:03:19,983 INFO L231 Difference]: Finished difference. Result has 173 places, 169 transitions, 352 flow [2022-11-02 21:03:19,984 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 21:03:19,984 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -17 predicate places. [2022-11-02 21:03:19,985 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 352 flow [2022-11-02 21:03:19,985 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 21:03:19,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:19,985 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 21:03:19,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:03:19,986 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 21:03:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 430848325, now seen corresponding path program 1 times [2022-11-02 21:03:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:19,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849833507] [2022-11-02 21:03:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:20,033 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 21:03:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:20,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849833507] [2022-11-02 21:03:20,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849833507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:20,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:20,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:20,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700937528] [2022-11-02 21:03:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:20,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:20,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:20,037 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-02 21:03:20,038 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 21:03:20,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:20,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-02 21:03:20,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:20,192 INFO L130 PetriNetUnfolder]: 81/659 cut-off events. [2022-11-02 21:03:20,192 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-02 21:03:20,198 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 21:03:20,203 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 3 changer transitions 0/169 dead transitions. [2022-11-02 21:03:20,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 169 transitions, 382 flow [2022-11-02 21:03:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-02 21:03:20,205 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-02 21:03:20,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:20,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,208 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 21:03:20,209 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 21:03:20,210 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 21:03:20,210 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 352 flow. Second operand 3 states and 512 transitions. [2022-11-02 21:03:20,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 169 transitions, 382 flow [2022-11-02 21:03:20,212 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 21:03:20,215 INFO L231 Difference]: Finished difference. Result has 172 places, 167 transitions, 352 flow [2022-11-02 21:03:20,216 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 21:03:20,217 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -18 predicate places. [2022-11-02 21:03:20,217 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 167 transitions, 352 flow [2022-11-02 21:03:20,217 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 21:03:20,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:20,218 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 21:03:20,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:03:20,218 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 21:03:20,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1728395284, now seen corresponding path program 1 times [2022-11-02 21:03:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:20,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058922827] [2022-11-02 21:03:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:20,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:20,264 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 21:03:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:20,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058922827] [2022-11-02 21:03:20,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058922827] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:20,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:20,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:20,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82613676] [2022-11-02 21:03:20,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:20,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:20,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:20,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:20,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:20,268 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-02 21:03:20,269 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 21:03:20,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:20,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-02 21:03:20,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:20,417 INFO L130 PetriNetUnfolder]: 89/647 cut-off events. [2022-11-02 21:03:20,417 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:20,423 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 21:03:20,426 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2022-11-02 21:03:20,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 167 transitions, 382 flow [2022-11-02 21:03:20,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:20,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-02 21:03:20,429 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-02 21:03:20,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:20,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,431 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 21:03:20,433 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 21:03:20,433 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 21:03:20,433 INFO L175 Difference]: Start difference. First operand has 172 places, 167 transitions, 352 flow. Second operand 3 states and 512 transitions. [2022-11-02 21:03:20,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 167 transitions, 382 flow [2022-11-02 21:03:20,435 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 21:03:20,438 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 346 flow [2022-11-02 21:03:20,439 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 21:03:20,439 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-02 21:03:20,439 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 346 flow [2022-11-02 21:03:20,440 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 21:03:20,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:20,440 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 21:03:20,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:03:20,441 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 21:03:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash -215926811, now seen corresponding path program 1 times [2022-11-02 21:03:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:20,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456341660] [2022-11-02 21:03:20,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:20,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:20,494 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 21:03:20,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:20,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456341660] [2022-11-02 21:03:20,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456341660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:20,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:20,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:20,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973646143] [2022-11-02 21:03:20,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:20,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:20,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:20,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:20,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:20,498 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-02 21:03:20,498 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 21:03:20,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:20,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-02 21:03:20,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:20,594 INFO L130 PetriNetUnfolder]: 18/346 cut-off events. [2022-11-02 21:03:20,594 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:20,598 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 21:03:20,600 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-11-02 21:03:20,601 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 165 transitions, 380 flow [2022-11-02 21:03:20,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-11-02 21:03:20,603 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8601036269430051 [2022-11-02 21:03:20,603 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-11-02 21:03:20,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-11-02 21:03:20,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:20,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-11-02 21:03:20,606 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 21:03:20,608 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 21:03:20,608 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 21:03:20,608 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 346 flow. Second operand 3 states and 498 transitions. [2022-11-02 21:03:20,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 165 transitions, 380 flow [2022-11-02 21:03:20,610 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 21:03:20,616 INFO L231 Difference]: Finished difference. Result has 169 places, 164 transitions, 344 flow [2022-11-02 21:03:20,616 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 21:03:20,619 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -21 predicate places. [2022-11-02 21:03:20,619 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 164 transitions, 344 flow [2022-11-02 21:03:20,620 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 21:03:20,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:20,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:20,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:03:20,620 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 21:03:20,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:20,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1939820954, now seen corresponding path program 1 times [2022-11-02 21:03:20,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:20,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064371576] [2022-11-02 21:03:20,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:20,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:20,694 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 21:03:20,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:20,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064371576] [2022-11-02 21:03:20,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064371576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:20,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:20,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:20,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021995986] [2022-11-02 21:03:20,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:20,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:20,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:20,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:20,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:20,698 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-02 21:03:20,699 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 21:03:20,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:20,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-02 21:03:20,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:20,853 INFO L130 PetriNetUnfolder]: 73/611 cut-off events. [2022-11-02 21:03:20,854 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:20,859 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 21:03:20,862 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2022-11-02 21:03:20,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 165 transitions, 378 flow [2022-11-02 21:03:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-02 21:03:20,865 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-02 21:03:20,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:20,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-02 21:03:20,867 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 21:03:20,869 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 21:03:20,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 21:03:20,870 INFO L175 Difference]: Start difference. First operand has 169 places, 164 transitions, 344 flow. Second operand 3 states and 512 transitions. [2022-11-02 21:03:20,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 165 transitions, 378 flow [2022-11-02 21:03:20,872 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 21:03:20,875 INFO L231 Difference]: Finished difference. Result has 168 places, 163 transitions, 342 flow [2022-11-02 21:03:20,875 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 21:03:20,876 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-02 21:03:20,876 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 163 transitions, 342 flow [2022-11-02 21:03:20,877 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 21:03:20,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:20,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] [2022-11-02 21:03:20,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:03:20,878 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 21:03:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash -596713196, now seen corresponding path program 1 times [2022-11-02 21:03:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:20,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319995509] [2022-11-02 21:03:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:20,925 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 21:03:20,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:20,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319995509] [2022-11-02 21:03:20,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319995509] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:20,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:20,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240629560] [2022-11-02 21:03:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:20,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:20,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:20,929 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 21:03:20,930 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 21:03:20,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:20,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 21:03:20,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:21,071 INFO L130 PetriNetUnfolder]: 73/603 cut-off events. [2022-11-02 21:03:21,071 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:21,077 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 21:03:21,080 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-02 21:03:21,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 378 flow [2022-11-02 21:03:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-02 21:03:21,083 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-02 21:03:21,084 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-02 21:03:21,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-02 21:03:21,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:21,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-02 21:03:21,086 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 21:03:21,088 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 21:03:21,089 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 21:03:21,089 INFO L175 Difference]: Start difference. First operand has 168 places, 163 transitions, 342 flow. Second operand 3 states and 504 transitions. [2022-11-02 21:03:21,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 378 flow [2022-11-02 21:03:21,091 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 21:03:21,094 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 340 flow [2022-11-02 21:03:21,095 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 21:03:21,096 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-02 21:03:21,096 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 340 flow [2022-11-02 21:03:21,097 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 21:03:21,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:21,097 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 21:03:21,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:03:21,098 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 21:03:21,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:21,099 INFO L85 PathProgramCache]: Analyzing trace with hash 187265853, now seen corresponding path program 1 times [2022-11-02 21:03:21,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:21,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968921652] [2022-11-02 21:03:21,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:21,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:21,153 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 21:03:21,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:21,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968921652] [2022-11-02 21:03:21,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968921652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:21,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:21,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432259664] [2022-11-02 21:03:21,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:21,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:21,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:21,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:21,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:21,157 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-02 21:03:21,158 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 21:03:21,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:21,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-02 21:03:21,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:21,284 INFO L130 PetriNetUnfolder]: 61/583 cut-off events. [2022-11-02 21:03:21,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:21,290 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 21:03:21,293 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-02 21:03:21,293 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2022-11-02 21:03:21,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:21,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-11-02 21:03:21,296 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8946459412780656 [2022-11-02 21:03:21,296 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-11-02 21:03:21,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-11-02 21:03:21,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:21,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-11-02 21:03:21,298 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 21:03:21,300 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 21:03:21,300 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 21:03:21,301 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 340 flow. Second operand 3 states and 518 transitions. [2022-11-02 21:03:21,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2022-11-02 21:03:21,303 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 21:03:21,306 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 344 flow [2022-11-02 21:03:21,306 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 21:03:21,307 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-02 21:03:21,307 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 344 flow [2022-11-02 21:03:21,308 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 21:03:21,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:21,308 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 21:03:21,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:03:21,308 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 21:03:21,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1490312150, now seen corresponding path program 1 times [2022-11-02 21:03:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:21,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354962449] [2022-11-02 21:03:21,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:21,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 21:03:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:21,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354962449] [2022-11-02 21:03:21,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354962449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:21,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:21,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626872757] [2022-11-02 21:03:21,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:21,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:21,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:21,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:21,358 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-02 21:03:21,359 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 21:03:21,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:21,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-02 21:03:21,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:21,484 INFO L130 PetriNetUnfolder]: 81/595 cut-off events. [2022-11-02 21:03:21,485 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-02 21:03:21,489 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 21:03:21,492 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2022-11-02 21:03:21,493 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 380 flow [2022-11-02 21:03:21,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:21,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-02 21:03:21,497 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-02 21:03:21,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-02 21:03:21,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-02 21:03:21,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:21,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-02 21:03:21,499 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 21:03:21,501 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 21:03:21,501 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 21:03:21,501 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 344 flow. Second operand 3 states and 504 transitions. [2022-11-02 21:03:21,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 380 flow [2022-11-02 21:03:21,504 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 21:03:21,506 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 344 flow [2022-11-02 21:03:21,507 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 21:03:21,507 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-02 21:03:21,508 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 344 flow [2022-11-02 21:03:21,508 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 21:03:21,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:21,508 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 21:03:21,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:03:21,509 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 21:03:21,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:21,510 INFO L85 PathProgramCache]: Analyzing trace with hash -91697017, now seen corresponding path program 1 times [2022-11-02 21:03:21,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:21,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661955831] [2022-11-02 21:03:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:21,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:21,557 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 21:03:21,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:21,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661955831] [2022-11-02 21:03:21,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661955831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:21,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:21,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 21:03:21,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167844921] [2022-11-02 21:03:21,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:21,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:21,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:21,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:21,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 21:03:21,561 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-02 21:03:21,562 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 21:03:21,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:21,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-02 21:03:21,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:21,712 INFO L130 PetriNetUnfolder]: 73/583 cut-off events. [2022-11-02 21:03:21,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:21,716 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 21:03:21,719 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 17 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2022-11-02 21:03:21,720 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 384 flow [2022-11-02 21:03:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-11-02 21:03:21,722 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8583765112262521 [2022-11-02 21:03:21,722 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-11-02 21:03:21,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-11-02 21:03:21,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:21,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-11-02 21:03:21,724 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 21:03:21,726 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 21:03:21,727 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 21:03:21,727 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 344 flow. Second operand 3 states and 497 transitions. [2022-11-02 21:03:21,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 162 transitions, 384 flow [2022-11-02 21:03:21,729 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 21:03:21,732 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 342 flow [2022-11-02 21:03:21,732 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 21:03:21,733 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-02 21:03:21,733 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 342 flow [2022-11-02 21:03:21,734 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 21:03:21,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:21,734 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 21:03:21,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:03:21,735 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 21:03:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1186677298, now seen corresponding path program 1 times [2022-11-02 21:03:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:21,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600617128] [2022-11-02 21:03:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:21,871 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 21:03:21,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600617128] [2022-11-02 21:03:21,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600617128] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:03:21,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797294075] [2022-11-02 21:03:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:21,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:21,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:21,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:03:21,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:03:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:22,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 21:03:22,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:03:22,097 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 21:03:22,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:03:22,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797294075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:22,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:03:22,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-02 21:03:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503742991] [2022-11-02 21:03:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:22,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:03:22,100 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-02 21:03:22,101 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 21:03:22,101 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:22,102 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-02 21:03:22,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:22,221 INFO L130 PetriNetUnfolder]: 36/496 cut-off events. [2022-11-02 21:03:22,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 21:03:22,226 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 21:03:22,229 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 9 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-11-02 21:03:22,229 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-02 21:03:22,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:22,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:22,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-11-02 21:03:22,232 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9101899827288429 [2022-11-02 21:03:22,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-11-02 21:03:22,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-11-02 21:03:22,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:22,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-11-02 21:03:22,234 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 21:03:22,236 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 21:03:22,236 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 21:03:22,236 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 342 flow. Second operand 3 states and 527 transitions. [2022-11-02 21:03:22,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-02 21:03:22,240 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 21:03:22,244 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 372 flow [2022-11-02 21:03:22,244 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 21:03:22,245 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-02 21:03:22,245 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 372 flow [2022-11-02 21:03:22,245 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 21:03:22,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:22,246 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 21:03:22,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 21:03:22,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 21:03:22,461 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 21:03:22,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:22,462 INFO L85 PathProgramCache]: Analyzing trace with hash -359410964, now seen corresponding path program 1 times [2022-11-02 21:03:22,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:22,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186267434] [2022-11-02 21:03:22,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:22,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:22,645 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 21:03:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186267434] [2022-11-02 21:03:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186267434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:03:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894695037] [2022-11-02 21:03:22,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:22,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:22,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:22,647 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:03:22,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 21:03:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:22,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 21:03:22,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:03:22,821 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 21:03:22,821 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:03:22,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894695037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:22,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:03:22,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-02 21:03:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963441905] [2022-11-02 21:03:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:22,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:03:22,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:22,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:03:22,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:03:22,826 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-02 21:03:22,827 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 21:03:22,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:22,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-02 21:03:22,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:22,998 INFO L130 PetriNetUnfolder]: 78/616 cut-off events. [2022-11-02 21:03:22,998 INFO L131 PetriNetUnfolder]: For 138/151 co-relation queries the response was YES. [2022-11-02 21:03:23,005 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 21:03:23,010 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 6 changer transitions 0/171 dead transitions. [2022-11-02 21:03:23,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 436 flow [2022-11-02 21:03:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:03:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 21:03:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-11-02 21:03:23,013 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9119170984455959 [2022-11-02 21:03:23,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-11-02 21:03:23,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-11-02 21:03:23,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:23,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-11-02 21:03:23,016 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 21:03:23,018 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 21:03:23,019 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 21:03:23,019 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 372 flow. Second operand 3 states and 528 transitions. [2022-11-02 21:03:23,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 171 transitions, 436 flow [2022-11-02 21:03:23,022 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 21:03:23,025 INFO L231 Difference]: Finished difference. Result has 170 places, 170 transitions, 422 flow [2022-11-02 21:03:23,026 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 21:03:23,027 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-02 21:03:23,028 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 170 transitions, 422 flow [2022-11-02 21:03:23,028 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 21:03:23,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:23,029 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 21:03:23,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 21:03:23,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:23,257 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 21:03:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -598637021, now seen corresponding path program 1 times [2022-11-02 21:03:23,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:23,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078053942] [2022-11-02 21:03:23,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:23,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:23,388 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 21:03:23,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:23,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078053942] [2022-11-02 21:03:23,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078053942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:03:23,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572154579] [2022-11-02 21:03:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:23,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:03:23,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 21:03:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:23,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 21:03:23,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:03:23,678 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 21:03:23,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:03:23,792 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 21:03:23,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572154579] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:03:23,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:03:23,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 21:03:23,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314125148] [2022-11-02 21:03:23,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:03:23,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 21:03:23,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:23,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 21:03:23,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:03:23,797 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 21:03:23,799 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 21:03:23,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:23,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 21:03:23,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:24,222 INFO L130 PetriNetUnfolder]: 232/1316 cut-off events. [2022-11-02 21:03:24,222 INFO L131 PetriNetUnfolder]: For 997/1025 co-relation queries the response was YES. [2022-11-02 21:03:24,234 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 21:03:24,244 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 62 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-11-02 21:03:24,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 220 transitions, 876 flow [2022-11-02 21:03:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:03:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 21:03:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1533 transitions. [2022-11-02 21:03:24,248 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2022-11-02 21:03:24,249 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1533 transitions. [2022-11-02 21:03:24,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1533 transitions. [2022-11-02 21:03:24,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:24,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1533 transitions. [2022-11-02 21:03:24,254 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 21:03:24,258 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 21:03:24,259 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 21:03:24,260 INFO L175 Difference]: Start difference. First operand has 170 places, 170 transitions, 422 flow. Second operand 9 states and 1533 transitions. [2022-11-02 21:03:24,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 220 transitions, 876 flow [2022-11-02 21:03:24,263 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 21:03:24,266 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 460 flow [2022-11-02 21:03:24,267 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 21:03:24,267 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-02 21:03:24,268 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 460 flow [2022-11-02 21:03:24,269 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 21:03:24,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:24,270 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 21:03:24,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 21:03:24,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:24,497 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 21:03:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:24,497 INFO L85 PathProgramCache]: Analyzing trace with hash 327415809, now seen corresponding path program 2 times [2022-11-02 21:03:24,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:24,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616262891] [2022-11-02 21:03:24,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:24,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:24,794 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 21:03:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:24,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616262891] [2022-11-02 21:03:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616262891] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:03:24,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75550530] [2022-11-02 21:03:24,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 21:03:24,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:24,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:24,797 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:03:24,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 21:03:24,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 21:03:24,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:03:24,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 21:03:24,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:03:25,214 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 21:03:25,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:03:25,537 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 21:03:25,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75550530] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:03:25,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:03:25,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-02 21:03:25,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071456342] [2022-11-02 21:03:25,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:03:25,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 21:03:25,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 21:03:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-02 21:03:25,542 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 21:03:25,545 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 21:03:25,545 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:25,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 21:03:25,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:26,443 INFO L130 PetriNetUnfolder]: 392/2176 cut-off events. [2022-11-02 21:03:26,444 INFO L131 PetriNetUnfolder]: For 1508/1536 co-relation queries the response was YES. [2022-11-02 21:03:26,459 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 21:03:26,471 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 138 selfloop transitions, 21 changer transitions 0/308 dead transitions. [2022-11-02 21:03:26,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 308 transitions, 1558 flow [2022-11-02 21:03:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 21:03:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 21:03:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3567 transitions. [2022-11-02 21:03:26,478 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8800888230940045 [2022-11-02 21:03:26,478 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3567 transitions. [2022-11-02 21:03:26,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3567 transitions. [2022-11-02 21:03:26,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:26,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3567 transitions. [2022-11-02 21:03:26,489 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 21:03:26,496 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 21:03:26,498 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 21:03:26,498 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 460 flow. Second operand 21 states and 3567 transitions. [2022-11-02 21:03:26,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 308 transitions, 1558 flow [2022-11-02 21:03:26,503 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 21:03:26,507 INFO L231 Difference]: Finished difference. Result has 203 places, 189 transitions, 584 flow [2022-11-02 21:03:26,507 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 21:03:26,508 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, 13 predicate places. [2022-11-02 21:03:26,508 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 584 flow [2022-11-02 21:03:26,509 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 21:03:26,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:26,510 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 21:03:26,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 21:03:26,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 21:03:26,726 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 21:03:26,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:26,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1096529341, now seen corresponding path program 3 times [2022-11-02 21:03:26,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:26,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832172735] [2022-11-02 21:03:26,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:26,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:27,396 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 21:03:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:27,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832172735] [2022-11-02 21:03:27,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832172735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:03:27,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610216057] [2022-11-02 21:03:27,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 21:03:27,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:27,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:27,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:03:27,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 21:03:27,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-02 21:03:27,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:03:27,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 21:03:27,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:03:28,063 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 21:03:28,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:03:28,800 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 21:03:28,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610216057] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:03:28,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:03:28,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-02 21:03:28,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569674407] [2022-11-02 21:03:28,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:03:28,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 21:03:28,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:28,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 21:03:28,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 21:03:28,816 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 21:03:28,825 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 21:03:28,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:28,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 21:03:28,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:31,421 INFO L130 PetriNetUnfolder]: 712/3896 cut-off events. [2022-11-02 21:03:31,422 INFO L131 PetriNetUnfolder]: For 4546/4574 co-relation queries the response was YES. [2022-11-02 21:03:31,465 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 21:03:31,494 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 290 selfloop transitions, 45 changer transitions 0/484 dead transitions. [2022-11-02 21:03:31,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 484 transitions, 3090 flow [2022-11-02 21:03:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-02 21:03:31,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-02 21:03:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7635 transitions. [2022-11-02 21:03:31,511 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8791018998272885 [2022-11-02 21:03:31,512 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 7635 transitions. [2022-11-02 21:03:31,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 7635 transitions. [2022-11-02 21:03:31,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:31,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 7635 transitions. [2022-11-02 21:03:31,539 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 21:03:31,559 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 21:03:31,563 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 21:03:31,564 INFO L175 Difference]: Start difference. First operand has 203 places, 189 transitions, 584 flow. Second operand 45 states and 7635 transitions. [2022-11-02 21:03:31,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 484 transitions, 3090 flow [2022-11-02 21:03:31,576 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 21:03:31,583 INFO L231 Difference]: Finished difference. Result has 250 places, 214 transitions, 862 flow [2022-11-02 21:03:31,584 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 21:03:31,584 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, 60 predicate places. [2022-11-02 21:03:31,585 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 214 transitions, 862 flow [2022-11-02 21:03:31,587 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 21:03:31,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:31,588 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 21:03:31,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 21:03:31,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:31,797 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 21:03:31,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1622679613, now seen corresponding path program 4 times [2022-11-02 21:03:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:31,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928332166] [2022-11-02 21:03:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:31,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:34,421 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 21:03:34,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:34,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928332166] [2022-11-02 21:03:34,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928332166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:03:34,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470112068] [2022-11-02 21:03:34,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 21:03:34,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:34,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:03:34,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:03:34,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 21:03:34,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 21:03:34,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 21:03:34,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 21:03:34,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:03:35,641 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 21:03:35,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 21:03:37,454 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 21:03:37,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470112068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 21:03:37,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 21:03:37,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2022-11-02 21:03:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115363822] [2022-11-02 21:03:37,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 21:03:37,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 21:03:37,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:37,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 21:03:37,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2022-11-02 21:03:37,477 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-02 21:03:37,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 214 transitions, 862 flow. Second operand has 51 states, 51 states have (on average 168.09803921568627) internal successors, (8573), 51 states have internal predecessors, (8573), 0 states have call successors, (0), 0 states 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 21:03:37,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 21:03:37,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-02 21:03:37,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 21:03:42,569 INFO L130 PetriNetUnfolder]: 1072/5831 cut-off events. [2022-11-02 21:03:42,569 INFO L131 PetriNetUnfolder]: For 12425/12453 co-relation queries the response was YES. [2022-11-02 21:03:42,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11763 conditions, 5831 events. 1072/5831 cut-off events. For 12425/12453 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 27701 event pairs, 13 based on Foata normal form. 51/5823 useless extension candidates. Maximal degree in co-relation 11739. Up to 553 conditions per place. [2022-11-02 21:03:42,665 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 461 selfloop transitions, 72 changer transitions 0/682 dead transitions. [2022-11-02 21:03:42,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 682 transitions, 4942 flow [2022-11-02 21:03:42,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-02 21:03:42,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2022-11-02 21:03:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 12208 transitions. [2022-11-02 21:03:42,686 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8785261945883708 [2022-11-02 21:03:42,686 INFO L72 ComplementDD]: Start complementDD. Operand 72 states and 12208 transitions. [2022-11-02 21:03:42,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 12208 transitions. [2022-11-02 21:03:42,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 21:03:42,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 72 states and 12208 transitions. [2022-11-02 21:03:42,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 73 states, 72 states have (on average 169.55555555555554) internal successors, (12208), 72 states have internal predecessors, (12208), 0 states have call successors, (0), 0 states 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 21:03:42,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 73 states, 73 states have (on average 193.0) internal successors, (14089), 73 states have internal predecessors, (14089), 0 states have call successors, (0), 0 states 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 21:03:42,747 INFO L81 ComplementDD]: Finished complementDD. Result has 73 states, 73 states have (on average 193.0) internal successors, (14089), 73 states have internal predecessors, (14089), 0 states have call successors, (0), 0 states 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 21:03:42,747 INFO L175 Difference]: Start difference. First operand has 250 places, 214 transitions, 862 flow. Second operand 72 states and 12208 transitions. [2022-11-02 21:03:42,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 682 transitions, 4942 flow [2022-11-02 21:03:42,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 682 transitions, 4868 flow, removed 19 selfloop flow, removed 18 redundant places. [2022-11-02 21:03:42,775 INFO L231 Difference]: Finished difference. Result has 313 places, 242 transitions, 1244 flow [2022-11-02 21:03:42,776 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=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=1244, PETRI_PLACES=313, PETRI_TRANSITIONS=242} [2022-11-02 21:03:42,776 INFO L287 CegarLoopForPetriNet]: 190 programPoint places, 123 predicate places. [2022-11-02 21:03:42,776 INFO L495 AbstractCegarLoop]: Abstraction has has 313 places, 242 transitions, 1244 flow [2022-11-02 21:03:42,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 168.09803921568627) internal successors, (8573), 51 states have internal predecessors, (8573), 0 states have call successors, (0), 0 states 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 21:03:42,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 21:03:42,780 INFO L208 CegarLoopForPetriNet]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:03:42,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 21:03:43,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:03:43,005 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 21:03:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1000750044, now seen corresponding path program 5 times [2022-11-02 21:03:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:43,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102889016] [2022-11-02 21:03:43,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:03:43,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 21:03:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 21:03:43,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 21:03:43,908 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 21:03:43,909 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-02 21:03:43,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-02 21:03:43,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-02 21:03:43,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-02 21:03:43,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-02 21:03:43,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-02 21:03:43,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-02 21:03:43,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-02 21:03:43,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-02 21:03:43,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-02 21:03:43,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-02 21:03:43,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-02 21:03:43,914 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-02 21:03:43,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-02 21:03:43,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-02 21:03:43,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-02 21:03:43,915 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-11-02 21:03:43,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-11-02 21:03:43,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-02 21:03:43,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-02 21:03:43,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-02 21:03:43,916 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-02 21:03:43,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-02 21:03:43,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-02 21:03:43,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-02 21:03:43,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-11-02 21:03:43,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-11-02 21:03:43,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-02 21:03:43,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-02 21:03:43,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-02 21:03:43,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-02 21:03:43,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-02 21:03:43,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-02 21:03:43,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-02 21:03:43,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-02 21:03:43,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-02 21:03:43,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-02 21:03:43,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-02 21:03:43,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-02 21:03:43,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-02 21:03:43,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-02 21:03:43,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-02 21:03:43,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-02 21:03:43,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-02 21:03:43,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-02 21:03:43,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-02 21:03:43,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:03:43,923 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 21:03:43,933 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-02 21:03:43,933 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 21:03:44,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 09:03:44 BasicIcfg [2022-11-02 21:03:44,499 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 21:03:44,500 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 21:03:44,500 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 21:03:44,500 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 21:03:44,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:03:17" (3/4) ... [2022-11-02 21:03:44,504 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 21:03:44,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 21:03:44,505 INFO L158 Benchmark]: Toolchain (without parser) took 28955.33ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 129.8MB in the beginning and 282.4MB in the end (delta: -152.6MB). Peak memory consumption was 325.3MB. Max. memory is 16.1GB. [2022-11-02 21:03:44,506 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 167.8MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:03:44,506 INFO L158 Benchmark]: CACSL2BoogieTranslator took 635.72ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 133.5MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 21:03:44,506 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.43ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 131.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:03:44,507 INFO L158 Benchmark]: Boogie Preprocessor took 72.83ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 21:03:44,507 INFO L158 Benchmark]: RCFGBuilder took 820.61ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 107.9MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-02 21:03:44,508 INFO L158 Benchmark]: TraceAbstraction took 27322.74ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 107.4MB in the beginning and 282.4MB in the end (delta: -175.0MB). Peak memory consumption was 319.2MB. Max. memory is 16.1GB. [2022-11-02 21:03:44,508 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 645.9MB. Free memory is still 282.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 21:03:44,511 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 167.8MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 635.72ms. Allocated memory is still 167.8MB. Free memory was 129.6MB in the beginning and 133.5MB in the end (delta: -3.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.43ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 131.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.83ms. Allocated memory is still 167.8MB. Free memory was 131.3MB in the beginning and 129.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 820.61ms. Allocated memory is still 167.8MB. Free memory was 129.7MB in the beginning and 107.9MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 27322.74ms. Allocated memory was 167.8MB in the beginning and 645.9MB in the end (delta: 478.2MB). Free memory was 107.4MB in the beginning and 282.4MB in the end (delta: -175.0MB). Peak memory consumption was 319.2MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 645.9MB. Free memory is still 282.4MB. 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)=75121, argc=75121, argv={75064:75082}, argv={75064:75082}, 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)=75121, argc=75121, argv={75064:75082}, argv={75064:75082}, 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)=75121, argc=75121, argv={75064:75082}, argv={75064:75082}, 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)=75121, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, 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)=75121, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 < 24 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 TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=1597, p=0, prev=987, q=0, x=16] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=987, q=0, x=16] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1597, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=16] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=2584, p=0, prev=1597, q=0, x=17] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=1597, q=0, x=17] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2584, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=17] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=4181, p=0, prev=2584, q=0, x=18] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=2584, q=0, x=18] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=4181, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=18] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=6765, p=0, prev=4181, q=0, x=19] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=4181, q=0, x=19] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=6765, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=19] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=10946, p=0, prev=6765, q=0, x=20] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=6765, q=0, x=20] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=10946, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=20] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=17711, p=0, prev=10946, q=0, x=21] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=10946, q=0, x=21] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=17711, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=21] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=28657, p=0, prev=17711, q=0, x=22] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=17711, q=0, x=22] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=28657, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=22] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L706] COND TRUE 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=46368, p=0, prev=28657, q=0, x=23] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=28657, q=0, x=23] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=46368, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=23] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] 0 x < 24 VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L706] COND FALSE 0 !(x < 24) VAL [arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L711] 0 return prev; VAL [\result=46368, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(argc)=75121, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, correct=46368, cur=75025, fib()=46368, i=1, id1={5:0}, id2={3:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i <= correct VAL [\old(argc)=75121, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, correct=46368, cur=75025, i=1, id1={5:0}, id2={3:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L688] COND TRUE 1 p < 11 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=1, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=2, j=1, next=75025, p=0, prev=46368, q=0, x=24] [L725] 0 i <= correct VAL [\old(argc)=75121, arg={0:0}, arg={0:0}, arg={0:0}, argc=75121, argv={75064:75082}, argv={75064:75082}, correct=46368, cur=75025, i=2, id1={5:0}, id2={3:0}, j=1, next=75025, p=0, prev=46368, q=0, x=24] 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: 26.6s, OverallIterations: 24, TraceHistogramMax: 25, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1286 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1286 mSDsluCounter, 240 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 979 IncrementalHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 152 mSDtfsCounter, 979 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2772 GetRequests, 2538 SyntacticMatches, 15 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3489 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1244occurred in iteration=23, InterpolantAutomatonStates: 203, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 4594 NumberOfCodeBlocks, 4594 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 21:03:45,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6075ef35-84ae-4bfc-aed8-9b81d43dcb23/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE