./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread/fib_unsafe-6-racy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/fib_unsafe-6-racy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a --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 4c475d56613186560380fd7710c1a393bef46e366024d2f60e26aa83cc625627 --- 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-b5237d8 [2022-11-21 16:42:04,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:42:04,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:42:04,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:42:04,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:42:04,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:42:04,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:42:04,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:42:04,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:42:04,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:42:05,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:42:05,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:42:05,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:42:05,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:42:05,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:42:05,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:42:05,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:42:05,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:42:05,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:42:05,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:42:05,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:42:05,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:42:05,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:42:05,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:42:05,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:42:05,038 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:42:05,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:42:05,039 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:42:05,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:42:05,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:42:05,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:42:05,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:42:05,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:42:05,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:42:05,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:42:05,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:42:05,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:42:05,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:42:05,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:42:05,048 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:42:05,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:42:05,050 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DataRace-32bit-Automizer_Default.epf [2022-11-21 16:42:05,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:42:05,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:42:05,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:42:05,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:42:05,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:42:05,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:42:05,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:42:05,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:42:05,095 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:42:05,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:42:05,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:42:05,096 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:42:05,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:42:05,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:42:05,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:42:05,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:42:05,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:42:05,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:42:05,098 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-21 16:42:05,098 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:42:05,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:42:05,099 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:42:05,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:42:05,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:42:05,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:42:05,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:42:05,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:42:05,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:42:05,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:42:05,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:42:05,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:42:05,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:42:05,101 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:42:05,102 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:42:05,102 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:42:05,102 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_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/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_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a 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 -> 4c475d56613186560380fd7710c1a393bef46e366024d2f60e26aa83cc625627 [2022-11-21 16:42:05,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:42:05,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:42:05,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:42:05,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:42:05,453 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:42:05,454 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/pthread/fib_unsafe-6-racy.i [2022-11-21 16:42:08,502 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:42:08,816 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:42:08,817 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/sv-benchmarks/c/pthread/fib_unsafe-6-racy.i [2022-11-21 16:42:08,843 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/data/793b92420/dfc12a2204b540eeb063548e0d672ec9/FLAGaaa4cfefc [2022-11-21 16:42:08,859 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/data/793b92420/dfc12a2204b540eeb063548e0d672ec9 [2022-11-21 16:42:08,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:42:08,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:42:08,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:42:08,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:42:08,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:42:08,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:42:08" (1/1) ... [2022-11-21 16:42:08,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9a1a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:08, skipping insertion in model container [2022-11-21 16:42:08,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:42:08" (1/1) ... [2022-11-21 16:42:08,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:42:08,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:42:09,257 WARN L237 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_852fa8ed-6f85-4a76-9c39-863644c7cd79/sv-benchmarks/c/pthread/fib_unsafe-6-racy.i[30811,30824] [2022-11-21 16:42:09,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:42:09,276 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:42:09,352 WARN L237 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_852fa8ed-6f85-4a76-9c39-863644c7cd79/sv-benchmarks/c/pthread/fib_unsafe-6-racy.i[30811,30824] [2022-11-21 16:42:09,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:42:09,387 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:42:09,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09 WrapperNode [2022-11-21 16:42:09,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:42:09,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:42:09,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:42:09,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:42:09,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,470 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2022-11-21 16:42:09,470 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:42:09,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:42:09,471 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:42:09,471 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:42:09,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,496 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,500 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:42:09,501 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:42:09,501 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:42:09,501 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:42:09,502 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (1/1) ... [2022-11-21 16:42:09,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:42:09,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:09,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:42:09,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:42:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-21 16:42:09,585 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-21 16:42:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-21 16:42:09,586 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-21 16:42:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:42:09,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:42:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:42:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:42:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:42:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:42:09,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:42:09,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:42:09,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:42:09,589 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:42:09,734 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:42:09,736 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:42:10,180 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:42:10,257 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:42:10,257 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:42:10,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:42:10 BoogieIcfgContainer [2022-11-21 16:42:10,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:42:10,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:42:10,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:42:10,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:42:10,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:42:08" (1/3) ... [2022-11-21 16:42:10,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2f85a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:42:10, skipping insertion in model container [2022-11-21 16:42:10,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:42:09" (2/3) ... [2022-11-21 16:42:10,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2f85a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:42:10, skipping insertion in model container [2022-11-21 16:42:10,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:42:10" (3/3) ... [2022-11-21 16:42:10,269 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-6-racy.i [2022-11-21 16:42:10,278 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:42:10,289 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:42:10,289 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-21 16:42:10,289 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:42:10,347 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-21 16:42:10,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 193 transitions, 396 flow [2022-11-21 16:42:10,463 INFO L130 PetriNetUnfolder]: 8/191 cut-off events. [2022-11-21 16:42:10,464 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:10,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 191 events. 8/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 366 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 159. Up to 2 conditions per place. [2022-11-21 16:42:10,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 193 transitions, 396 flow [2022-11-21 16:42:10,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 190 places, 191 transitions, 388 flow [2022-11-21 16:42:10,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:42:10,501 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;@47b82162, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:42:10,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-21 16:42:10,509 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-11-21 16:42:10,509 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:10,509 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:10,510 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] [2022-11-21 16:42:10,510 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:10,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:10,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1806377174, now seen corresponding path program 1 times [2022-11-21 16:42:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:10,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807336554] [2022-11-21 16:42:10,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:10,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:10,778 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-21 16:42:10,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:10,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807336554] [2022-11-21 16:42:10,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807336554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:10,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:10,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-21 16:42:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524598882] [2022-11-21 16:42:10,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:10,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:42:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:10,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:42:10,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:42:10,844 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 193 [2022-11-21 16:42:10,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 191 transitions, 388 flow. Second operand has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:10,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:10,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 193 [2022-11-21 16:42:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:11,002 INFO L130 PetriNetUnfolder]: 9/295 cut-off events. [2022-11-21 16:42:11,003 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:42:11,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 295 events. 9/295 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 939 event pairs, 2 based on Foata normal form. 10/255 useless extension candidates. Maximal degree in co-relation 274. Up to 11 conditions per place. [2022-11-21 16:42:11,010 INFO L137 encePairwiseOnDemand]: 181/193 looper letters, 6 selfloop transitions, 0 changer transitions 0/178 dead transitions. [2022-11-21 16:42:11,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 374 flow [2022-11-21 16:42:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:42:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:42:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-11-21 16:42:11,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9481865284974094 [2022-11-21 16:42:11,027 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 366 transitions. [2022-11-21 16:42:11,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 366 transitions. [2022-11-21 16:42:11,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:11,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 366 transitions. [2022-11-21 16:42:11,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,046 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,049 INFO L175 Difference]: Start difference. First operand has 190 places, 191 transitions, 388 flow. Second operand 2 states and 366 transitions. [2022-11-21 16:42:11,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 374 flow [2022-11-21 16:42:11,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 178 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:11,059 INFO L231 Difference]: Finished difference. Result has 180 places, 178 transitions, 360 flow [2022-11-21 16:42:11,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=360, PETRI_PLACES=180, PETRI_TRANSITIONS=178} [2022-11-21 16:42:11,066 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -10 predicate places. [2022-11-21 16:42:11,066 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 178 transitions, 360 flow [2022-11-21 16:42:11,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 174.5) internal successors, (349), 2 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,067 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:11,067 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] [2022-11-21 16:42:11,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:42:11,068 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:11,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:11,069 INFO L85 PathProgramCache]: Analyzing trace with hash -929261081, now seen corresponding path program 1 times [2022-11-21 16:42:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:11,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526031346] [2022-11-21 16:42:11,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:11,179 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-21 16:42:11,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:11,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526031346] [2022-11-21 16:42:11,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526031346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:11,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:11,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217930988] [2022-11-21 16:42:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:11,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:11,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:42:11,186 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 178 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,186 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:11,186 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:42:11,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:11,326 INFO L130 PetriNetUnfolder]: 48/393 cut-off events. [2022-11-21 16:42:11,326 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:11,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 393 events. 48/393 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1813 event pairs, 14 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 511. Up to 77 conditions per place. [2022-11-21 16:42:11,337 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 19 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2022-11-21 16:42:11,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 179 transitions, 406 flow [2022-11-21 16:42:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:11,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2022-11-21 16:42:11,344 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8670120898100173 [2022-11-21 16:42:11,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2022-11-21 16:42:11,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2022-11-21 16:42:11,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:11,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2022-11-21 16:42:11,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,353 INFO L175 Difference]: Start difference. First operand has 180 places, 178 transitions, 360 flow. Second operand 3 states and 502 transitions. [2022-11-21 16:42:11,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 179 transitions, 406 flow [2022-11-21 16:42:11,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 179 transitions, 406 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:42:11,383 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 362 flow [2022-11-21 16:42:11,384 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=181, PETRI_TRANSITIONS=177} [2022-11-21 16:42:11,385 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -9 predicate places. [2022-11-21 16:42:11,385 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 362 flow [2022-11-21 16:42:11,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,386 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:11,386 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] [2022-11-21 16:42:11,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:42:11,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:11,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837375, now seen corresponding path program 1 times [2022-11-21 16:42:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:11,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488796311] [2022-11-21 16:42:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:11,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:11,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:11,477 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-21 16:42:11,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:11,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488796311] [2022-11-21 16:42:11,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488796311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:11,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:11,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:11,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803033991] [2022-11-21 16:42:11,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:11,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:11,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:11,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:11,481 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:42:11,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 177 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:11,482 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:42:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:11,554 INFO L130 PetriNetUnfolder]: 34/261 cut-off events. [2022-11-21 16:42:11,555 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:42:11,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 261 events. 34/261 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 975 event pairs, 11 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 354. Up to 34 conditions per place. [2022-11-21 16:42:11,559 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2022-11-21 16:42:11,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 177 transitions, 398 flow [2022-11-21 16:42:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-21 16:42:11,562 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-21 16:42:11,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-21 16:42:11,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-21 16:42:11,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:11,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-21 16:42:11,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,567 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 362 flow. Second operand 3 states and 505 transitions. [2022-11-21 16:42:11,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 177 transitions, 398 flow [2022-11-21 16:42:11,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 177 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:11,572 INFO L231 Difference]: Finished difference. Result has 179 places, 175 transitions, 358 flow [2022-11-21 16:42:11,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=179, PETRI_TRANSITIONS=175} [2022-11-21 16:42:11,573 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-21 16:42:11,573 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 175 transitions, 358 flow [2022-11-21 16:42:11,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,574 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:11,574 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-21 16:42:11,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 16:42:11,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:11,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash -418600324, now seen corresponding path program 1 times [2022-11-21 16:42:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:11,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81061076] [2022-11-21 16:42:11,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:11,641 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-21 16:42:11,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:11,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81061076] [2022-11-21 16:42:11,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81061076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:11,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:11,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:11,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284868655] [2022-11-21 16:42:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:11,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:11,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:11,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:11,646 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:42:11,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 175 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,647 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:11,647 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:42:11,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:11,725 INFO L130 PetriNetUnfolder]: 22/303 cut-off events. [2022-11-21 16:42:11,726 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:11,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 303 events. 22/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1161 event pairs, 13 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 360. Up to 44 conditions per place. [2022-11-21 16:42:11,730 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 18 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2022-11-21 16:42:11,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 175 transitions, 398 flow [2022-11-21 16:42:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-11-21 16:42:11,732 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8652849740932642 [2022-11-21 16:42:11,732 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2022-11-21 16:42:11,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2022-11-21 16:42:11,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:11,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2022-11-21 16:42:11,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,737 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,737 INFO L175 Difference]: Start difference. First operand has 179 places, 175 transitions, 358 flow. Second operand 3 states and 501 transitions. [2022-11-21 16:42:11,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 175 transitions, 398 flow [2022-11-21 16:42:11,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 175 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:11,741 INFO L231 Difference]: Finished difference. Result has 178 places, 174 transitions, 356 flow [2022-11-21 16:42:11,742 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=178, PETRI_TRANSITIONS=174} [2022-11-21 16:42:11,743 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -12 predicate places. [2022-11-21 16:42:11,743 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 174 transitions, 356 flow [2022-11-21 16:42:11,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,744 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:11,744 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] [2022-11-21 16:42:11,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:42:11,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:11,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2063316520, now seen corresponding path program 1 times [2022-11-21 16:42:11,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:11,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700612264] [2022-11-21 16:42:11,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:11,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:11,800 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-21 16:42:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:11,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700612264] [2022-11-21 16:42:11,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700612264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:11,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:11,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:11,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162405839] [2022-11-21 16:42:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:11,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:11,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:11,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:11,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:42:11,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 174 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:11,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:42:11,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:11,883 INFO L130 PetriNetUnfolder]: 18/295 cut-off events. [2022-11-21 16:42:11,883 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-21 16:42:11,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 295 events. 18/295 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1099 event pairs, 6 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 342. Up to 23 conditions per place. [2022-11-21 16:42:11,887 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-21 16:42:11,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 173 transitions, 386 flow [2022-11-21 16:42:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-21 16:42:11,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-21 16:42:11,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-21 16:42:11,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-21 16:42:11,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:11,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-21 16:42:11,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,895 INFO L175 Difference]: Start difference. First operand has 178 places, 174 transitions, 356 flow. Second operand 3 states and 504 transitions. [2022-11-21 16:42:11,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 173 transitions, 386 flow [2022-11-21 16:42:11,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 173 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:11,899 INFO L231 Difference]: Finished difference. Result has 176 places, 172 transitions, 352 flow [2022-11-21 16:42:11,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=176, PETRI_TRANSITIONS=172} [2022-11-21 16:42:11,902 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -14 predicate places. [2022-11-21 16:42:11,903 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 172 transitions, 352 flow [2022-11-21 16:42:11,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:11,904 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:11,904 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] [2022-11-21 16:42:11,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:42:11,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:11,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:11,910 INFO L85 PathProgramCache]: Analyzing trace with hash 940500773, now seen corresponding path program 1 times [2022-11-21 16:42:11,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:11,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99794456] [2022-11-21 16:42:11,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:11,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:12,006 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-21 16:42:12,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:12,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99794456] [2022-11-21 16:42:12,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99794456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:12,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:12,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663557772] [2022-11-21 16:42:12,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:12,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:12,011 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-21 16:42:12,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 172 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:12,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-21 16:42:12,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:12,168 INFO L130 PetriNetUnfolder]: 69/506 cut-off events. [2022-11-21 16:42:12,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:12,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 506 events. 69/506 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2804 event pairs, 50 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 638. Up to 107 conditions per place. [2022-11-21 16:42:12,175 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 20 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2022-11-21 16:42:12,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 173 transitions, 398 flow [2022-11-21 16:42:12,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2022-11-21 16:42:12,177 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8635578583765112 [2022-11-21 16:42:12,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 500 transitions. [2022-11-21 16:42:12,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 500 transitions. [2022-11-21 16:42:12,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:12,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 500 transitions. [2022-11-21 16:42:12,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,182 INFO L175 Difference]: Start difference. First operand has 176 places, 172 transitions, 352 flow. Second operand 3 states and 500 transitions. [2022-11-21 16:42:12,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 173 transitions, 398 flow [2022-11-21 16:42:12,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 173 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:12,187 INFO L231 Difference]: Finished difference. Result has 175 places, 171 transitions, 350 flow [2022-11-21 16:42:12,187 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=175, PETRI_TRANSITIONS=171} [2022-11-21 16:42:12,190 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -15 predicate places. [2022-11-21 16:42:12,191 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 171 transitions, 350 flow [2022-11-21 16:42:12,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:12,192 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] [2022-11-21 16:42:12,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 16:42:12,192 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:12,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:12,194 INFO L85 PathProgramCache]: Analyzing trace with hash 193157200, now seen corresponding path program 1 times [2022-11-21 16:42:12,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:12,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175724252] [2022-11-21 16:42:12,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:12,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:12,275 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-21 16:42:12,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:12,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175724252] [2022-11-21 16:42:12,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175724252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:12,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:12,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:12,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014947805] [2022-11-21 16:42:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:12,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:12,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:12,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:12,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:42:12,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 171 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:12,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:42:12,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:12,379 INFO L130 PetriNetUnfolder]: 26/228 cut-off events. [2022-11-21 16:42:12,380 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:12,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 228 events. 26/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 802 event pairs, 16 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 312. Up to 49 conditions per place. [2022-11-21 16:42:12,383 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 16 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2022-11-21 16:42:12,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 172 transitions, 390 flow [2022-11-21 16:42:12,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2022-11-21 16:42:12,385 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8618307426597582 [2022-11-21 16:42:12,386 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2022-11-21 16:42:12,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2022-11-21 16:42:12,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:12,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2022-11-21 16:42:12,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,391 INFO L175 Difference]: Start difference. First operand has 175 places, 171 transitions, 350 flow. Second operand 3 states and 499 transitions. [2022-11-21 16:42:12,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 172 transitions, 390 flow [2022-11-21 16:42:12,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 172 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:12,395 INFO L231 Difference]: Finished difference. Result has 174 places, 170 transitions, 348 flow [2022-11-21 16:42:12,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=170} [2022-11-21 16:42:12,396 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -16 predicate places. [2022-11-21 16:42:12,396 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 170 transitions, 348 flow [2022-11-21 16:42:12,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,397 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:12,397 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] [2022-11-21 16:42:12,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 16:42:12,397 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:12,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:12,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1907786638, now seen corresponding path program 1 times [2022-11-21 16:42:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:12,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682196825] [2022-11-21 16:42:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:12,457 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-21 16:42:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:12,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682196825] [2022-11-21 16:42:12,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682196825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:12,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:12,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683059376] [2022-11-21 16:42:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:12,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:12,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:12,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:12,466 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:42:12,467 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,467 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:12,467 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:42:12,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:12,571 INFO L130 PetriNetUnfolder]: 49/471 cut-off events. [2022-11-21 16:42:12,571 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:12,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 471 events. 49/471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2379 event pairs, 22 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 561. Up to 51 conditions per place. [2022-11-21 16:42:12,578 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-11-21 16:42:12,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 170 transitions, 382 flow [2022-11-21 16:42:12,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2022-11-21 16:42:12,580 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8721934369602763 [2022-11-21 16:42:12,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 505 transitions. [2022-11-21 16:42:12,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 505 transitions. [2022-11-21 16:42:12,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:12,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 505 transitions. [2022-11-21 16:42:12,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,584 INFO L175 Difference]: Start difference. First operand has 174 places, 170 transitions, 348 flow. Second operand 3 states and 505 transitions. [2022-11-21 16:42:12,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 170 transitions, 382 flow [2022-11-21 16:42:12,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 170 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:12,588 INFO L231 Difference]: Finished difference. Result has 172 places, 168 transitions, 344 flow [2022-11-21 16:42:12,589 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=168} [2022-11-21 16:42:12,591 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -18 predicate places. [2022-11-21 16:42:12,591 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 168 transitions, 344 flow [2022-11-21 16:42:12,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,592 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:12,592 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] [2022-11-21 16:42:12,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 16:42:12,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:12,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash 430848325, now seen corresponding path program 1 times [2022-11-21 16:42:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:12,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366365455] [2022-11-21 16:42:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:12,645 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-21 16:42:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:12,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366365455] [2022-11-21 16:42:12,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366365455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:12,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:12,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:12,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904879242] [2022-11-21 16:42:12,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:12,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:12,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:12,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:12,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:12,649 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-21 16:42:12,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:12,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-21 16:42:12,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:12,748 INFO L130 PetriNetUnfolder]: 49/491 cut-off events. [2022-11-21 16:42:12,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:12,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 491 events. 49/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2325 event pairs, 14 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 581. Up to 41 conditions per place. [2022-11-21 16:42:12,753 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 3 changer transitions 0/168 dead transitions. [2022-11-21 16:42:12,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 374 flow [2022-11-21 16:42:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-21 16:42:12,756 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-21 16:42:12,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-21 16:42:12,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-21 16:42:12,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:12,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-21 16:42:12,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,761 INFO L175 Difference]: Start difference. First operand has 172 places, 168 transitions, 344 flow. Second operand 3 states and 512 transitions. [2022-11-21 16:42:12,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 374 flow [2022-11-21 16:42:12,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 168 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:12,765 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 342 flow [2022-11-21 16:42:12,765 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2022-11-21 16:42:12,767 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-21 16:42:12,767 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 342 flow [2022-11-21 16:42:12,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,768 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:12,768 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] [2022-11-21 16:42:12,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 16:42:12,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:12,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1728395284, now seen corresponding path program 1 times [2022-11-21 16:42:12,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:12,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372167295] [2022-11-21 16:42:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:12,857 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-21 16:42:12,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:12,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372167295] [2022-11-21 16:42:12,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372167295] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:12,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:12,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:12,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035646672] [2022-11-21 16:42:12,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:12,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:12,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:12,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:12,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:12,862 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-21 16:42:12,862 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:12,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-21 16:42:12,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:12,974 INFO L130 PetriNetUnfolder]: 47/481 cut-off events. [2022-11-21 16:42:12,974 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:12,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 481 events. 47/481 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1916 event pairs, 14 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 573. Up to 41 conditions per place. [2022-11-21 16:42:12,978 INFO L137 encePairwiseOnDemand]: 189/193 looper letters, 13 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2022-11-21 16:42:12,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 166 transitions, 372 flow [2022-11-21 16:42:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-21 16:42:12,981 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-21 16:42:12,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-21 16:42:12,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-21 16:42:12,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:12,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-21 16:42:12,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,986 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 342 flow. Second operand 3 states and 512 transitions. [2022-11-21 16:42:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 166 transitions, 372 flow [2022-11-21 16:42:12,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:12,989 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 336 flow [2022-11-21 16:42:12,990 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-11-21 16:42:12,991 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-21 16:42:12,991 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 336 flow [2022-11-21 16:42:12,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:12,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:12,992 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] [2022-11-21 16:42:12,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 16:42:12,994 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash -215926811, now seen corresponding path program 1 times [2022-11-21 16:42:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:12,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550117747] [2022-11-21 16:42:12,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:13,044 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-21 16:42:13,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:13,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550117747] [2022-11-21 16:42:13,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550117747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:13,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:13,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:13,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413270159] [2022-11-21 16:42:13,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:13,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:13,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:13,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:13,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:13,048 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 193 [2022-11-21 16:42:13,049 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,049 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:13,049 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 193 [2022-11-21 16:42:13,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:13,116 INFO L130 PetriNetUnfolder]: 18/278 cut-off events. [2022-11-21 16:42:13,116 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:13,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 278 events. 18/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 970 event pairs, 9 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 327. Up to 34 conditions per place. [2022-11-21 16:42:13,119 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:42:13,119 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 164 transitions, 370 flow [2022-11-21 16:42:13,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:13,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 498 transitions. [2022-11-21 16:42:13,121 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8601036269430051 [2022-11-21 16:42:13,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 498 transitions. [2022-11-21 16:42:13,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 498 transitions. [2022-11-21 16:42:13,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:13,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 498 transitions. [2022-11-21 16:42:13,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,126 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 336 flow. Second operand 3 states and 498 transitions. [2022-11-21 16:42:13,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 164 transitions, 370 flow [2022-11-21 16:42:13,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:13,134 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 334 flow [2022-11-21 16:42:13,135 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-11-21 16:42:13,135 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:42:13,135 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 334 flow [2022-11-21 16:42:13,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,136 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:13,136 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] [2022-11-21 16:42:13,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 16:42:13,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:13,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:13,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1939820954, now seen corresponding path program 1 times [2022-11-21 16:42:13,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:13,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954013384] [2022-11-21 16:42:13,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:13,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:13,196 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-21 16:42:13,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:13,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954013384] [2022-11-21 16:42:13,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954013384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:13,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:13,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218710697] [2022-11-21 16:42:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:13,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:13,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:13,199 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 193 [2022-11-21 16:42:13,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:13,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 193 [2022-11-21 16:42:13,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:13,288 INFO L130 PetriNetUnfolder]: 45/451 cut-off events. [2022-11-21 16:42:13,288 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:13,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 451 events. 45/451 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2261 event pairs, 26 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 535. Up to 59 conditions per place. [2022-11-21 16:42:13,292 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 14 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:42:13,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 368 flow [2022-11-21 16:42:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:13,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2022-11-21 16:42:13,294 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842832469775475 [2022-11-21 16:42:13,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2022-11-21 16:42:13,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2022-11-21 16:42:13,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:13,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2022-11-21 16:42:13,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,298 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 334 flow. Second operand 3 states and 512 transitions. [2022-11-21 16:42:13,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 368 flow [2022-11-21 16:42:13,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:13,302 INFO L231 Difference]: Finished difference. Result has 166 places, 162 transitions, 332 flow [2022-11-21 16:42:13,302 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=166, PETRI_TRANSITIONS=162} [2022-11-21 16:42:13,303 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-21 16:42:13,303 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 162 transitions, 332 flow [2022-11-21 16:42:13,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,303 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:13,304 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] [2022-11-21 16:42:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 16:42:13,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:13,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1602304185, now seen corresponding path program 1 times [2022-11-21 16:42:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:13,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702054222] [2022-11-21 16:42:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:13,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:13,361 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-21 16:42:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:13,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702054222] [2022-11-21 16:42:13,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702054222] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:13,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:13,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:42:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715930192] [2022-11-21 16:42:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:13,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:13,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:13,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:13,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:13,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-21 16:42:13,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:13,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-21 16:42:13,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:13,486 INFO L130 PetriNetUnfolder]: 41/577 cut-off events. [2022-11-21 16:42:13,486 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:13,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 577 events. 41/577 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2593 event pairs, 14 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 670. Up to 37 conditions per place. [2022-11-21 16:42:13,491 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2022-11-21 16:42:13,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 167 transitions, 376 flow [2022-11-21 16:42:13,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:13,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2022-11-21 16:42:13,493 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9015544041450777 [2022-11-21 16:42:13,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2022-11-21 16:42:13,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2022-11-21 16:42:13,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:13,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2022-11-21 16:42:13,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,497 INFO L175 Difference]: Start difference. First operand has 166 places, 162 transitions, 332 flow. Second operand 3 states and 522 transitions. [2022-11-21 16:42:13,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 167 transitions, 376 flow [2022-11-21 16:42:13,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:13,502 INFO L231 Difference]: Finished difference. Result has 167 places, 163 transitions, 340 flow [2022-11-21 16:42:13,502 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=163} [2022-11-21 16:42:13,503 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:42:13,504 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 163 transitions, 340 flow [2022-11-21 16:42:13,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:13,504 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] [2022-11-21 16:42:13,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 16:42:13,505 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:13,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:13,505 INFO L85 PathProgramCache]: Analyzing trace with hash -596713196, now seen corresponding path program 1 times [2022-11-21 16:42:13,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:13,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204226981] [2022-11-21 16:42:13,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:13,574 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-21 16:42:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:13,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204226981] [2022-11-21 16:42:13,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204226981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:13,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:13,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515671642] [2022-11-21 16:42:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:13,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:13,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:13,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:13,577 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:42:13,578 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 163 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,578 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:13,578 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:42:13,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:13,683 INFO L130 PetriNetUnfolder]: 73/603 cut-off events. [2022-11-21 16:42:13,683 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-21 16:42:13,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 603 events. 73/603 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2986 event pairs, 46 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 756. Up to 99 conditions per place. [2022-11-21 16:42:13,688 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:42:13,688 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-21 16:42:13,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-21 16:42:13,690 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-21 16:42:13,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-21 16:42:13,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-21 16:42:13,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:13,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-21 16:42:13,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,694 INFO L175 Difference]: Start difference. First operand has 167 places, 163 transitions, 340 flow. Second operand 3 states and 504 transitions. [2022-11-21 16:42:13,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-21 16:42:13,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 164 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:42:13,698 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 340 flow [2022-11-21 16:42:13,699 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=340, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-21 16:42:13,699 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:42:13,700 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 340 flow [2022-11-21 16:42:13,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,701 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:13,702 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] [2022-11-21 16:42:13,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 16:42:13,702 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:13,703 INFO L85 PathProgramCache]: Analyzing trace with hash 187265853, now seen corresponding path program 1 times [2022-11-21 16:42:13,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:13,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246451894] [2022-11-21 16:42:13,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:13,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:13,770 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-21 16:42:13,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:13,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246451894] [2022-11-21 16:42:13,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246451894] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:13,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:13,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:13,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003311748] [2022-11-21 16:42:13,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:13,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:13,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:13,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:13,773 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 193 [2022-11-21 16:42:13,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 340 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:13,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 193 [2022-11-21 16:42:13,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:13,874 INFO L130 PetriNetUnfolder]: 61/583 cut-off events. [2022-11-21 16:42:13,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:13,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 713 conditions, 583 events. 61/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2565 event pairs, 18 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 708. Up to 51 conditions per place. [2022-11-21 16:42:13,879 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 11 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2022-11-21 16:42:13,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 370 flow [2022-11-21 16:42:13,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:13,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:13,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-11-21 16:42:13,881 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8946459412780656 [2022-11-21 16:42:13,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-11-21 16:42:13,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-11-21 16:42:13,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:13,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-11-21 16:42:13,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,886 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 340 flow. Second operand 3 states and 518 transitions. [2022-11-21 16:42:13,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 370 flow [2022-11-21 16:42:13,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 366 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:13,890 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 344 flow [2022-11-21 16:42:13,891 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2022-11-21 16:42:13,892 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:42:13,892 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 344 flow [2022-11-21 16:42:13,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:13,893 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-21 16:42:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 16:42:13,893 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1490312150, now seen corresponding path program 1 times [2022-11-21 16:42:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:13,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283097771] [2022-11-21 16:42:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:13,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283097771] [2022-11-21 16:42:13,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283097771] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:13,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:13,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830578713] [2022-11-21 16:42:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:13,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:13,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:13,940 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 193 [2022-11-21 16:42:13,941 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:13,941 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:13,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 193 [2022-11-21 16:42:13,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:14,054 INFO L130 PetriNetUnfolder]: 81/595 cut-off events. [2022-11-21 16:42:14,055 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-21 16:42:14,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 595 events. 81/595 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2997 event pairs, 54 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 780. Up to 115 conditions per place. [2022-11-21 16:42:14,059 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 15 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2022-11-21 16:42:14,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 163 transitions, 380 flow [2022-11-21 16:42:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-11-21 16:42:14,061 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8704663212435233 [2022-11-21 16:42:14,062 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-11-21 16:42:14,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-11-21 16:42:14,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:14,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-11-21 16:42:14,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,067 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 344 flow. Second operand 3 states and 504 transitions. [2022-11-21 16:42:14,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 163 transitions, 380 flow [2022-11-21 16:42:14,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 163 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:42:14,071 INFO L231 Difference]: Finished difference. Result has 167 places, 161 transitions, 344 flow [2022-11-21 16:42:14,072 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=161} [2022-11-21 16:42:14,073 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -23 predicate places. [2022-11-21 16:42:14,073 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 161 transitions, 344 flow [2022-11-21 16:42:14,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,074 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:14,074 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] [2022-11-21 16:42:14,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 16:42:14,074 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash -91697017, now seen corresponding path program 1 times [2022-11-21 16:42:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:14,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059536418] [2022-11-21 16:42:14,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:14,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:14,136 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-21 16:42:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:14,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059536418] [2022-11-21 16:42:14,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059536418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:14,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:42:14,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:42:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664070439] [2022-11-21 16:42:14,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:14,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:14,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:14,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:14,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:42:14,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 193 [2022-11-21 16:42:14,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 161 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:14,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 193 [2022-11-21 16:42:14,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:14,256 INFO L130 PetriNetUnfolder]: 73/583 cut-off events. [2022-11-21 16:42:14,256 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:14,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 583 events. 73/583 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2779 event pairs, 54 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 764. Up to 115 conditions per place. [2022-11-21 16:42:14,261 INFO L137 encePairwiseOnDemand]: 190/193 looper letters, 17 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2022-11-21 16:42:14,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 162 transitions, 384 flow [2022-11-21 16:42:14,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2022-11-21 16:42:14,264 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8583765112262521 [2022-11-21 16:42:14,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2022-11-21 16:42:14,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2022-11-21 16:42:14,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:14,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2022-11-21 16:42:14,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,269 INFO L175 Difference]: Start difference. First operand has 167 places, 161 transitions, 344 flow. Second operand 3 states and 497 transitions. [2022-11-21 16:42:14,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 162 transitions, 384 flow [2022-11-21 16:42:14,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 162 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:14,274 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 342 flow [2022-11-21 16:42:14,274 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2022-11-21 16:42:14,276 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -24 predicate places. [2022-11-21 16:42:14,276 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 342 flow [2022-11-21 16:42:14,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,277 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:14,277 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:42:14,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 16:42:14,278 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:14,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1186677298, now seen corresponding path program 1 times [2022-11-21 16:42:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:14,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278368689] [2022-11-21 16:42:14,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:14,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:14,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:14,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278368689] [2022-11-21 16:42:14,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278368689] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:14,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71195514] [2022-11-21 16:42:14,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:14,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:14,447 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:42:14,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:42:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:14,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:42:14,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:42:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:42:14,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:42:14,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71195514] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:14,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:42:14,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-21 16:42:14,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245484988] [2022-11-21 16:42:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:14,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:14,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:42:14,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-21 16:42:14,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:14,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-21 16:42:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:14,695 INFO L130 PetriNetUnfolder]: 36/496 cut-off events. [2022-11-21 16:42:14,696 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-21 16:42:14,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 496 events. 36/496 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1865 event pairs, 1 based on Foata normal form. 0/467 useless extension candidates. Maximal degree in co-relation 574. Up to 31 conditions per place. [2022-11-21 16:42:14,700 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 9 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2022-11-21 16:42:14,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 376 flow [2022-11-21 16:42:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-11-21 16:42:14,702 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9101899827288429 [2022-11-21 16:42:14,702 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-11-21 16:42:14,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-11-21 16:42:14,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:14,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-11-21 16:42:14,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,706 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 342 flow. Second operand 3 states and 527 transitions. [2022-11-21 16:42:14,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 376 flow [2022-11-21 16:42:14,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 164 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:14,722 INFO L231 Difference]: Finished difference. Result has 168 places, 164 transitions, 372 flow [2022-11-21 16:42:14,723 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=168, PETRI_TRANSITIONS=164} [2022-11-21 16:42:14,723 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -22 predicate places. [2022-11-21 16:42:14,723 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 164 transitions, 372 flow [2022-11-21 16:42:14,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:14,724 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:14,724 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:42:14,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:42:14,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 16:42:14,930 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash -359410964, now seen corresponding path program 1 times [2022-11-21 16:42:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:14,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322255776] [2022-11-21 16:42:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:15,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:15,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322255776] [2022-11-21 16:42:15,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322255776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:15,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364461802] [2022-11-21 16:42:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:15,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:15,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:15,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:42:15,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:42:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:15,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 16:42:15,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:42:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-21 16:42:15,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 16:42:15,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364461802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:42:15,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 16:42:15,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-21 16:42:15,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045526457] [2022-11-21 16:42:15,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:42:15,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:42:15,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:42:15,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:42:15,215 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 193 [2022-11-21 16:42:15,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 164 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:15,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:15,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 193 [2022-11-21 16:42:15,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:15,340 INFO L130 PetriNetUnfolder]: 78/616 cut-off events. [2022-11-21 16:42:15,341 INFO L131 PetriNetUnfolder]: For 138/151 co-relation queries the response was YES. [2022-11-21 16:42:15,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 616 events. 78/616 cut-off events. For 138/151 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2825 event pairs, 0 based on Foata normal form. 8/579 useless extension candidates. Maximal degree in co-relation 880. Up to 59 conditions per place. [2022-11-21 16:42:15,347 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 12 selfloop transitions, 6 changer transitions 0/171 dead transitions. [2022-11-21 16:42:15,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 436 flow [2022-11-21 16:42:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:42:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:42:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-11-21 16:42:15,349 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9119170984455959 [2022-11-21 16:42:15,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2022-11-21 16:42:15,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2022-11-21 16:42:15,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:15,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2022-11-21 16:42:15,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:15,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:15,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:15,353 INFO L175 Difference]: Start difference. First operand has 168 places, 164 transitions, 372 flow. Second operand 3 states and 528 transitions. [2022-11-21 16:42:15,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 171 transitions, 436 flow [2022-11-21 16:42:15,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 171 transitions, 424 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:15,359 INFO L231 Difference]: Finished difference. Result has 170 places, 170 transitions, 422 flow [2022-11-21 16:42:15,360 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=422, PETRI_PLACES=170, PETRI_TRANSITIONS=170} [2022-11-21 16:42:15,360 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -20 predicate places. [2022-11-21 16:42:15,361 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 170 transitions, 422 flow [2022-11-21 16:42:15,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:15,362 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:15,362 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:42:15,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:42:15,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:15,569 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:15,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash -598637021, now seen corresponding path program 1 times [2022-11-21 16:42:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:15,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553726975] [2022-11-21 16:42:15,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553726975] [2022-11-21 16:42:15,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553726975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:15,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510897132] [2022-11-21 16:42:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:15,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:15,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:15,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:42:15,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:42:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:15,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:42:15,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:42:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:15,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:42:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:16,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510897132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:42:16,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:42:16,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-21 16:42:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442269103] [2022-11-21 16:42:16,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:42:16,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 16:42:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:16,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 16:42:16,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 16:42:16,104 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-21 16:42:16,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 170 transitions, 422 flow. Second operand has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:16,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:16,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-21 16:42:16,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:16,445 INFO L130 PetriNetUnfolder]: 232/1316 cut-off events. [2022-11-21 16:42:16,446 INFO L131 PetriNetUnfolder]: For 997/1025 co-relation queries the response was YES. [2022-11-21 16:42:16,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 1316 events. 232/1316 cut-off events. For 997/1025 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6533 event pairs, 13 based on Foata normal form. 16/1275 useless extension candidates. Maximal degree in co-relation 2312. Up to 133 conditions per place. [2022-11-21 16:42:16,461 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 62 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-11-21 16:42:16,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 220 transitions, 876 flow [2022-11-21 16:42:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 16:42:16,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-21 16:42:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1533 transitions. [2022-11-21 16:42:16,465 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8825561312607945 [2022-11-21 16:42:16,465 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1533 transitions. [2022-11-21 16:42:16,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1533 transitions. [2022-11-21 16:42:16,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:16,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1533 transitions. [2022-11-21 16:42:16,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 170.33333333333334) internal successors, (1533), 9 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:16,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:16,474 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:16,474 INFO L175 Difference]: Start difference. First operand has 170 places, 170 transitions, 422 flow. Second operand 9 states and 1533 transitions. [2022-11-21 16:42:16,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 220 transitions, 876 flow [2022-11-21 16:42:16,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 220 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-21 16:42:16,480 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 460 flow [2022-11-21 16:42:16,480 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2022-11-21 16:42:16,481 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, -11 predicate places. [2022-11-21 16:42:16,481 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 460 flow [2022-11-21 16:42:16,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 168.3) internal successors, (1683), 10 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:16,482 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:16,483 INFO L209 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:42:16,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:42:16,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:16,689 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:16,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:16,689 INFO L85 PathProgramCache]: Analyzing trace with hash 327415809, now seen corresponding path program 2 times [2022-11-21 16:42:16,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:16,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121315865] [2022-11-21 16:42:16,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:16,964 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:16,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:16,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121315865] [2022-11-21 16:42:16,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121315865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:16,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363636296] [2022-11-21 16:42:16,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:42:16,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:16,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:16,967 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:42:16,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:42:17,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:42:17,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:42:17,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:42:17,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:42:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:17,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:42:17,594 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:17,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363636296] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:42:17,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:42:17,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-21 16:42:17,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183583803] [2022-11-21 16:42:17,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:42:17,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-21 16:42:17,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-21 16:42:17,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-21 16:42:17,600 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-21 16:42:17,611 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 460 flow. Second operand has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:17,611 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:17,611 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-21 16:42:17,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:18,417 INFO L130 PetriNetUnfolder]: 392/2176 cut-off events. [2022-11-21 16:42:18,418 INFO L131 PetriNetUnfolder]: For 1508/1536 co-relation queries the response was YES. [2022-11-21 16:42:18,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3892 conditions, 2176 events. 392/2176 cut-off events. For 1508/1536 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10625 event pairs, 13 based on Foata normal form. 26/2143 useless extension candidates. Maximal degree in co-relation 3882. Up to 213 conditions per place. [2022-11-21 16:42:18,443 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 138 selfloop transitions, 21 changer transitions 0/308 dead transitions. [2022-11-21 16:42:18,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 308 transitions, 1558 flow [2022-11-21 16:42:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 16:42:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-21 16:42:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3567 transitions. [2022-11-21 16:42:18,452 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8800888230940045 [2022-11-21 16:42:18,452 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3567 transitions. [2022-11-21 16:42:18,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3567 transitions. [2022-11-21 16:42:18,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:18,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3567 transitions. [2022-11-21 16:42:18,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 169.85714285714286) internal successors, (3567), 21 states have internal predecessors, (3567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:18,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:18,473 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 193.0) internal successors, (4246), 22 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:18,473 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 460 flow. Second operand 21 states and 3567 transitions. [2022-11-21 16:42:18,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 308 transitions, 1558 flow [2022-11-21 16:42:18,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 308 transitions, 1544 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-11-21 16:42:18,482 INFO L231 Difference]: Finished difference. Result has 203 places, 189 transitions, 584 flow [2022-11-21 16:42:18,483 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=584, PETRI_PLACES=203, PETRI_TRANSITIONS=189} [2022-11-21 16:42:18,483 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 13 predicate places. [2022-11-21 16:42:18,483 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 189 transitions, 584 flow [2022-11-21 16:42:18,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 168.16666666666666) internal successors, (3027), 18 states have internal predecessors, (3027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:18,485 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:18,485 INFO L209 CegarLoopForPetriNet]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:42:18,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:42:18,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 16:42:18,695 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1096529341, now seen corresponding path program 3 times [2022-11-21 16:42:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:18,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730078619] [2022-11-21 16:42:18,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:18,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:42:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:19,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:42:19,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730078619] [2022-11-21 16:42:19,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730078619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:42:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5569277] [2022-11-21 16:42:19,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:42:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:42:19,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:42:19,435 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:42:19,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:42:19,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-21 16:42:19,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:42:19,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-21 16:42:19,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:42:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:20,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:42:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:42:20,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5569277] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:42:20,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:42:20,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 31 [2022-11-21 16:42:20,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835566582] [2022-11-21 16:42:20,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:42:20,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-21 16:42:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:42:20,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-21 16:42:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2022-11-21 16:42:20,671 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 193 [2022-11-21 16:42:20,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 189 transitions, 584 flow. Second operand has 31 states, 31 states have (on average 168.16129032258064) internal successors, (5213), 31 states have internal predecessors, (5213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:20,677 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:42:20,677 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 193 [2022-11-21 16:42:20,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:42:22,603 INFO L130 PetriNetUnfolder]: 672/3681 cut-off events. [2022-11-21 16:42:22,604 INFO L131 PetriNetUnfolder]: For 4201/4229 co-relation queries the response was YES. [2022-11-21 16:42:22,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7018 conditions, 3681 events. 672/3681 cut-off events. For 4201/4229 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 17631 event pairs, 13 based on Foata normal form. 41/3663 useless extension candidates. Maximal degree in co-relation 7003. Up to 353 conditions per place. [2022-11-21 16:42:22,643 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 271 selfloop transitions, 42 changer transitions 0/462 dead transitions. [2022-11-21 16:42:22,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 462 transitions, 2906 flow [2022-11-21 16:42:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-21 16:42:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-11-21 16:42:22,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 7126 transitions. [2022-11-21 16:42:22,655 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8791018998272885 [2022-11-21 16:42:22,656 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 7126 transitions. [2022-11-21 16:42:22,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 7126 transitions. [2022-11-21 16:42:22,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:42:22,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 7126 transitions. [2022-11-21 16:42:22,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 169.66666666666666) internal successors, (7126), 42 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:22,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 193.0) internal successors, (8299), 43 states have internal predecessors, (8299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:22,694 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 193.0) internal successors, (8299), 43 states have internal predecessors, (8299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:22,695 INFO L175 Difference]: Start difference. First operand has 203 places, 189 transitions, 584 flow. Second operand 42 states and 7126 transitions. [2022-11-21 16:42:22,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 462 transitions, 2906 flow [2022-11-21 16:42:22,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 462 transitions, 2868 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-11-21 16:42:22,709 INFO L231 Difference]: Finished difference. Result has 246 places, 211 transitions, 832 flow [2022-11-21 16:42:22,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=832, PETRI_PLACES=246, PETRI_TRANSITIONS=211} [2022-11-21 16:42:22,710 INFO L288 CegarLoopForPetriNet]: 190 programPoint places, 56 predicate places. [2022-11-21 16:42:22,710 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 211 transitions, 832 flow [2022-11-21 16:42:22,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 168.16129032258064) internal successors, (5213), 31 states have internal predecessors, (5213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:42:22,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:42:22,712 INFO L209 CegarLoopForPetriNet]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 16:42:22,723 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:42:22,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 16:42:22,919 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2022-11-21 16:42:22,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:42:22,920 INFO L85 PathProgramCache]: Analyzing trace with hash 2068797116, now seen corresponding path program 4 times [2022-11-21 16:42:22,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:42:22,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272388340] [2022-11-21 16:42:22,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:42:22,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:42:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:42:23,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:42:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:42:23,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:42:23,645 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 16:42:23,646 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2022-11-21 16:42:23,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2022-11-21 16:42:23,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2022-11-21 16:42:23,648 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2022-11-21 16:42:23,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2022-11-21 16:42:23,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2022-11-21 16:42:23,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2022-11-21 16:42:23,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2022-11-21 16:42:23,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2022-11-21 16:42:23,649 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2022-11-21 16:42:23,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2022-11-21 16:42:23,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2022-11-21 16:42:23,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2022-11-21 16:42:23,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2022-11-21 16:42:23,650 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2022-11-21 16:42:23,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2022-11-21 16:42:23,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2022-11-21 16:42:23,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2022-11-21 16:42:23,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2022-11-21 16:42:23,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2022-11-21 16:42:23,651 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2022-11-21 16:42:23,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2022-11-21 16:42:23,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2022-11-21 16:42:23,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2022-11-21 16:42:23,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2022-11-21 16:42:23,652 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2022-11-21 16:42:23,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2022-11-21 16:42:23,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (18 of 46 remaining) [2022-11-21 16:42:23,653 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2022-11-21 16:42:23,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2022-11-21 16:42:23,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2022-11-21 16:42:23,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2022-11-21 16:42:23,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2022-11-21 16:42:23,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2022-11-21 16:42:23,654 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err2ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2022-11-21 16:42:23,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err3ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2022-11-21 16:42:23,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err4ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2022-11-21 16:42:23,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err5ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2022-11-21 16:42:23,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err6ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2022-11-21 16:42:23,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2022-11-21 16:42:23,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2022-11-21 16:42:23,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2022-11-21 16:42:23,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2022-11-21 16:42:23,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err4ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2022-11-21 16:42:23,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err5ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2022-11-21 16:42:23,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err6ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2022-11-21 16:42:23,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 16:42:23,657 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:42:23,666 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-21 16:42:23,666 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 16:42:24,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 04:42:24 BasicIcfg [2022-11-21 16:42:24,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 16:42:24,048 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:42:24,048 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:42:24,049 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:42:24,049 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:42:10" (3/4) ... [2022-11-21 16:42:24,054 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:42:24,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:42:24,055 INFO L158 Benchmark]: Toolchain (without parser) took 15190.93ms. Allocated memory was 192.9MB in the beginning and 371.2MB in the end (delta: 178.3MB). Free memory was 147.1MB in the beginning and 265.6MB in the end (delta: -118.5MB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2022-11-21 16:42:24,055 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 134.2MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:42:24,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.13ms. Allocated memory is still 192.9MB. Free memory was 147.1MB in the beginning and 127.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-21 16:42:24,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.59ms. Allocated memory is still 192.9MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:42:24,056 INFO L158 Benchmark]: Boogie Preprocessor took 29.20ms. Allocated memory is still 192.9MB. Free memory was 125.0MB in the beginning and 123.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 16:42:24,057 INFO L158 Benchmark]: RCFGBuilder took 759.70ms. Allocated memory is still 192.9MB. Free memory was 123.4MB in the beginning and 153.3MB in the end (delta: -29.9MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-11-21 16:42:24,057 INFO L158 Benchmark]: TraceAbstraction took 13785.07ms. Allocated memory was 192.9MB in the beginning and 371.2MB in the end (delta: 178.3MB). Free memory was 153.3MB in the beginning and 265.6MB in the end (delta: -112.3MB). Peak memory consumption was 254.7MB. Max. memory is 16.1GB. [2022-11-21 16:42:24,057 INFO L158 Benchmark]: Witness Printer took 6.44ms. Allocated memory is still 371.2MB. Free memory is still 265.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:42:24,060 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.26ms. Allocated memory is still 134.2MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.13ms. Allocated memory is still 192.9MB. Free memory was 147.1MB in the beginning and 127.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.59ms. Allocated memory is still 192.9MB. Free memory was 127.1MB in the beginning and 125.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.20ms. Allocated memory is still 192.9MB. Free memory was 125.0MB in the beginning and 123.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 759.70ms. Allocated memory is still 192.9MB. Free memory was 123.4MB in the beginning and 153.3MB in the end (delta: -29.9MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13785.07ms. Allocated memory was 192.9MB in the beginning and 371.2MB in the end (delta: 178.3MB). Free memory was 153.3MB in the beginning and 265.6MB in the end (delta: -112.3MB). Peak memory consumption was 254.7MB. Max. memory is 16.1GB. * Witness Printer took 6.44ms. Allocated memory is still 371.2MB. Free memory is still 265.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 725]: Data race detected Data race detected The following path leads to a data race: [L683] 0 int i, j; VAL [i=0, j=0] [L686] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L703] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L704] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L714] 0 pthread_t id1, id2; VAL [\old(argc)=662, argc=662, argv={651:614}, argv={651:614}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L716] 0 i = 1 VAL [\old(argc)=662, argc=662, argv={651:614}, argv={651:614}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L719] 0 j = 1 VAL [\old(argc)=662, argc=662, argv={651:614}, argv={651:614}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(argc)=662, arg={0:0}, argc=662, argv={651:614}, argv={651:614}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id1, ((void *)0), t1, ((void *)0))=-1, q=0, x=0] [L722] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(argc)=662, arg={0:0}, arg={0:0}, argc=662, argv={651:614}, argv={651:614}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, pthread_create(&id2, ((void *)0), t2, ((void *)0))=0, q=0, x=0] [L723] CALL, EXPR 0 fib() [L706] 0 x = 0 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=0, q=0, x=0] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=0] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=1, p=0, prev=1, q=0, x=1] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=1] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=2, p=0, prev=1, q=0, x=2] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=1, q=0, x=2] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=2, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=2] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=3, p=0, prev=2, q=0, x=3] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=2, q=0, x=3] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=3, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=3] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=5, p=0, prev=3, q=0, x=4] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=3, q=0, x=4] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=5, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=4] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=8, p=0, prev=5, q=0, x=5] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=5, q=0, x=5] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=8, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=5] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=13, p=0, prev=8, q=0, x=6] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=8, q=0, x=6] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=13, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=6] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=21, p=0, prev=13, q=0, x=7] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=13, q=0, x=7] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=21, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=7] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=34, p=0, prev=21, q=0, x=8] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=21, q=0, x=8] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=34, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=8] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=55, p=0, prev=34, q=0, x=9] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=34, q=0, x=9] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=55, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=9] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=89, p=0, prev=55, q=0, x=10] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=55, q=0, x=10] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=89, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=10] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=144, p=0, prev=89, q=0, x=11] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=89, q=0, x=11] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=144, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=11] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=233, p=0, prev=144, q=0, x=12] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=144, q=0, x=12] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=233, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=12] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L706] COND TRUE 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] EXPR 0 prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=377, p=0, prev=233, q=0, x=13] [L707] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=233, q=0, x=13] [L708] 0 prev = cur VAL [arg={0:0}, arg={0:0}, cur=377, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L709] 0 cur = next VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=13] [L706] 0 x++ VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] 0 x < 14 VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L706] COND FALSE 0 !(x < 14) VAL [arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L711] 0 return prev; VAL [\result=377, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L723] RET, EXPR 0 fib() [L723] 0 int correct = fib(); VAL [\old(argc)=662, arg={0:0}, arg={0:0}, argc=662, argv={651:614}, argv={651:614}, correct=377, cur=610, fib()=377, i=1, id1={5:0}, id2={3:0}, j=1, next=610, p=0, prev=377, q=0, x=14] [L725] 0 i < correct VAL [\old(argc)=662, arg={0:0}, arg={0:0}, argc=662, argv={651:614}, argv={651:614}, correct=377, cur=610, i=1, id1={5:0}, id2={3:0}, j=1, next=610, p=0, prev=377, q=0, x=14] [L688] 1 p = 0 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L688] 1 p < 6 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L688] COND TRUE 1 p < 6 VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=1, j=1, next=610, p=0, prev=377, q=0, x=14] [L690] EXPR 1 i + j [L690] 1 i = i + j VAL [arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=2, j=1, next=610, p=0, prev=377, q=0, x=14] [L725] 0 i < correct VAL [\old(argc)=662, arg={0:0}, arg={0:0}, arg={0:0}, argc=662, argv={651:614}, argv={651:614}, correct=377, cur=610, i=2, id1={5:0}, id2={3:0}, j=1, next=610, p=0, prev=377, q=0, x=14] Now there is a data race on ~i~0 between C: i = i + j [690] and C: i < correct [725] - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 721]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 722]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 690]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.3s, OverallIterations: 23, TraceHistogramMax: 15, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 147 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1501 GetRequests, 1379 SyntacticMatches, 3 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=832occurred in iteration=22, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3060 NumberOfCodeBlocks, 3060 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3067 ConstructedInterpolants, 0 QuantifiedInterpolants, 5719 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 30 InterpolantComputations, 19 PerfectInterpolantSequences, 6/2631 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 16:42:24,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_852fa8ed-6f85-4a76-9c39-863644c7cd79/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE