./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e04fb08f 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_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8 --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 c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c --- 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-e04fb08 [2022-11-16 12:14:44,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:14:44,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:14:44,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:14:44,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:14:44,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:14:44,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:14:44,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:14:44,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:14:44,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:14:44,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:14:44,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:14:44,456 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:14:44,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:14:44,462 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:14:44,464 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:14:44,465 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:14:44,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:14:44,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:14:44,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:14:44,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:14:44,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:14:44,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:14:44,489 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:14:44,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:14:44,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:14:44,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:14:44,503 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:14:44,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:14:44,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:14:44,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:14:44,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:14:44,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:14:44,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:14:44,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:14:44,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:14:44,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:14:44,516 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:14:44,516 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:14:44,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:14:44,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:14:44,523 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-16 12:14:44,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:14:44,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:14:44,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:14:44,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:14:44,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:14:44,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:14:44,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:14:44,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:14:44,576 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:14:44,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:14:44,578 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 12:14:44,578 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 12:14:44,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:14:44,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 12:14:44,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:14:44,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:14:44,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:14:44,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:14:44,580 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-16 12:14:44,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 12:14:44,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:14:44,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:14:44,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:14:44,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:14:44,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:14:44,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:14:44,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:14:44,582 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:14:44,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:14:44,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:14:44,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:14:44,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:14:44,585 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:14:44,585 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:14:44,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:14:44,586 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_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/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_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8 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 -> c902137dd689344b33e1214981c74c26e47854ade5db7e5e71980f90fd07d90c [2022-11-16 12:14:44,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:14:45,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:14:45,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:14:45,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:14:45,018 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:14:45,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-11-16 12:14:45,102 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/data/00dbc3243/e6027c8b667144dba5d108f48fb3c3bb/FLAGfae350e5c [2022-11-16 12:14:45,720 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:14:45,721 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c [2022-11-16 12:14:45,733 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/data/00dbc3243/e6027c8b667144dba5d108f48fb3c3bb/FLAGfae350e5c [2022-11-16 12:14:46,039 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/data/00dbc3243/e6027c8b667144dba5d108f48fb3c3bb [2022-11-16 12:14:46,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:14:46,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:14:46,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:14:46,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:14:46,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:14:46,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729e8dd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46, skipping insertion in model container [2022-11-16 12:14:46,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:14:46,093 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:14:46,494 WARN L229 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_d1c6a9fb-c54d-4749-b630-3070881f2c4f/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-11-16 12:14:46,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:14:46,514 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:14:46,549 WARN L229 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_d1c6a9fb-c54d-4749-b630-3070881f2c4f/sv-benchmarks/c/weaver/popl20-channel-sum.wvr.c[2947,2960] [2022-11-16 12:14:46,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:14:46,571 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:14:46,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46 WrapperNode [2022-11-16 12:14:46,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:14:46,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:14:46,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:14:46,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:14:46,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,647 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 281 [2022-11-16 12:14:46,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:14:46,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:14:46,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:14:46,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:14:46,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,686 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:14:46,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:14:46,693 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:14:46,693 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:14:46,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (1/1) ... [2022-11-16 12:14:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:14:46,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:14:46,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:14:46,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:14:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:14:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 12:14:46,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 12:14:46,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 12:14:46,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 12:14:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:14:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:14:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:14:46,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 12:14:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 12:14:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:14:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:14:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:14:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:14:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:14:46,828 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 12:14:46,959 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:14:46,961 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:14:47,726 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:14:47,905 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:14:47,905 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-16 12:14:47,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:14:47 BoogieIcfgContainer [2022-11-16 12:14:47,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:14:47,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:14:47,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:14:47,917 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:14:47,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:14:46" (1/3) ... [2022-11-16 12:14:47,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e230fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:14:47, skipping insertion in model container [2022-11-16 12:14:47,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:14:46" (2/3) ... [2022-11-16 12:14:47,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e230fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:14:47, skipping insertion in model container [2022-11-16 12:14:47,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:14:47" (3/3) ... [2022-11-16 12:14:47,921 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-11-16 12:14:47,932 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 12:14:47,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:14:47,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2022-11-16 12:14:47,944 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 12:14:48,078 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 12:14:48,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 265 transitions, 546 flow [2022-11-16 12:14:48,255 INFO L130 PetriNetUnfolder]: 13/263 cut-off events. [2022-11-16 12:14:48,255 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-16 12:14:48,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 263 events. 13/263 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 424 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2022-11-16 12:14:48,268 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 265 transitions, 546 flow [2022-11-16 12:14:48,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 242 transitions, 496 flow [2022-11-16 12:14:48,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:14:48,299 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;@42ecabe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:14:48,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-11-16 12:14:48,323 INFO L130 PetriNetUnfolder]: 0/24 cut-off events. [2022-11-16 12:14:48,323 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:14:48,323 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:48,324 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:48,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1844654969, now seen corresponding path program 1 times [2022-11-16 12:14:48,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:48,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791031860] [2022-11-16 12:14:48,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:48,646 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-16 12:14:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:48,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791031860] [2022-11-16 12:14:48,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791031860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:48,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:48,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:48,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417200989] [2022-11-16 12:14:48,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:48,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:48,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:48,726 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 265 [2022-11-16 12:14:48,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 242 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:48,737 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:48,737 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 265 [2022-11-16 12:14:48,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:49,085 INFO L130 PetriNetUnfolder]: 133/756 cut-off events. [2022-11-16 12:14:49,085 INFO L131 PetriNetUnfolder]: For 39/76 co-relation queries the response was YES. [2022-11-16 12:14:49,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 756 events. 133/756 cut-off events. For 39/76 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3719 event pairs, 84 based on Foata normal form. 48/679 useless extension candidates. Maximal degree in co-relation 850. Up to 241 conditions per place. [2022-11-16 12:14:49,095 INFO L137 encePairwiseOnDemand]: 239/265 looper letters, 32 selfloop transitions, 2 changer transitions 2/218 dead transitions. [2022-11-16 12:14:49,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 218 transitions, 516 flow [2022-11-16 12:14:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 673 transitions. [2022-11-16 12:14:49,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8465408805031447 [2022-11-16 12:14:49,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 673 transitions. [2022-11-16 12:14:49,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 673 transitions. [2022-11-16 12:14:49,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:49,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 673 transitions. [2022-11-16 12:14:49,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,146 INFO L175 Difference]: Start difference. First operand has 238 places, 242 transitions, 496 flow. Second operand 3 states and 673 transitions. [2022-11-16 12:14:49,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 218 transitions, 516 flow [2022-11-16 12:14:49,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 218 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:14:49,158 INFO L231 Difference]: Finished difference. Result has 218 places, 216 transitions, 440 flow [2022-11-16 12:14:49,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=218, PETRI_TRANSITIONS=216} [2022-11-16 12:14:49,165 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -20 predicate places. [2022-11-16 12:14:49,166 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 440 flow [2022-11-16 12:14:49,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:49,167 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:49,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:14:49,167 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:49,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:49,168 INFO L85 PathProgramCache]: Analyzing trace with hash -277850793, now seen corresponding path program 1 times [2022-11-16 12:14:49,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:49,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050320386] [2022-11-16 12:14:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:49,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:49,235 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-16 12:14:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:49,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050320386] [2022-11-16 12:14:49,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050320386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:49,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:49,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:49,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437955182] [2022-11-16 12:14:49,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:49,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:49,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:49,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:49,241 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 265 [2022-11-16 12:14:49,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:49,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 265 [2022-11-16 12:14:49,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:49,516 INFO L130 PetriNetUnfolder]: 105/687 cut-off events. [2022-11-16 12:14:49,517 INFO L131 PetriNetUnfolder]: For 8/39 co-relation queries the response was YES. [2022-11-16 12:14:49,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 687 events. 105/687 cut-off events. For 8/39 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3293 event pairs, 49 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 858. Up to 145 conditions per place. [2022-11-16 12:14:49,525 INFO L137 encePairwiseOnDemand]: 257/265 looper letters, 29 selfloop transitions, 3 changer transitions 0/217 dead transitions. [2022-11-16 12:14:49,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 217 transitions, 507 flow [2022-11-16 12:14:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2022-11-16 12:14:49,530 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8314465408805032 [2022-11-16 12:14:49,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2022-11-16 12:14:49,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2022-11-16 12:14:49,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:49,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2022-11-16 12:14:49,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,540 INFO L175 Difference]: Start difference. First operand has 218 places, 216 transitions, 440 flow. Second operand 3 states and 661 transitions. [2022-11-16 12:14:49,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 217 transitions, 507 flow [2022-11-16 12:14:49,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 217 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:49,554 INFO L231 Difference]: Finished difference. Result has 211 places, 211 transitions, 432 flow [2022-11-16 12:14:49,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=211, PETRI_TRANSITIONS=211} [2022-11-16 12:14:49,556 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -27 predicate places. [2022-11-16 12:14:49,556 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 211 transitions, 432 flow [2022-11-16 12:14:49,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,558 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:49,558 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:49,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:14:49,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1799275347, now seen corresponding path program 1 times [2022-11-16 12:14:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:49,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862390845] [2022-11-16 12:14:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:49,693 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-16 12:14:49,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:49,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862390845] [2022-11-16 12:14:49,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862390845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:49,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:49,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472049642] [2022-11-16 12:14:49,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:49,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:49,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:49,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:49,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:49,703 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-16 12:14:49,705 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 211 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,705 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:49,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-16 12:14:49,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:49,882 INFO L130 PetriNetUnfolder]: 28/532 cut-off events. [2022-11-16 12:14:49,882 INFO L131 PetriNetUnfolder]: For 13/32 co-relation queries the response was YES. [2022-11-16 12:14:49,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 532 events. 28/532 cut-off events. For 13/32 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2179 event pairs, 9 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 453. Up to 43 conditions per place. [2022-11-16 12:14:49,888 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 14 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2022-11-16 12:14:49,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 210 transitions, 462 flow [2022-11-16 12:14:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2022-11-16 12:14:49,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8628930817610063 [2022-11-16 12:14:49,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 686 transitions. [2022-11-16 12:14:49,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 686 transitions. [2022-11-16 12:14:49,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:49,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 686 transitions. [2022-11-16 12:14:49,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,902 INFO L175 Difference]: Start difference. First operand has 211 places, 211 transitions, 432 flow. Second operand 3 states and 686 transitions. [2022-11-16 12:14:49,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 210 transitions, 462 flow [2022-11-16 12:14:49,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:49,908 INFO L231 Difference]: Finished difference. Result has 210 places, 210 transitions, 428 flow [2022-11-16 12:14:49,908 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=210, PETRI_TRANSITIONS=210} [2022-11-16 12:14:49,911 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-11-16 12:14:49,911 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 210 transitions, 428 flow [2022-11-16 12:14:49,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:49,912 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:49,913 INFO L209 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] [2022-11-16 12:14:49,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:14:49,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:49,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:49,915 INFO L85 PathProgramCache]: Analyzing trace with hash -821310441, now seen corresponding path program 1 times [2022-11-16 12:14:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:49,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686241308] [2022-11-16 12:14:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:49,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:50,030 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-16 12:14:50,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:50,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686241308] [2022-11-16 12:14:50,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686241308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:50,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:50,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:50,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106821503] [2022-11-16 12:14:50,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:50,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:50,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:50,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:50,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:50,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-11-16 12:14:50,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 210 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,036 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:50,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-11-16 12:14:50,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:50,194 INFO L130 PetriNetUnfolder]: 49/576 cut-off events. [2022-11-16 12:14:50,194 INFO L131 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-11-16 12:14:50,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 576 events. 49/576 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2522 event pairs, 24 based on Foata normal form. 0/495 useless extension candidates. Maximal degree in co-relation 633. Up to 85 conditions per place. [2022-11-16 12:14:50,200 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-11-16 12:14:50,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 209 transitions, 470 flow [2022-11-16 12:14:50,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 674 transitions. [2022-11-16 12:14:50,203 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8477987421383648 [2022-11-16 12:14:50,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 674 transitions. [2022-11-16 12:14:50,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 674 transitions. [2022-11-16 12:14:50,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:50,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 674 transitions. [2022-11-16 12:14:50,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,211 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,211 INFO L175 Difference]: Start difference. First operand has 210 places, 210 transitions, 428 flow. Second operand 3 states and 674 transitions. [2022-11-16 12:14:50,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 209 transitions, 470 flow [2022-11-16 12:14:50,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 209 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:50,216 INFO L231 Difference]: Finished difference. Result has 209 places, 209 transitions, 426 flow [2022-11-16 12:14:50,217 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=209, PETRI_TRANSITIONS=209} [2022-11-16 12:14:50,218 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-16 12:14:50,218 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 209 transitions, 426 flow [2022-11-16 12:14:50,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:50,219 INFO L209 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-16 12:14:50,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:14:50,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:50,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:50,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1903267650, now seen corresponding path program 1 times [2022-11-16 12:14:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:50,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798869492] [2022-11-16 12:14:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:50,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:50,312 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-16 12:14:50,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:50,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798869492] [2022-11-16 12:14:50,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798869492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:50,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:50,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:50,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918604816] [2022-11-16 12:14:50,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:50,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:50,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:50,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:50,317 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-11-16 12:14:50,318 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 209 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,318 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:50,319 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-11-16 12:14:50,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:50,461 INFO L130 PetriNetUnfolder]: 42/555 cut-off events. [2022-11-16 12:14:50,461 INFO L131 PetriNetUnfolder]: For 8/27 co-relation queries the response was YES. [2022-11-16 12:14:50,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 555 events. 42/555 cut-off events. For 8/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2365 event pairs, 19 based on Foata normal form. 0/482 useless extension candidates. Maximal degree in co-relation 586. Up to 67 conditions per place. [2022-11-16 12:14:50,466 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 16 selfloop transitions, 1 changer transitions 0/207 dead transitions. [2022-11-16 12:14:50,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 207 transitions, 456 flow [2022-11-16 12:14:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-11-16 12:14:50,469 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-11-16 12:14:50,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-11-16 12:14:50,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-11-16 12:14:50,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:50,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-11-16 12:14:50,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,477 INFO L175 Difference]: Start difference. First operand has 209 places, 209 transitions, 426 flow. Second operand 3 states and 679 transitions. [2022-11-16 12:14:50,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 207 transitions, 456 flow [2022-11-16 12:14:50,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 207 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:50,482 INFO L231 Difference]: Finished difference. Result has 207 places, 207 transitions, 420 flow [2022-11-16 12:14:50,483 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=207, PETRI_TRANSITIONS=207} [2022-11-16 12:14:50,483 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-11-16 12:14:50,484 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 207 transitions, 420 flow [2022-11-16 12:14:50,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,485 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:50,485 INFO L209 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] [2022-11-16 12:14:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:14:50,486 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash -203738201, now seen corresponding path program 1 times [2022-11-16 12:14:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:50,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891370001] [2022-11-16 12:14:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:50,616 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-16 12:14:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:50,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891370001] [2022-11-16 12:14:50,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891370001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:50,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:50,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158474932] [2022-11-16 12:14:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:50,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:50,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:50,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:50,622 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 265 [2022-11-16 12:14:50,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 207 transitions, 420 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:50,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 265 [2022-11-16 12:14:50,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:50,777 INFO L130 PetriNetUnfolder]: 49/593 cut-off events. [2022-11-16 12:14:50,777 INFO L131 PetriNetUnfolder]: For 7/26 co-relation queries the response was YES. [2022-11-16 12:14:50,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 593 events. 49/593 cut-off events. For 7/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2598 event pairs, 24 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 639. Up to 82 conditions per place. [2022-11-16 12:14:50,782 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 17 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2022-11-16 12:14:50,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 206 transitions, 456 flow [2022-11-16 12:14:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 680 transitions. [2022-11-16 12:14:50,786 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8553459119496856 [2022-11-16 12:14:50,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 680 transitions. [2022-11-16 12:14:50,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 680 transitions. [2022-11-16 12:14:50,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:50,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 680 transitions. [2022-11-16 12:14:50,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,792 INFO L175 Difference]: Start difference. First operand has 207 places, 207 transitions, 420 flow. Second operand 3 states and 680 transitions. [2022-11-16 12:14:50,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 206 transitions, 456 flow [2022-11-16 12:14:50,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 206 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:14:50,798 INFO L231 Difference]: Finished difference. Result has 207 places, 206 transitions, 421 flow [2022-11-16 12:14:50,798 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=207, PETRI_TRANSITIONS=206} [2022-11-16 12:14:50,801 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -31 predicate places. [2022-11-16 12:14:50,801 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 206 transitions, 421 flow [2022-11-16 12:14:50,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:50,803 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:50,804 INFO L209 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-16 12:14:50,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:14:50,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:50,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1926610376, now seen corresponding path program 1 times [2022-11-16 12:14:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:50,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133257278] [2022-11-16 12:14:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:50,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:51,608 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-16 12:14:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:51,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133257278] [2022-11-16 12:14:51,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133257278] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:51,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:51,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:14:51,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317288452] [2022-11-16 12:14:51,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:51,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:14:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:14:51,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:14:51,621 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 265 [2022-11-16 12:14:51,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 206 transitions, 421 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:51,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:51,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 265 [2022-11-16 12:14:51,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:52,290 INFO L130 PetriNetUnfolder]: 635/2367 cut-off events. [2022-11-16 12:14:52,291 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 12:14:52,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3349 conditions, 2367 events. 635/2367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 16915 event pairs, 465 based on Foata normal form. 0/2014 useless extension candidates. Maximal degree in co-relation 3303. Up to 963 conditions per place. [2022-11-16 12:14:52,309 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 40 selfloop transitions, 5 changer transitions 0/205 dead transitions. [2022-11-16 12:14:52,309 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 205 transitions, 509 flow [2022-11-16 12:14:52,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:14:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:14:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1210 transitions. [2022-11-16 12:14:52,313 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7610062893081762 [2022-11-16 12:14:52,314 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1210 transitions. [2022-11-16 12:14:52,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1210 transitions. [2022-11-16 12:14:52,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:52,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1210 transitions. [2022-11-16 12:14:52,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.66666666666666) internal successors, (1210), 6 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:52,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:52,323 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:52,324 INFO L175 Difference]: Start difference. First operand has 207 places, 206 transitions, 421 flow. Second operand 6 states and 1210 transitions. [2022-11-16 12:14:52,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 205 transitions, 509 flow [2022-11-16 12:14:52,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 205 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:52,329 INFO L231 Difference]: Finished difference. Result has 209 places, 205 transitions, 425 flow [2022-11-16 12:14:52,329 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=209, PETRI_TRANSITIONS=205} [2022-11-16 12:14:52,332 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-16 12:14:52,332 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 205 transitions, 425 flow [2022-11-16 12:14:52,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:52,333 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:52,333 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:52,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:14:52,334 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:52,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash -739569207, now seen corresponding path program 1 times [2022-11-16 12:14:52,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:52,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481074098] [2022-11-16 12:14:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:52,989 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-16 12:14:52,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:52,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481074098] [2022-11-16 12:14:52,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481074098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:52,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:52,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:14:52,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443896328] [2022-11-16 12:14:52,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:52,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:14:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:52,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:14:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:14:52,996 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-16 12:14:53,001 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 205 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:53,001 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:53,001 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-16 12:14:53,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:53,722 INFO L130 PetriNetUnfolder]: 635/1599 cut-off events. [2022-11-16 12:14:53,722 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-16 12:14:53,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 1599 events. 635/1599 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8814 event pairs, 102 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 2553. Up to 335 conditions per place. [2022-11-16 12:14:53,736 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 85 selfloop transitions, 4 changer transitions 0/256 dead transitions. [2022-11-16 12:14:53,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 256 transitions, 705 flow [2022-11-16 12:14:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:14:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:14:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1284 transitions. [2022-11-16 12:14:53,740 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8075471698113208 [2022-11-16 12:14:53,741 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1284 transitions. [2022-11-16 12:14:53,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1284 transitions. [2022-11-16 12:14:53,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:53,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1284 transitions. [2022-11-16 12:14:53,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:53,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:53,751 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:53,751 INFO L175 Difference]: Start difference. First operand has 209 places, 205 transitions, 425 flow. Second operand 6 states and 1284 transitions. [2022-11-16 12:14:53,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 256 transitions, 705 flow [2022-11-16 12:14:53,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 256 transitions, 695 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 12:14:53,758 INFO L231 Difference]: Finished difference. Result has 208 places, 204 transitions, 421 flow [2022-11-16 12:14:53,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=208, PETRI_TRANSITIONS=204} [2022-11-16 12:14:53,762 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -30 predicate places. [2022-11-16 12:14:53,763 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 204 transitions, 421 flow [2022-11-16 12:14:53,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 200.83333333333334) internal successors, (1205), 6 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:53,764 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:53,764 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:53,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:14:53,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:53,765 INFO L85 PathProgramCache]: Analyzing trace with hash -378556232, now seen corresponding path program 1 times [2022-11-16 12:14:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:53,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073793550] [2022-11-16 12:14:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:53,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:53,845 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-16 12:14:53,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:53,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073793550] [2022-11-16 12:14:53,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073793550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:53,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:53,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:53,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781614562] [2022-11-16 12:14:53,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:53,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:53,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:53,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:53,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:53,849 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-16 12:14:53,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 204 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:53,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:53,851 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-16 12:14:53,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:53,987 INFO L130 PetriNetUnfolder]: 51/623 cut-off events. [2022-11-16 12:14:53,987 INFO L131 PetriNetUnfolder]: For 10/27 co-relation queries the response was YES. [2022-11-16 12:14:53,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 623 events. 51/623 cut-off events. For 10/27 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2708 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 675. Up to 70 conditions per place. [2022-11-16 12:14:53,993 INFO L137 encePairwiseOnDemand]: 261/265 looper letters, 20 selfloop transitions, 3 changer transitions 0/211 dead transitions. [2022-11-16 12:14:53,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 211 transitions, 484 flow [2022-11-16 12:14:53,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:53,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2022-11-16 12:14:53,997 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8716981132075472 [2022-11-16 12:14:53,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 693 transitions. [2022-11-16 12:14:53,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 693 transitions. [2022-11-16 12:14:53,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:53,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 693 transitions. [2022-11-16 12:14:54,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:54,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:54,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:54,004 INFO L175 Difference]: Start difference. First operand has 208 places, 204 transitions, 421 flow. Second operand 3 states and 693 transitions. [2022-11-16 12:14:54,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 211 transitions, 484 flow [2022-11-16 12:14:54,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 477 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:14:54,016 INFO L231 Difference]: Finished difference. Result has 206 places, 206 transitions, 433 flow [2022-11-16 12:14:54,017 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=206} [2022-11-16 12:14:54,019 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-11-16 12:14:54,019 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 206 transitions, 433 flow [2022-11-16 12:14:54,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:54,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:54,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:54,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:14:54,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:54,021 INFO L85 PathProgramCache]: Analyzing trace with hash -927163810, now seen corresponding path program 1 times [2022-11-16 12:14:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:54,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163490087] [2022-11-16 12:14:54,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:54,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:54,570 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-16 12:14:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:54,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163490087] [2022-11-16 12:14:54,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163490087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:54,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:54,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:14:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160719539] [2022-11-16 12:14:54,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:54,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:14:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:54,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:14:54,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:14:54,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 265 [2022-11-16 12:14:54,577 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 206 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:54,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:54,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 265 [2022-11-16 12:14:54,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:55,260 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 302#(= |#race~queue~0| 0), 103#L52-5true, 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 305#true, 232#L68true]) [2022-11-16 12:14:55,261 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-16 12:14:55,261 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 12:14:55,261 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-16 12:14:55,261 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-16 12:14:55,264 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 302#(= |#race~queue~0| 0), 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 238#L79true, 173#L52-1true, 305#true]) [2022-11-16 12:14:55,264 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-16 12:14:55,264 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-16 12:14:55,265 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-16 12:14:55,265 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 12:14:55,265 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 302#(= |#race~queue~0| 0), 199#L72true, 280#(= |#race~n~0| 0), 296#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 173#L52-1true, 305#true]) [2022-11-16 12:14:55,266 INFO L383 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-11-16 12:14:55,266 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 12:14:55,266 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-16 12:14:55,266 INFO L386 tUnfolder$Statistics]: existing Event has 109 ancestors and is cut-off event [2022-11-16 12:14:55,267 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 302#(= |#race~queue~0| 0), 7#L101-4true, 103#L52-5true, 280#(= |#race~n~0| 0), 305#true, 232#L68true]) [2022-11-16 12:14:55,267 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-16 12:14:55,267 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-16 12:14:55,267 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-16 12:14:55,267 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-16 12:14:55,279 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 302#(= |#race~queue~0| 0), 7#L101-4true, 280#(= |#race~n~0| 0), 238#L79true, 173#L52-1true, 305#true]) [2022-11-16 12:14:55,279 INFO L383 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-11-16 12:14:55,279 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-16 12:14:55,279 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-16 12:14:55,279 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 12:14:55,280 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 302#(= |#race~queue~0| 0), 199#L72true, 7#L101-4true, 280#(= |#race~n~0| 0), 173#L52-1true, 305#true]) [2022-11-16 12:14:55,280 INFO L383 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-11-16 12:14:55,280 INFO L386 tUnfolder$Statistics]: existing Event has 110 ancestors and is cut-off event [2022-11-16 12:14:55,281 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-16 12:14:55,281 INFO L386 tUnfolder$Statistics]: existing Event has 115 ancestors and is cut-off event [2022-11-16 12:14:55,281 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 103#L52-5true, 56#L101-5true, 280#(= |#race~n~0| 0), 305#true, 232#L68true]) [2022-11-16 12:14:55,282 INFO L383 tUnfolder$Statistics]: this new event has 120 ancestors and is cut-off event [2022-11-16 12:14:55,282 INFO L386 tUnfolder$Statistics]: existing Event has 113 ancestors and is cut-off event [2022-11-16 12:14:55,282 INFO L386 tUnfolder$Statistics]: existing Event has 120 ancestors and is cut-off event [2022-11-16 12:14:55,282 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-16 12:14:55,283 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 56#L101-5true, 238#L79true, 280#(= |#race~n~0| 0), 173#L52-1true, 305#true]) [2022-11-16 12:14:55,283 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-16 12:14:55,283 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 12:14:55,283 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 12:14:55,283 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-16 12:14:55,284 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 199#L72true, 56#L101-5true, 280#(= |#race~n~0| 0), 173#L52-1true, 305#true]) [2022-11-16 12:14:55,284 INFO L383 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-11-16 12:14:55,284 INFO L386 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-11-16 12:14:55,284 INFO L386 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-11-16 12:14:55,284 INFO L386 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-11-16 12:14:55,296 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([817] L52-4-->L52-5: Formula: (= (select (select |v_#memory_int_1| v_~queue~0.base_1) (+ v_~queue~0.offset_1 (* v_~front~0_4 4))) |v_thread1Thread1of1ForFork1_#t~mem2#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} OutVars{#memory_int=|v_#memory_int_1|, ~queue~0.offset=v_~queue~0.offset_1, thread1Thread1of1ForFork1_#t~mem2#1=|v_thread1Thread1of1ForFork1_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_1, ~front~0=v_~front~0_4} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~mem2#1][149], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 103#L52-5true, 280#(= |#race~n~0| 0), 305#true, 232#L68true, 256#L101-6true]) [2022-11-16 12:14:55,297 INFO L383 tUnfolder$Statistics]: this new event has 121 ancestors and is cut-off event [2022-11-16 12:14:55,297 INFO L386 tUnfolder$Statistics]: existing Event has 121 ancestors and is cut-off event [2022-11-16 12:14:55,297 INFO L386 tUnfolder$Statistics]: existing Event has 114 ancestors and is cut-off event [2022-11-16 12:14:55,297 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-16 12:14:55,298 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([878] L77-->L79: Formula: (let ((.cse5 (* v_~back~0_143 4))) (let ((.cse2 (+ 2 .cse5 v_~queue~0.offset_74)) (.cse4 (+ 3 .cse5 v_~queue~0.offset_74)) (.cse1 (+ .cse5 v_~queue~0.offset_74)) (.cse0 (select |v_#race_149| v_~queue~0.base_74)) (.cse3 (+ .cse5 v_~queue~0.offset_74 1))) (and (= |v_#race~back~0_146| 0) (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= |v_#race_149| (store |v_#race_150| v_~queue~0.base_74 (store (store (store (store (select |v_#race_150| v_~queue~0.base_74) .cse1 0) .cse3 0) .cse2 0) .cse4 0))) (= |v_#race~queue~0_39| 0) (= (select .cse0 .cse4) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (ite (= (+ (select (select |v_#memory_int_36| v_~queue~0.base_74) .cse1) 1) 0) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|) (= (select .cse0 .cse3) 0)))) InVars {#race=|v_#race_150|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, ~queue~0.offset=v_~queue~0.offset_74, ~queue~0.base=v_~queue~0.base_74} OutVars{#race=|v_#race_149|, ~queue~0.offset=v_~queue~0.offset_74, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #race~queue~0=|v_#race~queue~0_39|, thread2Thread1of1ForFork0_#t~mem12#1=|v_thread2Thread1of1ForFork0_#t~mem12#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~back~0=v_~back~0_143, #memory_int=|v_#memory_int_36|, #race~back~0=|v_#race~back~0_146|, ~queue~0.base=v_~queue~0.base_74} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_#t~mem12#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][150], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 238#L79true, 280#(= |#race~n~0| 0), 173#L52-1true, 305#true, 256#L101-6true]) [2022-11-16 12:14:55,298 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-16 12:14:55,298 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-16 12:14:55,298 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-16 12:14:55,298 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-16 12:14:55,299 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([874] L70-->L72: Formula: (let ((.cse5 (* v_~back~0_147 4))) (let ((.cse3 (+ 2 .cse5 v_~queue~0.offset_78)) (.cse2 (+ 3 .cse5 v_~queue~0.offset_78)) (.cse1 (+ .cse5 v_~queue~0.offset_78)) (.cse0 (select |v_#race_157| v_~queue~0.base_78)) (.cse4 (+ .cse5 v_~queue~0.offset_78 1))) (and (= |v_#race~back~0_150| 0) (= |v_#race~queue~0_43| 0) (= (select .cse0 .cse1) 0) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|) (= 0 (select .cse0 .cse2)) (= (select .cse0 .cse3) 0) (= |v_#race_157| (store |v_#race_158| v_~queue~0.base_78 (store (store (store (store (select |v_#race_158| v_~queue~0.base_78) .cse1 0) .cse4 0) .cse3 0) .cse2 0))) (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3| 0)) (= (ite (= (select (select |v_#memory_int_40| v_~queue~0.base_78) .cse1) 1) 1 0) |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|) (= (select .cse0 .cse4) 0)))) InVars {#race=|v_#race_158|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, ~queue~0.offset=v_~queue~0.offset_78, ~queue~0.base=v_~queue~0.base_78} OutVars{#race=|v_#race_157|, ~queue~0.offset=v_~queue~0.offset_78, thread2Thread1of1ForFork0_#t~mem9#1=|v_thread2Thread1of1ForFork0_#t~mem9#1_3|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_3|, #race~queue~0=|v_#race~queue~0_43|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_3|, ~back~0=v_~back~0_147, #memory_int=|v_#memory_int_40|, #race~back~0=|v_#race~back~0_150|, ~queue~0.base=v_~queue~0.base_78} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork0_#t~mem9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, #race~queue~0, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #race~back~0][151], [Black: 300#true, 298#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 302#(= |#race~queue~0| 0), 199#L72true, 280#(= |#race~n~0| 0), 173#L52-1true, 305#true, 256#L101-6true]) [2022-11-16 12:14:55,299 INFO L383 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-11-16 12:14:55,299 INFO L386 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-11-16 12:14:55,299 INFO L386 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-11-16 12:14:55,300 INFO L386 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-11-16 12:14:55,489 INFO L130 PetriNetUnfolder]: 990/2976 cut-off events. [2022-11-16 12:14:55,489 INFO L131 PetriNetUnfolder]: For 263/287 co-relation queries the response was YES. [2022-11-16 12:14:55,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4877 conditions, 2976 events. 990/2976 cut-off events. For 263/287 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 20711 event pairs, 335 based on Foata normal form. 0/2631 useless extension candidates. Maximal degree in co-relation 4827. Up to 910 conditions per place. [2022-11-16 12:14:55,513 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 83 selfloop transitions, 5 changer transitions 0/249 dead transitions. [2022-11-16 12:14:55,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 249 transitions, 719 flow [2022-11-16 12:14:55,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:14:55,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:14:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1257 transitions. [2022-11-16 12:14:55,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7905660377358491 [2022-11-16 12:14:55,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1257 transitions. [2022-11-16 12:14:55,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1257 transitions. [2022-11-16 12:14:55,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:55,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1257 transitions. [2022-11-16 12:14:55,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:55,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:55,529 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:55,529 INFO L175 Difference]: Start difference. First operand has 206 places, 206 transitions, 433 flow. Second operand 6 states and 1257 transitions. [2022-11-16 12:14:55,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 249 transitions, 719 flow [2022-11-16 12:14:55,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 249 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-16 12:14:55,536 INFO L231 Difference]: Finished difference. Result has 210 places, 205 transitions, 441 flow [2022-11-16 12:14:55,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=210, PETRI_TRANSITIONS=205} [2022-11-16 12:14:55,539 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -28 predicate places. [2022-11-16 12:14:55,539 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 205 transitions, 441 flow [2022-11-16 12:14:55,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.33333333333334) internal successors, (1184), 6 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:55,541 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:55,541 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:55,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:14:55,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1043604374, now seen corresponding path program 1 times [2022-11-16 12:14:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:55,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048996802] [2022-11-16 12:14:55,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:55,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:56,130 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-16 12:14:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:56,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048996802] [2022-11-16 12:14:56,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048996802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:56,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:56,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 12:14:56,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218319987] [2022-11-16 12:14:56,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:56,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:14:56,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:56,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:14:56,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:14:56,136 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2022-11-16 12:14:56,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 205 transitions, 441 flow. Second operand has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:56,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:56,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2022-11-16 12:14:56,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:56,811 INFO L130 PetriNetUnfolder]: 625/2401 cut-off events. [2022-11-16 12:14:56,811 INFO L131 PetriNetUnfolder]: For 263/403 co-relation queries the response was YES. [2022-11-16 12:14:56,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2401 events. 625/2401 cut-off events. For 263/403 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 17012 event pairs, 315 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 3755. Up to 851 conditions per place. [2022-11-16 12:14:56,836 INFO L137 encePairwiseOnDemand]: 260/265 looper letters, 61 selfloop transitions, 4 changer transitions 0/232 dead transitions. [2022-11-16 12:14:56,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 232 transitions, 665 flow [2022-11-16 12:14:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:14:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-16 12:14:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1250 transitions. [2022-11-16 12:14:56,841 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7861635220125787 [2022-11-16 12:14:56,841 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1250 transitions. [2022-11-16 12:14:56,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1250 transitions. [2022-11-16 12:14:56,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:56,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1250 transitions. [2022-11-16 12:14:56,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.33333333333334) internal successors, (1250), 6 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:56,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:56,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:56,854 INFO L175 Difference]: Start difference. First operand has 210 places, 205 transitions, 441 flow. Second operand 6 states and 1250 transitions. [2022-11-16 12:14:56,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 232 transitions, 665 flow [2022-11-16 12:14:56,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 232 transitions, 655 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-16 12:14:56,863 INFO L231 Difference]: Finished difference. Result has 209 places, 204 transitions, 437 flow [2022-11-16 12:14:56,863 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=437, PETRI_PLACES=209, PETRI_TRANSITIONS=204} [2022-11-16 12:14:56,864 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -29 predicate places. [2022-11-16 12:14:56,864 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 204 transitions, 437 flow [2022-11-16 12:14:56,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:56,865 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:56,866 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:56,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:14:56,866 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:56,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:56,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1952619295, now seen corresponding path program 1 times [2022-11-16 12:14:56,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:56,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502525969] [2022-11-16 12:14:56,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:56,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:56,948 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-16 12:14:56,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:56,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502525969] [2022-11-16 12:14:56,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502525969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:56,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:56,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277367253] [2022-11-16 12:14:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:56,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:56,953 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2022-11-16 12:14:56,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 204 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:56,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:56,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2022-11-16 12:14:56,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:57,119 INFO L130 PetriNetUnfolder]: 92/678 cut-off events. [2022-11-16 12:14:57,119 INFO L131 PetriNetUnfolder]: For 40/64 co-relation queries the response was YES. [2022-11-16 12:14:57,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 678 events. 92/678 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3064 event pairs, 27 based on Foata normal form. 0/612 useless extension candidates. Maximal degree in co-relation 863. Up to 124 conditions per place. [2022-11-16 12:14:57,126 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 24 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2022-11-16 12:14:57,126 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 209 transitions, 504 flow [2022-11-16 12:14:57,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 688 transitions. [2022-11-16 12:14:57,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8654088050314466 [2022-11-16 12:14:57,129 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 688 transitions. [2022-11-16 12:14:57,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 688 transitions. [2022-11-16 12:14:57,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:57,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 688 transitions. [2022-11-16 12:14:57,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,136 INFO L175 Difference]: Start difference. First operand has 209 places, 204 transitions, 437 flow. Second operand 3 states and 688 transitions. [2022-11-16 12:14:57,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 209 transitions, 504 flow [2022-11-16 12:14:57,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 497 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-16 12:14:57,142 INFO L231 Difference]: Finished difference. Result has 206 places, 203 transitions, 432 flow [2022-11-16 12:14:57,143 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=206, PETRI_TRANSITIONS=203} [2022-11-16 12:14:57,143 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -32 predicate places. [2022-11-16 12:14:57,144 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 203 transitions, 432 flow [2022-11-16 12:14:57,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,144 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:57,145 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:14:57,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:14:57,145 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:57,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash -767978267, now seen corresponding path program 1 times [2022-11-16 12:14:57,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:57,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304749088] [2022-11-16 12:14:57,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:57,206 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-16 12:14:57,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:57,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304749088] [2022-11-16 12:14:57,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304749088] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:57,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:57,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:57,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531417745] [2022-11-16 12:14:57,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:57,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:57,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:57,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:57,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 265 [2022-11-16 12:14:57,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 203 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:57,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 265 [2022-11-16 12:14:57,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:57,373 INFO L130 PetriNetUnfolder]: 78/639 cut-off events. [2022-11-16 12:14:57,373 INFO L131 PetriNetUnfolder]: For 36/60 co-relation queries the response was YES. [2022-11-16 12:14:57,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 639 events. 78/639 cut-off events. For 36/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2765 event pairs, 21 based on Foata normal form. 2/583 useless extension candidates. Maximal degree in co-relation 793. Up to 97 conditions per place. [2022-11-16 12:14:57,378 INFO L137 encePairwiseOnDemand]: 259/265 looper letters, 20 selfloop transitions, 2 changer transitions 15/206 dead transitions. [2022-11-16 12:14:57,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 206 transitions, 497 flow [2022-11-16 12:14:57,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:57,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2022-11-16 12:14:57,381 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8540880503144654 [2022-11-16 12:14:57,381 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2022-11-16 12:14:57,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2022-11-16 12:14:57,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:57,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2022-11-16 12:14:57,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,388 INFO L175 Difference]: Start difference. First operand has 206 places, 203 transitions, 432 flow. Second operand 3 states and 679 transitions. [2022-11-16 12:14:57,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 206 transitions, 497 flow [2022-11-16 12:14:57,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:57,393 INFO L231 Difference]: Finished difference. Result has 203 places, 185 transitions, 393 flow [2022-11-16 12:14:57,394 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=203, PETRI_TRANSITIONS=185} [2022-11-16 12:14:57,394 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -35 predicate places. [2022-11-16 12:14:57,395 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 185 transitions, 393 flow [2022-11-16 12:14:57,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,395 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:57,396 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:14:57,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:14:57,396 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:57,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:57,397 INFO L85 PathProgramCache]: Analyzing trace with hash -269226241, now seen corresponding path program 1 times [2022-11-16 12:14:57,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:57,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887706915] [2022-11-16 12:14:57,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:57,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:14:57,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:57,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887706915] [2022-11-16 12:14:57,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887706915] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:57,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:57,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:57,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943732732] [2022-11-16 12:14:57,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:57,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:57,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:57,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:57,456 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 265 [2022-11-16 12:14:57,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 185 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:57,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 265 [2022-11-16 12:14:57,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:57,652 INFO L130 PetriNetUnfolder]: 133/691 cut-off events. [2022-11-16 12:14:57,653 INFO L131 PetriNetUnfolder]: For 44/48 co-relation queries the response was YES. [2022-11-16 12:14:57,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 691 events. 133/691 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3032 event pairs, 53 based on Foata normal form. 0/631 useless extension candidates. Maximal degree in co-relation 971. Up to 202 conditions per place. [2022-11-16 12:14:57,659 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-16 12:14:57,659 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 190 transitions, 474 flow [2022-11-16 12:14:57,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 650 transitions. [2022-11-16 12:14:57,662 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8176100628930818 [2022-11-16 12:14:57,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 650 transitions. [2022-11-16 12:14:57,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 650 transitions. [2022-11-16 12:14:57,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:57,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 650 transitions. [2022-11-16 12:14:57,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,669 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,669 INFO L175 Difference]: Start difference. First operand has 203 places, 185 transitions, 393 flow. Second operand 3 states and 650 transitions. [2022-11-16 12:14:57,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 190 transitions, 474 flow [2022-11-16 12:14:57,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 190 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:57,674 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 391 flow [2022-11-16 12:14:57,675 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-11-16 12:14:57,676 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-16 12:14:57,676 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 391 flow [2022-11-16 12:14:57,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,677 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:57,677 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:14:57,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:14:57,677 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:57,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1472054812, now seen corresponding path program 1 times [2022-11-16 12:14:57,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:57,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939831110] [2022-11-16 12:14:57,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:57,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:14:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:57,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939831110] [2022-11-16 12:14:57,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939831110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:57,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:57,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212231725] [2022-11-16 12:14:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:57,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:57,737 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 265 [2022-11-16 12:14:57,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:57,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 265 [2022-11-16 12:14:57,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:57,897 INFO L130 PetriNetUnfolder]: 72/730 cut-off events. [2022-11-16 12:14:57,898 INFO L131 PetriNetUnfolder]: For 24/28 co-relation queries the response was YES. [2022-11-16 12:14:57,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 730 events. 72/730 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2988 event pairs, 12 based on Foata normal form. 0/676 useless extension candidates. Maximal degree in co-relation 855. Up to 64 conditions per place. [2022-11-16 12:14:57,904 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 20 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2022-11-16 12:14:57,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 452 flow [2022-11-16 12:14:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:57,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2022-11-16 12:14:57,907 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8679245283018868 [2022-11-16 12:14:57,908 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 690 transitions. [2022-11-16 12:14:57,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 690 transitions. [2022-11-16 12:14:57,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:57,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 690 transitions. [2022-11-16 12:14:57,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,914 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 391 flow. Second operand 3 states and 690 transitions. [2022-11-16 12:14:57,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 452 flow [2022-11-16 12:14:57,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 12:14:57,918 INFO L231 Difference]: Finished difference. Result has 186 places, 184 transitions, 395 flow [2022-11-16 12:14:57,919 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=186, PETRI_TRANSITIONS=184} [2022-11-16 12:14:57,920 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-16 12:14:57,920 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 184 transitions, 395 flow [2022-11-16 12:14:57,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,921 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 12:14:57,921 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:14:57,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:14:57,921 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2022-11-16 12:14:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:57,922 INFO L85 PathProgramCache]: Analyzing trace with hash -391702681, now seen corresponding path program 1 times [2022-11-16 12:14:57,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:57,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62723242] [2022-11-16 12:14:57,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:57,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:57,977 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-16 12:14:57,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:57,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62723242] [2022-11-16 12:14:57,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62723242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:57,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:57,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 12:14:57,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822389126] [2022-11-16 12:14:57,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:57,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:14:57,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:57,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:14:57,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:14:57,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 265 [2022-11-16 12:14:57,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 184 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:57,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 12:14:57,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 265 [2022-11-16 12:14:57,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 12:14:58,155 INFO L130 PetriNetUnfolder]: 86/738 cut-off events. [2022-11-16 12:14:58,155 INFO L131 PetriNetUnfolder]: For 34/38 co-relation queries the response was YES. [2022-11-16 12:14:58,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 738 events. 86/738 cut-off events. For 34/38 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2958 event pairs, 21 based on Foata normal form. 0/690 useless extension candidates. Maximal degree in co-relation 901. Up to 100 conditions per place. [2022-11-16 12:14:58,159 INFO L137 encePairwiseOnDemand]: 262/265 looper letters, 0 selfloop transitions, 0 changer transitions 189/189 dead transitions. [2022-11-16 12:14:58,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 189 transitions, 456 flow [2022-11-16 12:14:58,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:14:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 12:14:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 667 transitions. [2022-11-16 12:14:58,163 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8389937106918239 [2022-11-16 12:14:58,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 667 transitions. [2022-11-16 12:14:58,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 667 transitions. [2022-11-16 12:14:58,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 12:14:58,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 667 transitions. [2022-11-16 12:14:58,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:58,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:58,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:58,170 INFO L175 Difference]: Start difference. First operand has 186 places, 184 transitions, 395 flow. Second operand 3 states and 667 transitions. [2022-11-16 12:14:58,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 189 transitions, 456 flow [2022-11-16 12:14:58,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 189 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-16 12:14:58,175 INFO L231 Difference]: Finished difference. Result has 186 places, 0 transitions, 0 flow [2022-11-16 12:14:58,176 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=186, PETRI_TRANSITIONS=0} [2022-11-16 12:14:58,178 INFO L288 CegarLoopForPetriNet]: 238 programPoint places, -52 predicate places. [2022-11-16 12:14:58,178 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 0 transitions, 0 flow [2022-11-16 12:14:58,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 12:14:58,182 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2022-11-16 12:14:58,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2022-11-16 12:14:58,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2022-11-16 12:14:58,183 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2022-11-16 12:14:58,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2022-11-16 12:14:58,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2022-11-16 12:14:58,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2022-11-16 12:14:58,184 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2022-11-16 12:14:58,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2022-11-16 12:14:58,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2022-11-16 12:14:58,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2022-11-16 12:14:58,185 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2022-11-16 12:14:58,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2022-11-16 12:14:58,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2022-11-16 12:14:58,186 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2022-11-16 12:14:58,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2022-11-16 12:14:58,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2022-11-16 12:14:58,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2022-11-16 12:14:58,187 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2022-11-16 12:14:58,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2022-11-16 12:14:58,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2022-11-16 12:14:58,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2022-11-16 12:14:58,188 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2022-11-16 12:14:58,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2022-11-16 12:14:58,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2022-11-16 12:14:58,189 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2022-11-16 12:14:58,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2022-11-16 12:14:58,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2022-11-16 12:14:58,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2022-11-16 12:14:58,190 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2022-11-16 12:14:58,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2022-11-16 12:14:58,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2022-11-16 12:14:58,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2022-11-16 12:14:58,191 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2022-11-16 12:14:58,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2022-11-16 12:14:58,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2022-11-16 12:14:58,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2022-11-16 12:14:58,192 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2022-11-16 12:14:58,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2022-11-16 12:14:58,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2022-11-16 12:14:58,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2022-11-16 12:14:58,193 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2022-11-16 12:14:58,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 71 remaining) [2022-11-16 12:14:58,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 71 remaining) [2022-11-16 12:14:58,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2022-11-16 12:14:58,194 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2022-11-16 12:14:58,195 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2022-11-16 12:14:58,195 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2022-11-16 12:14:58,195 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2022-11-16 12:14:58,195 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2022-11-16 12:14:58,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2022-11-16 12:14:58,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2022-11-16 12:14:58,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2022-11-16 12:14:58,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2022-11-16 12:14:58,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2022-11-16 12:14:58,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2022-11-16 12:14:58,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2022-11-16 12:14:58,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2022-11-16 12:14:58,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2022-11-16 12:14:58,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2022-11-16 12:14:58,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2022-11-16 12:14:58,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2022-11-16 12:14:58,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2022-11-16 12:14:58,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2022-11-16 12:14:58,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2022-11-16 12:14:58,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2022-11-16 12:14:58,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2022-11-16 12:14:58,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2022-11-16 12:14:58,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2022-11-16 12:14:58,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2022-11-16 12:14:58,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2022-11-16 12:14:58,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:14:58,202 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:14:58,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 12:14:58,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 12:14:58,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:14:58 BasicIcfg [2022-11-16 12:14:58,219 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 12:14:58,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 12:14:58,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 12:14:58,220 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 12:14:58,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:14:47" (3/4) ... [2022-11-16 12:14:58,224 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-16 12:14:58,232 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2022-11-16 12:14:58,232 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2022-11-16 12:14:58,239 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-16 12:14:58,240 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-16 12:14:58,240 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-16 12:14:58,241 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-16 12:14:58,287 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 12:14:58,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 12:14:58,288 INFO L158 Benchmark]: Toolchain (without parser) took 12241.92ms. Allocated memory was 134.2MB in the beginning and 316.7MB in the end (delta: 182.5MB). Free memory was 96.1MB in the beginning and 249.8MB in the end (delta: -153.7MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2022-11-16 12:14:58,288 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 134.2MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 12:14:58,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.51ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 107.8MB in the end (delta: -12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 12:14:58,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.83ms. Allocated memory is still 134.2MB. Free memory was 107.8MB in the beginning and 105.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:14:58,289 INFO L158 Benchmark]: Boogie Preprocessor took 42.86ms. Allocated memory is still 134.2MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:14:58,290 INFO L158 Benchmark]: RCFGBuilder took 1216.27ms. Allocated memory is still 134.2MB. Free memory was 103.0MB in the beginning and 61.7MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2022-11-16 12:14:58,290 INFO L158 Benchmark]: TraceAbstraction took 10308.33ms. Allocated memory was 134.2MB in the beginning and 316.7MB in the end (delta: 182.5MB). Free memory was 61.0MB in the beginning and 254.0MB in the end (delta: -193.0MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. [2022-11-16 12:14:58,291 INFO L158 Benchmark]: Witness Printer took 67.19ms. Allocated memory is still 316.7MB. Free memory was 254.0MB in the beginning and 249.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 12:14:58,293 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.38ms. Allocated memory is still 134.2MB. Free memory is still 113.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.51ms. Allocated memory is still 134.2MB. Free memory was 95.8MB in the beginning and 107.8MB in the end (delta: -12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.83ms. Allocated memory is still 134.2MB. Free memory was 107.8MB in the beginning and 105.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.86ms. Allocated memory is still 134.2MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1216.27ms. Allocated memory is still 134.2MB. Free memory was 103.0MB in the beginning and 61.7MB in the end (delta: 41.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10308.33ms. Allocated memory was 134.2MB in the beginning and 316.7MB in the end (delta: 182.5MB). Free memory was 61.0MB in the beginning and 254.0MB in the end (delta: -193.0MB). Peak memory consumption was 163.2MB. Max. memory is 16.1GB. * Witness Printer took 67.19ms. Allocated memory is still 316.7MB. Free memory was 254.0MB in the beginning and 249.8MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 355 locations, 71 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: 10.1s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 189 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 1280 NumberOfCodeBlocks, 1280 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 1680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-16 12:14:58,319 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d1c6a9fb-c54d-4749-b630-3070881f2c4f/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE