./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/clever.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 4fc63b2a 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_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/clever.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:08,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:08,641 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-31 21:58:08,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:08,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:08,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:08,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:08,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:08,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:08,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:08,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:08,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:08,690 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:08,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:08,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:08,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:08,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:58:08,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:08,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:08,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:08,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:08,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:08,700 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-31 21:58:08,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:08,700 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:58:08,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:08,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:08,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:08,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:08,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:08,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:08,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:08,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:08,706 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:08,706 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:08,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:58:08,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:58:08,707 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:08,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:08,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:08,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:08,709 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/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_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2024-10-31 21:58:09,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:09,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:09,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:09,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:09,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:09,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/weaver/clever.wvr.c Unable to find full path for "g++" [2024-10-31 21:58:11,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:11,363 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:11,363 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/sv-benchmarks/c/weaver/clever.wvr.c [2024-10-31 21:58:11,375 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/data/5f6c144b6/d74ee0d557c54acaa082aaa8c5d66118/FLAG709d45677 [2024-10-31 21:58:11,391 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/data/5f6c144b6/d74ee0d557c54acaa082aaa8c5d66118 [2024-10-31 21:58:11,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:11,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:11,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:11,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:11,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:11,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25843430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11, skipping insertion in model container [2024-10-31 21:58:11,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,436 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:11,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:11,732 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:11,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:11,778 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:11,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11 WrapperNode [2024-10-31 21:58:11,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:11,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:11,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:11,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:11,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,820 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2024-10-31 21:58:11,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:11,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:11,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:11,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:11,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,855 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:11,859 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:11,859 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:11,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:11,860 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (1/1) ... [2024-10-31 21:58:11,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:11,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:11,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:58:11,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:58:11,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:11,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-31 21:58:11,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-31 21:58:11,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-31 21:58:11,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-31 21:58:11,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-31 21:58:11,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:11,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:11,933 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 21:58:12,046 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:12,049 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:12,556 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:58:12,556 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:12,580 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:12,580 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-31 21:58:12,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:12 BoogieIcfgContainer [2024-10-31 21:58:12,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:12,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:12,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:12,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:12,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:11" (1/3) ... [2024-10-31 21:58:12,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d03a60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:12, skipping insertion in model container [2024-10-31 21:58:12,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:11" (2/3) ... [2024-10-31 21:58:12,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d03a60a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:12, skipping insertion in model container [2024-10-31 21:58:12,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:12" (3/3) ... [2024-10-31 21:58:12,595 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-10-31 21:58:12,616 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:12,616 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-10-31 21:58:12,617 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:58:12,808 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-31 21:58:12,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 266 transitions, 546 flow [2024-10-31 21:58:12,967 INFO L124 PetriNetUnfolderBase]: 12/264 cut-off events. [2024-10-31 21:58:12,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-31 21:58:12,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 264 events. 12/264 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 440 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 204. Up to 2 conditions per place. [2024-10-31 21:58:12,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 266 transitions, 546 flow [2024-10-31 21:58:12,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 247 transitions, 506 flow [2024-10-31 21:58:12,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:13,002 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@254b401d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:13,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-31 21:58:13,019 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:58:13,019 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-31 21:58:13,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:58:13,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:13,020 INFO L204 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] [2024-10-31 21:58:13,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:13,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash 578639531, now seen corresponding path program 1 times [2024-10-31 21:58:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953245384] [2024-10-31 21:58:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:13,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:13,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:13,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953245384] [2024-10-31 21:58:13,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953245384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696348493] [2024-10-31 21:58:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:13,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:13,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:13,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-31 21:58:13,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 247 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:13,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:13,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-31 21:58:13,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:13,425 INFO L124 PetriNetUnfolderBase]: 13/361 cut-off events. [2024-10-31 21:58:13,425 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-31 21:58:13,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 361 events. 13/361 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1009 event pairs, 3 based on Foata normal form. 13/306 useless extension candidates. Maximal degree in co-relation 231. Up to 18 conditions per place. [2024-10-31 21:58:13,436 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 9 selfloop transitions, 2 changer transitions 2/241 dead transitions. [2024-10-31 21:58:13,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 241 transitions, 516 flow [2024-10-31 21:58:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-10-31 21:58:13,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9461152882205514 [2024-10-31 21:58:13,462 INFO L175 Difference]: Start difference. First operand has 243 places, 247 transitions, 506 flow. Second operand 3 states and 755 transitions. [2024-10-31 21:58:13,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 241 transitions, 516 flow [2024-10-31 21:58:13,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 241 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-31 21:58:13,475 INFO L231 Difference]: Finished difference. Result has 240 places, 239 transitions, 486 flow [2024-10-31 21:58:13,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=240, PETRI_TRANSITIONS=239} [2024-10-31 21:58:13,486 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -3 predicate places. [2024-10-31 21:58:13,486 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 239 transitions, 486 flow [2024-10-31 21:58:13,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:13,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:13,487 INFO L204 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] [2024-10-31 21:58:13,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:58:13,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:13,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:13,490 INFO L85 PathProgramCache]: Analyzing trace with hash 917335090, now seen corresponding path program 1 times [2024-10-31 21:58:13,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:13,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724067213] [2024-10-31 21:58:13,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724067213] [2024-10-31 21:58:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724067213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:13,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:13,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120456550] [2024-10-31 21:58:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:13,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:13,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:13,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:13,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:13,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-10-31 21:58:13,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 239 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:13,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:13,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-10-31 21:58:13,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:13,710 INFO L124 PetriNetUnfolderBase]: 10/279 cut-off events. [2024-10-31 21:58:13,710 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-31 21:58:13,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 279 events. 10/279 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 591 event pairs, 3 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 274. Up to 17 conditions per place. [2024-10-31 21:58:13,716 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-10-31 21:58:13,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 508 flow [2024-10-31 21:58:13,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-31 21:58:13,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-10-31 21:58:13,720 INFO L175 Difference]: Start difference. First operand has 240 places, 239 transitions, 486 flow. Second operand 3 states and 748 transitions. [2024-10-31 21:58:13,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 508 flow [2024-10-31 21:58:13,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 238 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:13,751 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 484 flow [2024-10-31 21:58:13,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-10-31 21:58:13,752 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2024-10-31 21:58:13,752 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 484 flow [2024-10-31 21:58:13,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:13,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:13,753 INFO L204 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] [2024-10-31 21:58:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:58:13,754 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:13,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:13,756 INFO L85 PathProgramCache]: Analyzing trace with hash -385693522, now seen corresponding path program 1 times [2024-10-31 21:58:13,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:13,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186662307] [2024-10-31 21:58:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:13,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186662307] [2024-10-31 21:58:13,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186662307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:13,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:13,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117047177] [2024-10-31 21:58:13,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:13,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:13,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:13,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:13,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 266 [2024-10-31 21:58:13,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:13,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:13,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 266 [2024-10-31 21:58:13,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:14,034 INFO L124 PetriNetUnfolderBase]: 11/298 cut-off events. [2024-10-31 21:58:14,035 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 21:58:14,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 298 events. 11/298 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 3 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 292. Up to 22 conditions per place. [2024-10-31 21:58:14,040 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-10-31 21:58:14,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 237 transitions, 514 flow [2024-10-31 21:58:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2024-10-31 21:58:14,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-10-31 21:58:14,044 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 484 flow. Second operand 3 states and 740 transitions. [2024-10-31 21:58:14,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 237 transitions, 514 flow [2024-10-31 21:58:14,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 237 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:14,051 INFO L231 Difference]: Finished difference. Result has 236 places, 237 transitions, 482 flow [2024-10-31 21:58:14,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=236, PETRI_TRANSITIONS=237} [2024-10-31 21:58:14,053 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -7 predicate places. [2024-10-31 21:58:14,053 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 237 transitions, 482 flow [2024-10-31 21:58:14,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:14,054 INFO L204 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] [2024-10-31 21:58:14,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:58:14,054 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:14,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1229539445, now seen corresponding path program 1 times [2024-10-31 21:58:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:14,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359861405] [2024-10-31 21:58:14,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:14,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:14,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359861405] [2024-10-31 21:58:14,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359861405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:14,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:14,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940940177] [2024-10-31 21:58:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:14,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:14,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:14,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:14,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-31 21:58:14,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 237 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:14,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-31 21:58:14,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:14,277 INFO L124 PetriNetUnfolderBase]: 10/273 cut-off events. [2024-10-31 21:58:14,277 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-10-31 21:58:14,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 273 events. 10/273 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 571 event pairs, 3 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 253. Up to 19 conditions per place. [2024-10-31 21:58:14,280 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-10-31 21:58:14,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 236 transitions, 506 flow [2024-10-31 21:58:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-31 21:58:14,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-31 21:58:14,286 INFO L175 Difference]: Start difference. First operand has 236 places, 237 transitions, 482 flow. Second operand 3 states and 746 transitions. [2024-10-31 21:58:14,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 236 transitions, 506 flow [2024-10-31 21:58:14,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 236 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:14,292 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 480 flow [2024-10-31 21:58:14,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-10-31 21:58:14,294 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2024-10-31 21:58:14,295 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 480 flow [2024-10-31 21:58:14,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:14,296 INFO L204 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] [2024-10-31 21:58:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:58:14,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:14,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash 578115641, now seen corresponding path program 1 times [2024-10-31 21:58:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:14,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649506668] [2024-10-31 21:58:14,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:14,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649506668] [2024-10-31 21:58:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649506668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:14,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:14,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:14,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494001265] [2024-10-31 21:58:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:14,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:14,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:14,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:14,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-31 21:58:14,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:14,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-31 21:58:14,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:14,503 INFO L124 PetriNetUnfolderBase]: 14/387 cut-off events. [2024-10-31 21:58:14,503 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-31 21:58:14,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 387 events. 14/387 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1032 event pairs, 4 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 364. Up to 20 conditions per place. [2024-10-31 21:58:14,506 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-10-31 21:58:14,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 235 transitions, 504 flow [2024-10-31 21:58:14,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-31 21:58:14,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-31 21:58:14,510 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 480 flow. Second operand 3 states and 746 transitions. [2024-10-31 21:58:14,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 235 transitions, 504 flow [2024-10-31 21:58:14,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 235 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:14,515 INFO L231 Difference]: Finished difference. Result has 234 places, 235 transitions, 478 flow [2024-10-31 21:58:14,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=234, PETRI_TRANSITIONS=235} [2024-10-31 21:58:14,517 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2024-10-31 21:58:14,518 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 235 transitions, 478 flow [2024-10-31 21:58:14,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:14,519 INFO L204 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] [2024-10-31 21:58:14,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:58:14,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:14,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1185114072, now seen corresponding path program 1 times [2024-10-31 21:58:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:14,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602426808] [2024-10-31 21:58:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602426808] [2024-10-31 21:58:14,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602426808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:14,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:14,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768269457] [2024-10-31 21:58:14,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:14,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:14,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:14,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:14,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-31 21:58:14,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 235 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:14,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-31 21:58:14,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:14,737 INFO L124 PetriNetUnfolderBase]: 10/310 cut-off events. [2024-10-31 21:58:14,737 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-31 21:58:14,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 310 events. 10/310 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 643 event pairs, 2 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2024-10-31 21:58:14,740 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-10-31 21:58:14,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 234 transitions, 502 flow [2024-10-31 21:58:14,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-31 21:58:14,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-31 21:58:14,745 INFO L175 Difference]: Start difference. First operand has 234 places, 235 transitions, 478 flow. Second operand 3 states and 746 transitions. [2024-10-31 21:58:14,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 234 transitions, 502 flow [2024-10-31 21:58:14,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 234 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:14,751 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 476 flow [2024-10-31 21:58:14,752 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2024-10-31 21:58:14,752 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -10 predicate places. [2024-10-31 21:58:14,753 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 476 flow [2024-10-31 21:58:14,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:14,755 INFO L204 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] [2024-10-31 21:58:14,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:58:14,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:14,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:14,756 INFO L85 PathProgramCache]: Analyzing trace with hash 443216440, now seen corresponding path program 1 times [2024-10-31 21:58:14,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:14,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380221088] [2024-10-31 21:58:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:14,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:14,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:14,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380221088] [2024-10-31 21:58:14,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380221088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:14,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:14,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:14,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537592851] [2024-10-31 21:58:14,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:14,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:14,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:14,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:14,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:14,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-31 21:58:14,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:14,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-31 21:58:14,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:14,944 INFO L124 PetriNetUnfolderBase]: 8/237 cut-off events. [2024-10-31 21:58:14,944 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-31 21:58:14,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 237 events. 8/237 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 430 event pairs, 2 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 191. Up to 16 conditions per place. [2024-10-31 21:58:14,946 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-10-31 21:58:14,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 233 transitions, 500 flow [2024-10-31 21:58:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-10-31 21:58:14,949 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-10-31 21:58:14,950 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 476 flow. Second operand 3 states and 746 transitions. [2024-10-31 21:58:14,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 233 transitions, 500 flow [2024-10-31 21:58:14,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:14,955 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 474 flow [2024-10-31 21:58:14,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2024-10-31 21:58:14,956 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2024-10-31 21:58:14,956 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 474 flow [2024-10-31 21:58:14,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:14,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:14,958 INFO L204 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] [2024-10-31 21:58:14,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:58:14,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:14,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:14,960 INFO L85 PathProgramCache]: Analyzing trace with hash 732440509, now seen corresponding path program 1 times [2024-10-31 21:58:14,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:14,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850160148] [2024-10-31 21:58:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:14,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:15,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:15,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850160148] [2024-10-31 21:58:15,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850160148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:15,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:15,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:15,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675352116] [2024-10-31 21:58:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:15,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:15,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:15,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:15,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 266 [2024-10-31 21:58:15,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:15,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:15,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 266 [2024-10-31 21:58:15,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:15,197 INFO L124 PetriNetUnfolderBase]: 13/289 cut-off events. [2024-10-31 21:58:15,197 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 21:58:15,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 289 events. 13/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 4 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 254. Up to 26 conditions per place. [2024-10-31 21:58:15,199 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 17 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2024-10-31 21:58:15,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 229 transitions, 507 flow [2024-10-31 21:58:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:15,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-10-31 21:58:15,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9160401002506265 [2024-10-31 21:58:15,203 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 474 flow. Second operand 3 states and 731 transitions. [2024-10-31 21:58:15,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 229 transitions, 507 flow [2024-10-31 21:58:15,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 229 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:15,209 INFO L231 Difference]: Finished difference. Result has 227 places, 228 transitions, 471 flow [2024-10-31 21:58:15,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=227, PETRI_TRANSITIONS=228} [2024-10-31 21:58:15,212 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2024-10-31 21:58:15,212 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 228 transitions, 471 flow [2024-10-31 21:58:15,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:15,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:15,213 INFO L204 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] [2024-10-31 21:58:15,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:58:15,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:15,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:15,214 INFO L85 PathProgramCache]: Analyzing trace with hash -499292250, now seen corresponding path program 1 times [2024-10-31 21:58:15,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:15,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857778711] [2024-10-31 21:58:15,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:15,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:15,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857778711] [2024-10-31 21:58:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857778711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218810924] [2024-10-31 21:58:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:15,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:15,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:15,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-31 21:58:15,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 228 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:15,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:15,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-31 21:58:15,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:15,405 INFO L124 PetriNetUnfolderBase]: 12/263 cut-off events. [2024-10-31 21:58:15,405 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-31 21:58:15,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 263 events. 12/263 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 568 event pairs, 4 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2024-10-31 21:58:15,407 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 11 selfloop transitions, 3 changer transitions 0/227 dead transitions. [2024-10-31 21:58:15,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 227 transitions, 498 flow [2024-10-31 21:58:15,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-10-31 21:58:15,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2024-10-31 21:58:15,410 INFO L175 Difference]: Start difference. First operand has 227 places, 228 transitions, 471 flow. Second operand 3 states and 749 transitions. [2024-10-31 21:58:15,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 227 transitions, 498 flow [2024-10-31 21:58:15,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 227 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:15,417 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 475 flow [2024-10-31 21:58:15,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2024-10-31 21:58:15,419 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -17 predicate places. [2024-10-31 21:58:15,419 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 475 flow [2024-10-31 21:58:15,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:15,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:15,421 INFO L204 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] [2024-10-31 21:58:15,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:58:15,422 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:15,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:15,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1625983613, now seen corresponding path program 1 times [2024-10-31 21:58:15,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:15,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917054255] [2024-10-31 21:58:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:15,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:15,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917054255] [2024-10-31 21:58:15,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917054255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:15,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:15,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965000732] [2024-10-31 21:58:15,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:15,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:15,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-31 21:58:15,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:15,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:15,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-31 21:58:15,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:15,712 INFO L124 PetriNetUnfolderBase]: 16/385 cut-off events. [2024-10-31 21:58:15,712 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-31 21:58:15,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 385 events. 16/385 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1129 event pairs, 1 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 333. Up to 17 conditions per place. [2024-10-31 21:58:15,716 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 14 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2024-10-31 21:58:15,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 229 transitions, 521 flow [2024-10-31 21:58:15,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-10-31 21:58:15,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-10-31 21:58:15,721 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 475 flow. Second operand 3 states and 753 transitions. [2024-10-31 21:58:15,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 229 transitions, 521 flow [2024-10-31 21:58:15,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:15,728 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 486 flow [2024-10-31 21:58:15,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2024-10-31 21:58:15,731 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -18 predicate places. [2024-10-31 21:58:15,732 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 486 flow [2024-10-31 21:58:15,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:15,733 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:15,733 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:15,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:58:15,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:15,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:15,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1498306685, now seen corresponding path program 1 times [2024-10-31 21:58:15,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:15,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110908098] [2024-10-31 21:58:15,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:15,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:15,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:15,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:15,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110908098] [2024-10-31 21:58:15,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110908098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:15,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:15,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:15,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114115404] [2024-10-31 21:58:15,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:15,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:15,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:15,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-10-31 21:58:15,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:15,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:15,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-10-31 21:58:15,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:16,010 INFO L124 PetriNetUnfolderBase]: 27/553 cut-off events. [2024-10-31 21:58:16,010 INFO L125 PetriNetUnfolderBase]: For 12/16 co-relation queries the response was YES. [2024-10-31 21:58:16,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 553 events. 27/553 cut-off events. For 12/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2637 event pairs, 2 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 407. Up to 30 conditions per place. [2024-10-31 21:58:16,017 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 10 selfloop transitions, 3 changer transitions 7/228 dead transitions. [2024-10-31 21:58:16,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 530 flow [2024-10-31 21:58:16,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:16,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2024-10-31 21:58:16,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423558897243107 [2024-10-31 21:58:16,020 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 486 flow. Second operand 3 states and 752 transitions. [2024-10-31 21:58:16,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 530 flow [2024-10-31 21:58:16,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:16,029 INFO L231 Difference]: Finished difference. Result has 224 places, 218 transitions, 474 flow [2024-10-31 21:58:16,029 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=224, PETRI_TRANSITIONS=218} [2024-10-31 21:58:16,030 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -19 predicate places. [2024-10-31 21:58:16,030 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 218 transitions, 474 flow [2024-10-31 21:58:16,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:16,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:16,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:16,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:58:16,035 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:16,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1127054599, now seen corresponding path program 1 times [2024-10-31 21:58:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:16,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914888] [2024-10-31 21:58:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:16,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:16,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914888] [2024-10-31 21:58:16,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:16,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:16,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:16,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519324155] [2024-10-31 21:58:16,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:16,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:16,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:16,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:16,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-10-31 21:58:16,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 218 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:16,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:16,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-10-31 21:58:16,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:16,321 INFO L124 PetriNetUnfolderBase]: 66/1009 cut-off events. [2024-10-31 21:58:16,321 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-10-31 21:58:16,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1009 events. 66/1009 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5988 event pairs, 20 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 658. Up to 92 conditions per place. [2024-10-31 21:58:16,329 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 1 changer transitions 0/215 dead transitions. [2024-10-31 21:58:16,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 488 flow [2024-10-31 21:58:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-10-31 21:58:16,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-10-31 21:58:16,332 INFO L175 Difference]: Start difference. First operand has 224 places, 218 transitions, 474 flow. Second operand 3 states and 748 transitions. [2024-10-31 21:58:16,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 488 flow [2024-10-31 21:58:16,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 215 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:16,338 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 467 flow [2024-10-31 21:58:16,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-10-31 21:58:16,339 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-31 21:58:16,340 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 467 flow [2024-10-31 21:58:16,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:16,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:16,343 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:16,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:58:16,344 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:16,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1772561207, now seen corresponding path program 1 times [2024-10-31 21:58:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872039284] [2024-10-31 21:58:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:16,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:16,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872039284] [2024-10-31 21:58:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872039284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:16,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:16,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:16,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305233432] [2024-10-31 21:58:16,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:16,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:16,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:16,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 266 [2024-10-31 21:58:16,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:16,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:16,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 266 [2024-10-31 21:58:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:16,646 INFO L124 PetriNetUnfolderBase]: 80/1099 cut-off events. [2024-10-31 21:58:16,646 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-31 21:58:16,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1099 events. 80/1099 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7313 event pairs, 16 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 636. Up to 108 conditions per place. [2024-10-31 21:58:16,657 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-10-31 21:58:16,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 492 flow [2024-10-31 21:58:16,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:16,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:16,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-10-31 21:58:16,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9486215538847118 [2024-10-31 21:58:16,660 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 467 flow. Second operand 3 states and 757 transitions. [2024-10-31 21:58:16,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 216 transitions, 492 flow [2024-10-31 21:58:16,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 491 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:16,668 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 476 flow [2024-10-31 21:58:16,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-10-31 21:58:16,671 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-31 21:58:16,672 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 476 flow [2024-10-31 21:58:16,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:16,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:16,674 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:16,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:58:16,674 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:16,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:16,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1046373861, now seen corresponding path program 1 times [2024-10-31 21:58:16,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:16,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031056905] [2024-10-31 21:58:16,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:16,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:16,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:16,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031056905] [2024-10-31 21:58:16,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031056905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:16,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:16,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:16,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473296846] [2024-10-31 21:58:16,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:16,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:16,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:16,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-31 21:58:16,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:16,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:16,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-31 21:58:16,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:16,921 INFO L124 PetriNetUnfolderBase]: 72/875 cut-off events. [2024-10-31 21:58:16,921 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2024-10-31 21:58:16,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 875 events. 72/875 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5238 event pairs, 16 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 740. Up to 70 conditions per place. [2024-10-31 21:58:16,928 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-10-31 21:58:16,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 501 flow [2024-10-31 21:58:16,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:16,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-31 21:58:16,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-31 21:58:16,931 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-10-31 21:58:16,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 501 flow [2024-10-31 21:58:16,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 501 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-31 21:58:16,938 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 478 flow [2024-10-31 21:58:16,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2024-10-31 21:58:16,939 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -24 predicate places. [2024-10-31 21:58:16,939 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 478 flow [2024-10-31 21:58:16,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:16,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:16,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:16,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:58:16,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:16,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 349565981, now seen corresponding path program 1 times [2024-10-31 21:58:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067451959] [2024-10-31 21:58:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:17,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067451959] [2024-10-31 21:58:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067451959] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:17,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:17,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:17,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762127762] [2024-10-31 21:58:17,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:17,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:17,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:17,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:17,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:17,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-31 21:58:17,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:17,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:17,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-31 21:58:17,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:17,191 INFO L124 PetriNetUnfolderBase]: 62/985 cut-off events. [2024-10-31 21:58:17,191 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-10-31 21:58:17,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 985 events. 62/985 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5805 event pairs, 10 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 744. Up to 44 conditions per place. [2024-10-31 21:58:17,198 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 10 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2024-10-31 21:58:17,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 510 flow [2024-10-31 21:58:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:17,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-10-31 21:58:17,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-10-31 21:58:17,201 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 478 flow. Second operand 3 states and 753 transitions. [2024-10-31 21:58:17,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 510 flow [2024-10-31 21:58:17,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 215 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:17,208 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 483 flow [2024-10-31 21:58:17,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2024-10-31 21:58:17,209 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-31 21:58:17,209 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 483 flow [2024-10-31 21:58:17,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:17,210 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:17,210 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:17,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:58:17,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1064476230, now seen corresponding path program 1 times [2024-10-31 21:58:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57872212] [2024-10-31 21:58:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:17,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:17,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:17,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57872212] [2024-10-31 21:58:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57872212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:17,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442178833] [2024-10-31 21:58:17,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:17,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:17,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:17,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:17,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-31 21:58:17,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:17,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:17,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-31 21:58:17,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:17,455 INFO L124 PetriNetUnfolderBase]: 60/811 cut-off events. [2024-10-31 21:58:17,456 INFO L125 PetriNetUnfolderBase]: For 60/68 co-relation queries the response was YES. [2024-10-31 21:58:17,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 811 events. 60/811 cut-off events. For 60/68 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4064 event pairs, 16 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 669. Up to 76 conditions per place. [2024-10-31 21:58:17,461 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-10-31 21:58:17,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 508 flow [2024-10-31 21:58:17,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-10-31 21:58:17,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-10-31 21:58:17,464 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 483 flow. Second operand 3 states and 750 transitions. [2024-10-31 21:58:17,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 508 flow [2024-10-31 21:58:17,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:58:17,469 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 482 flow [2024-10-31 21:58:17,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2024-10-31 21:58:17,470 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-10-31 21:58:17,471 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 482 flow [2024-10-31 21:58:17,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:17,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:17,473 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:17,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:58:17,474 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:17,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:17,474 INFO L85 PathProgramCache]: Analyzing trace with hash -702215671, now seen corresponding path program 1 times [2024-10-31 21:58:17,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:17,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709795277] [2024-10-31 21:58:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:17,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:17,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709795277] [2024-10-31 21:58:17,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709795277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:17,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:17,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:17,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249271848] [2024-10-31 21:58:17,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:17,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:17,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:17,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:17,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:17,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-31 21:58:17,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:17,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:17,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-31 21:58:17,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:17,711 INFO L124 PetriNetUnfolderBase]: 58/877 cut-off events. [2024-10-31 21:58:17,711 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-10-31 21:58:17,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 877 events. 58/877 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4636 event pairs, 10 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 956. Up to 45 conditions per place. [2024-10-31 21:58:17,717 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-10-31 21:58:17,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 212 transitions, 507 flow [2024-10-31 21:58:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-10-31 21:58:17,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-10-31 21:58:17,720 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 482 flow. Second operand 3 states and 750 transitions. [2024-10-31 21:58:17,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 212 transitions, 507 flow [2024-10-31 21:58:17,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 212 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:17,725 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 480 flow [2024-10-31 21:58:17,726 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2024-10-31 21:58:17,726 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -26 predicate places. [2024-10-31 21:58:17,726 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 480 flow [2024-10-31 21:58:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:17,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:17,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:17,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:58:17,729 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:17,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:17,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1453595937, now seen corresponding path program 1 times [2024-10-31 21:58:17,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947927004] [2024-10-31 21:58:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:17,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:17,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:17,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947927004] [2024-10-31 21:58:17,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947927004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:17,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:17,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:17,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155465673] [2024-10-31 21:58:17,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:17,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:17,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:17,846 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 266 [2024-10-31 21:58:17,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:17,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:17,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 266 [2024-10-31 21:58:17,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:18,007 INFO L124 PetriNetUnfolderBase]: 68/901 cut-off events. [2024-10-31 21:58:18,008 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-31 21:58:18,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 901 events. 68/901 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5048 event pairs, 24 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1143. Up to 86 conditions per place. [2024-10-31 21:58:18,015 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-31 21:58:18,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 513 flow [2024-10-31 21:58:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2024-10-31 21:58:18,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9335839598997494 [2024-10-31 21:58:18,018 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 480 flow. Second operand 3 states and 745 transitions. [2024-10-31 21:58:18,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 513 flow [2024-10-31 21:58:18,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 211 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:18,023 INFO L231 Difference]: Finished difference. Result has 216 places, 210 transitions, 478 flow [2024-10-31 21:58:18,023 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=216, PETRI_TRANSITIONS=210} [2024-10-31 21:58:18,024 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -27 predicate places. [2024-10-31 21:58:18,024 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 210 transitions, 478 flow [2024-10-31 21:58:18,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:18,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:18,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:18,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 21:58:18,025 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:18,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:18,026 INFO L85 PathProgramCache]: Analyzing trace with hash 432440363, now seen corresponding path program 1 times [2024-10-31 21:58:18,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:18,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096880649] [2024-10-31 21:58:18,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:18,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096880649] [2024-10-31 21:58:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096880649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723824618] [2024-10-31 21:58:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:18,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:18,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:18,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:18,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-31 21:58:18,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 210 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:18,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:18,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-31 21:58:18,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:18,269 INFO L124 PetriNetUnfolderBase]: 72/847 cut-off events. [2024-10-31 21:58:18,270 INFO L125 PetriNetUnfolderBase]: For 57/65 co-relation queries the response was YES. [2024-10-31 21:58:18,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 847 events. 72/847 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4553 event pairs, 24 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 804. Up to 95 conditions per place. [2024-10-31 21:58:18,276 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 1/210 dead transitions. [2024-10-31 21:58:18,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 210 transitions, 505 flow [2024-10-31 21:58:18,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-31 21:58:18,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-31 21:58:18,279 INFO L175 Difference]: Start difference. First operand has 216 places, 210 transitions, 478 flow. Second operand 3 states and 751 transitions. [2024-10-31 21:58:18,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 210 transitions, 505 flow [2024-10-31 21:58:18,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 210 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:18,285 INFO L231 Difference]: Finished difference. Result has 215 places, 209 transitions, 476 flow [2024-10-31 21:58:18,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=215, PETRI_TRANSITIONS=209} [2024-10-31 21:58:18,286 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -28 predicate places. [2024-10-31 21:58:18,286 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 476 flow [2024-10-31 21:58:18,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:18,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:58:18,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:18,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 21:58:18,288 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-10-31 21:58:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1556478479, now seen corresponding path program 1 times [2024-10-31 21:58:18,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:18,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956827363] [2024-10-31 21:58:18,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:58:18,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:18,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956827363] [2024-10-31 21:58:18,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956827363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:18,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:18,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:18,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685768626] [2024-10-31 21:58:18,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:18,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:18,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:18,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-10-31 21:58:18,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 209 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:18,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:58:18,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-10-31 21:58:18,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:58:18,561 INFO L124 PetriNetUnfolderBase]: 66/963 cut-off events. [2024-10-31 21:58:18,562 INFO L125 PetriNetUnfolderBase]: For 46/54 co-relation queries the response was YES. [2024-10-31 21:58:18,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 963 events. 66/963 cut-off events. For 46/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5652 event pairs, 16 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1151. Up to 68 conditions per place. [2024-10-31 21:58:18,567 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 0 selfloop transitions, 0 changer transitions 209/209 dead transitions. [2024-10-31 21:58:18,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 503 flow [2024-10-31 21:58:18,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:58:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-10-31 21:58:18,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-10-31 21:58:18,570 INFO L175 Difference]: Start difference. First operand has 215 places, 209 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-10-31 21:58:18,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 503 flow [2024-10-31 21:58:18,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 209 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:58:18,574 INFO L231 Difference]: Finished difference. Result has 214 places, 0 transitions, 0 flow [2024-10-31 21:58:18,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=214, PETRI_TRANSITIONS=0} [2024-10-31 21:58:18,575 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -29 predicate places. [2024-10-31 21:58:18,575 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 0 transitions, 0 flow [2024-10-31 21:58:18,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:58:18,578 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (54 of 55 remaining) [2024-10-31 21:58:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (53 of 55 remaining) [2024-10-31 21:58:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (52 of 55 remaining) [2024-10-31 21:58:18,579 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 55 remaining) [2024-10-31 21:58:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 55 remaining) [2024-10-31 21:58:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (49 of 55 remaining) [2024-10-31 21:58:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 55 remaining) [2024-10-31 21:58:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (47 of 55 remaining) [2024-10-31 21:58:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 55 remaining) [2024-10-31 21:58:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (45 of 55 remaining) [2024-10-31 21:58:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (44 of 55 remaining) [2024-10-31 21:58:18,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (43 of 55 remaining) [2024-10-31 21:58:18,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (42 of 55 remaining) [2024-10-31 21:58:18,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (41 of 55 remaining) [2024-10-31 21:58:18,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 55 remaining) [2024-10-31 21:58:18,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 55 remaining) [2024-10-31 21:58:18,581 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (38 of 55 remaining) [2024-10-31 21:58:18,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 55 remaining) [2024-10-31 21:58:18,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 55 remaining) [2024-10-31 21:58:18,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (35 of 55 remaining) [2024-10-31 21:58:18,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 55 remaining) [2024-10-31 21:58:18,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 55 remaining) [2024-10-31 21:58:18,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 55 remaining) [2024-10-31 21:58:18,582 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (31 of 55 remaining) [2024-10-31 21:58:18,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 55 remaining) [2024-10-31 21:58:18,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (29 of 55 remaining) [2024-10-31 21:58:18,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 55 remaining) [2024-10-31 21:58:18,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (27 of 55 remaining) [2024-10-31 21:58:18,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (26 of 55 remaining) [2024-10-31 21:58:18,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (25 of 55 remaining) [2024-10-31 21:58:18,583 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (24 of 55 remaining) [2024-10-31 21:58:18,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (23 of 55 remaining) [2024-10-31 21:58:18,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (22 of 55 remaining) [2024-10-31 21:58:18,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (21 of 55 remaining) [2024-10-31 21:58:18,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (20 of 55 remaining) [2024-10-31 21:58:18,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-10-31 21:58:18,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-10-31 21:58:18,584 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (13 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (10 of 55 remaining) [2024-10-31 21:58:18,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (9 of 55 remaining) [2024-10-31 21:58:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (8 of 55 remaining) [2024-10-31 21:58:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (7 of 55 remaining) [2024-10-31 21:58:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 55 remaining) [2024-10-31 21:58:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 55 remaining) [2024-10-31 21:58:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (4 of 55 remaining) [2024-10-31 21:58:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 55 remaining) [2024-10-31 21:58:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 55 remaining) [2024-10-31 21:58:18,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 55 remaining) [2024-10-31 21:58:18,587 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 55 remaining) [2024-10-31 21:58:18,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 21:58:18,587 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:18,594 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 21:58:18,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:58:18,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:58:18 BasicIcfg [2024-10-31 21:58:18,601 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:58:18,602 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:58:18,602 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:58:18,602 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:58:18,602 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:12" (3/4) ... [2024-10-31 21:58:18,605 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-10-31 21:58:18,609 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-31 21:58:18,609 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-31 21:58:18,623 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-31 21:58:18,623 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-31 21:58:18,624 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-31 21:58:18,624 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-31 21:58:18,757 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 21:58:18,758 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/witness.yml [2024-10-31 21:58:18,758 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:58:18,759 INFO L158 Benchmark]: Toolchain (without parser) took 7363.66ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 156.8MB in the beginning and 159.0MB in the end (delta: -2.2MB). Peak memory consumption was 38.6MB. Max. memory is 16.1GB. [2024-10-31 21:58:18,759 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 138.4MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:58:18,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.01ms. Allocated memory is still 199.2MB. Free memory was 156.8MB in the beginning and 143.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 21:58:18,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.86ms. Allocated memory is still 199.2MB. Free memory was 143.4MB in the beginning and 141.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:58:18,760 INFO L158 Benchmark]: Boogie Preprocessor took 36.58ms. Allocated memory is still 199.2MB. Free memory was 141.6MB in the beginning and 140.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:58:18,760 INFO L158 Benchmark]: RCFGBuilder took 722.49ms. Allocated memory is still 199.2MB. Free memory was 140.0MB in the beginning and 119.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-31 21:58:18,761 INFO L158 Benchmark]: TraceAbstraction took 6016.69ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 119.1MB in the beginning and 165.3MB in the end (delta: -46.2MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-10-31 21:58:18,761 INFO L158 Benchmark]: Witness Printer took 156.38ms. Allocated memory is still 239.1MB. Free memory was 165.3MB in the beginning and 159.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 21:58:18,765 INFO L338 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 138.4MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.01ms. Allocated memory is still 199.2MB. Free memory was 156.8MB in the beginning and 143.4MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.86ms. Allocated memory is still 199.2MB. Free memory was 143.4MB in the beginning and 141.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.58ms. Allocated memory is still 199.2MB. Free memory was 141.6MB in the beginning and 140.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 722.49ms. Allocated memory is still 199.2MB. Free memory was 140.0MB in the beginning and 119.5MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6016.69ms. Allocated memory was 199.2MB in the beginning and 239.1MB in the end (delta: 39.8MB). Free memory was 119.1MB in the beginning and 165.3MB in the end (delta: -46.2MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Witness Printer took 156.38ms. Allocated memory is still 239.1MB. Free memory was 165.3MB in the beginning and 159.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 348 locations, 55 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: 5.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 82 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1680 ConstructedInterpolants, 0 QuantifiedInterpolants, 1720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-31 21:58:18,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3280a2de-c8d7-4b9e-954e-eae48580f6ea/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE