/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 12:06:36,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 12:06:36,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 12:06:36,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 12:06:36,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 12:06:36,374 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 12:06:36,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 12:06:36,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 12:06:36,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 12:06:36,378 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 12:06:36,378 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 12:06:36,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 12:06:36,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 12:06:36,380 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 12:06:36,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 12:06:36,380 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 12:06:36,380 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 12:06:36,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 12:06:36,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 12:06:36,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 12:06:36,381 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 12:06:36,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 12:06:36,382 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 12:06:36,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 12:06:36,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 12:06:36,382 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 12:06:36,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 12:06:36,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 12:06:36,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 12:06:36,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 12:06:36,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 12:06:36,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 12:06:36,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 12:06:36,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 12:06:36,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 12:06:36,384 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 12:06:36,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 12:06:36,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 12:06:36,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 12:06:36,663 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 12:06:36,663 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 12:06:36,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-25 12:06:37,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 12:06:38,005 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 12:06:38,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.opt.i [2023-08-25 12:06:38,038 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211ebd37b/096b5cd0a3994161a40c92d916119370/FLAGb30985dd2 [2023-08-25 12:06:38,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/211ebd37b/096b5cd0a3994161a40c92d916119370 [2023-08-25 12:06:38,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 12:06:38,051 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 12:06:38,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 12:06:38,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 12:06:38,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 12:06:38,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f4cc04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38, skipping insertion in model container [2023-08-25 12:06:38,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 12:06:38,419 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 12:06:38,431 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 12:06:38,452 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-25 12:06:38,454 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-25 12:06:38,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 12:06:38,533 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 12:06:38,534 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 12:06:38,539 INFO L206 MainTranslator]: Completed translation [2023-08-25 12:06:38,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38 WrapperNode [2023-08-25 12:06:38,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 12:06:38,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 12:06:38,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 12:06:38,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 12:06:38,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,634 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 989 [2023-08-25 12:06:38,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 12:06:38,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 12:06:38,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 12:06:38,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 12:06:38,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,674 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 12:06:38,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 12:06:38,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 12:06:38,704 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 12:06:38,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (1/1) ... [2023-08-25 12:06:38,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 12:06:38,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 12:06:38,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 12:06:38,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 12:06:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 12:06:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 12:06:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 12:06:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 12:06:38,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 12:06:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-25 12:06:38,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-25 12:06:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-25 12:06:38,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-25 12:06:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-25 12:06:38,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-25 12:06:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-25 12:06:38,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-25 12:06:38,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 12:06:38,800 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 12:06:38,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 12:06:38,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 12:06:38,803 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 12:06:38,934 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 12:06:38,935 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 12:06:39,856 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 12:08:43,872 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 12:08:43,873 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-25 12:08:43,876 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 12:08:43 BoogieIcfgContainer [2023-08-25 12:08:43,876 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 12:08:43,877 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 12:08:43,877 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 12:08:43,880 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 12:08:43,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 12:06:38" (1/3) ... [2023-08-25 12:08:43,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c66c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 12:08:43, skipping insertion in model container [2023-08-25 12:08:43,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:06:38" (2/3) ... [2023-08-25 12:08:43,881 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3c66c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 12:08:43, skipping insertion in model container [2023-08-25 12:08:43,881 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 12:08:43" (3/3) ... [2023-08-25 12:08:43,882 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.opt.i [2023-08-25 12:08:43,894 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 12:08:43,895 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 230 error locations. [2023-08-25 12:08:43,895 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 12:08:47,985 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 12:08:48,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 377 places, 367 transitions, 754 flow [2023-08-25 12:08:53,640 INFO L124 PetriNetUnfolderBase]: 3/363 cut-off events. [2023-08-25 12:08:53,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:08:53,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 363 events. 3/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 1877 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 323. Up to 2 conditions per place. [2023-08-25 12:08:53,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 377 places, 367 transitions, 754 flow [2023-08-25 12:08:53,662 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 373 places, 363 transitions, 738 flow [2023-08-25 12:08:53,664 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 12:08:53,669 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 373 places, 363 transitions, 738 flow [2023-08-25 12:08:53,671 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 373 places, 363 transitions, 738 flow [2023-08-25 12:08:53,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 363 transitions, 738 flow [2023-08-25 12:08:58,605 INFO L124 PetriNetUnfolderBase]: 3/363 cut-off events. [2023-08-25 12:08:58,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:08:58,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 363 events. 3/363 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 1864 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 323. Up to 2 conditions per place. [2023-08-25 12:08:58,622 INFO L119 LiptonReduction]: Number of co-enabled transitions 53832 [2023-08-25 12:11:12,610 WARN L234 SmtUtils]: Spent 2.22m on a formula simplification. DAG size of input: 10230 DAG size of output: 1184 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:11:18,755 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 1083 DAG size of output: 1080 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:14:41,283 WARN L234 SmtUtils]: Spent 3.37m on a formula simplification. DAG size of input: 11614 DAG size of output: 1563 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:14:52,108 WARN L234 SmtUtils]: Spent 10.78s on a formula simplification. DAG size of input: 1435 DAG size of output: 1433 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:14:58,950 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 1083 DAG size of output: 1072 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:15:13,742 WARN L234 SmtUtils]: Spent 11.68s on a formula simplification. DAG size of input: 1436 DAG size of output: 1433 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:15:19,468 WARN L234 SmtUtils]: Spent 5.67s on a formula simplification that was a NOOP. DAG size: 1433 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:15:40,923 WARN L234 SmtUtils]: Spent 13.71s on a formula simplification. DAG size of input: 1436 DAG size of output: 1228 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:16:05,441 WARN L234 SmtUtils]: Spent 12.93s on a formula simplification. DAG size of input: 1436 DAG size of output: 1231 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:16:19,920 WARN L234 SmtUtils]: Spent 9.55s on a formula simplification. DAG size of input: 1087 DAG size of output: 1081 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:16:36,007 WARN L234 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 1448 DAG size of output: 1440 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:16:41,952 WARN L234 SmtUtils]: Spent 5.91s on a formula simplification that was a NOOP. DAG size: 1440 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:16:49,340 WARN L234 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 1087 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:16:56,618 WARN L234 SmtUtils]: Spent 7.24s on a formula simplification that was a NOOP. DAG size: 1085 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:17:20,995 WARN L234 SmtUtils]: Spent 24.36s on a formula simplification. DAG size of input: 1446 DAG size of output: 1443 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:17:32,889 WARN L234 SmtUtils]: Spent 11.82s on a formula simplification that was a NOOP. DAG size: 1441 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:17:33,819 INFO L134 LiptonReduction]: Checked pairs total: 513771 [2023-08-25 12:17:33,819 INFO L136 LiptonReduction]: Total number of compositions: 167 [2023-08-25 12:17:33,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 12:17:33,830 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@25c4c94, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 12:17:33,830 INFO L358 AbstractCegarLoop]: Starting to check reachability of 331 error locations. [2023-08-25 12:17:33,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 12:17:33,832 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-25 12:17:33,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:17:33,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:17:33,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-25 12:17:33,832 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONDATA_RACE === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:17:33,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:17:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash 5714452, now seen corresponding path program 1 times [2023-08-25 12:17:33,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:17:33,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736271253] [2023-08-25 12:17:33,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:17:33,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:17:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:17:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:17:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:17:34,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736271253] [2023-08-25 12:17:34,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736271253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:17:34,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:17:34,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 12:17:34,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15036229] [2023-08-25 12:17:34,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:17:34,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 12:17:34,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:17:34,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 12:17:34,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 12:17:34,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 534 [2023-08-25 12:17:34,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 256 transitions, 524 flow. Second operand has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:17:34,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:17:34,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 534 [2023-08-25 12:17:34,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:18:01,185 INFO L124 PetriNetUnfolderBase]: 8703/11704 cut-off events. [2023-08-25 12:18:01,185 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-08-25 12:18:01,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23616 conditions, 11704 events. 8703/11704 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 52737 event pairs, 8703 based on Foata normal form. 0/10744 useless extension candidates. Maximal degree in co-relation 23604. Up to 11705 conditions per place. [2023-08-25 12:18:01,220 INFO L140 encePairwiseOnDemand]: 306/534 looper letters, 28 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2023-08-25 12:18:01,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 124 flow [2023-08-25 12:18:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 12:18:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 12:18:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 482 transitions. [2023-08-25 12:18:01,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45131086142322097 [2023-08-25 12:18:01,230 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 482 transitions. [2023-08-25 12:18:01,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 482 transitions. [2023-08-25 12:18:01,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:18:01,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 482 transitions. [2023-08-25 12:18:01,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 241.0) internal successors, (482), 2 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:01,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:01,238 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 534.0) internal successors, (1602), 3 states have internal predecessors, (1602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:01,239 INFO L175 Difference]: Start difference. First operand has 269 places, 256 transitions, 524 flow. Second operand 2 states and 482 transitions. [2023-08-25 12:18:01,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 124 flow [2023-08-25 12:18:01,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 28 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 12:18:01,243 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 64 flow [2023-08-25 12:18:01,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-25 12:18:01,246 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -231 predicate places. [2023-08-25 12:18:01,246 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 64 flow [2023-08-25 12:18:01,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:01,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:18:01,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:18:01,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 12:18:01,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:18:01,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:18:01,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1325061821, now seen corresponding path program 1 times [2023-08-25 12:18:01,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:18:01,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671274020] [2023-08-25 12:18:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:18:01,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:18:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:18:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:18:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:18:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671274020] [2023-08-25 12:18:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671274020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:18:01,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:18:01,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 12:18:01,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22401243] [2023-08-25 12:18:01,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:18:01,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 12:18:01,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:18:01,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 12:18:01,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 12:18:01,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 534 [2023-08-25 12:18:01,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:01,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:18:01,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 534 [2023-08-25 12:18:01,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:18:24,604 INFO L124 PetriNetUnfolderBase]: 7463/10064 cut-off events. [2023-08-25 12:18:24,604 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:18:24,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20333 conditions, 10064 events. 7463/10064 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 45601 event pairs, 1263 based on Foata normal form. 0/9584 useless extension candidates. Maximal degree in co-relation 20330. Up to 8201 conditions per place. [2023-08-25 12:18:24,627 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 37 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-08-25 12:18:24,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 172 flow [2023-08-25 12:18:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 12:18:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 12:18:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-25 12:18:24,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23595505617977527 [2023-08-25 12:18:24,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-25 12:18:24,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-25 12:18:24,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:18:24,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-25 12:18:24,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:24,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:24,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:24,635 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 64 flow. Second operand 3 states and 378 transitions. [2023-08-25 12:18:24,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 172 flow [2023-08-25 12:18:24,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 12:18:24,635 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2023-08-25 12:18:24,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-25 12:18:24,636 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -230 predicate places. [2023-08-25 12:18:24,636 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 64 flow [2023-08-25 12:18:24,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:24,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:18:24,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:18:24,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 12:18:24,637 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:18:24,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:18:24,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2074381652, now seen corresponding path program 1 times [2023-08-25 12:18:24,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:18:24,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135992271] [2023-08-25 12:18:24,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:18:24,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:18:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:18:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:18:24,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:18:24,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135992271] [2023-08-25 12:18:24,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135992271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:18:24,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:18:24,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 12:18:24,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278376807] [2023-08-25 12:18:24,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:18:24,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 12:18:24,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:18:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 12:18:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 12:18:24,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 534 [2023-08-25 12:18:24,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:24,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:18:24,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 534 [2023-08-25 12:18:24,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:18:36,694 INFO L124 PetriNetUnfolderBase]: 5431/7392 cut-off events. [2023-08-25 12:18:36,694 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2023-08-25 12:18:36,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15231 conditions, 7392 events. 5431/7392 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 31539 event pairs, 1847 based on Foata normal form. 160/7552 useless extension candidates. Maximal degree in co-relation 15227. Up to 5105 conditions per place. [2023-08-25 12:18:36,710 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 36 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-25 12:18:36,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 164 flow [2023-08-25 12:18:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 12:18:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 12:18:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-25 12:18:36,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2340823970037453 [2023-08-25 12:18:36,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-25 12:18:36,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-25 12:18:36,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:18:36,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-25 12:18:36,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:36,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:36,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:36,716 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 64 flow. Second operand 3 states and 375 transitions. [2023-08-25 12:18:36,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 164 flow [2023-08-25 12:18:36,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 12:18:36,718 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 68 flow [2023-08-25 12:18:36,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-25 12:18:36,719 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -230 predicate places. [2023-08-25 12:18:36,719 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 68 flow [2023-08-25 12:18:36,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:36,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:18:36,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:18:36,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 12:18:36,720 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:18:36,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:18:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 628092069, now seen corresponding path program 1 times [2023-08-25 12:18:36,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:18:36,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641731473] [2023-08-25 12:18:36,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:18:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:18:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:18:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:18:38,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:18:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641731473] [2023-08-25 12:18:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641731473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:18:38,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:18:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:18:38,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624286263] [2023-08-25 12:18:38,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:18:38,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 12:18:38,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:18:38,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 12:18:38,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 12:18:38,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 534 [2023-08-25 12:18:38,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:38,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:18:38,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 534 [2023-08-25 12:18:38,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:18:49,013 INFO L124 PetriNetUnfolderBase]: 5207/7104 cut-off events. [2023-08-25 12:18:49,014 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-08-25 12:18:49,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15152 conditions, 7104 events. 5207/7104 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 30382 event pairs, 1127 based on Foata normal form. 64/7168 useless extension candidates. Maximal degree in co-relation 15147. Up to 5505 conditions per place. [2023-08-25 12:18:49,028 INFO L140 encePairwiseOnDemand]: 529/534 looper letters, 47 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2023-08-25 12:18:49,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 229 flow [2023-08-25 12:18:49,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:18:49,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:18:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-25 12:18:49,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.225187265917603 [2023-08-25 12:18:49,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-25 12:18:49,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-25 12:18:49,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:18:49,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-25 12:18:49,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:49,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:49,036 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:49,036 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 68 flow. Second operand 4 states and 481 transitions. [2023-08-25 12:18:49,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 229 flow [2023-08-25 12:18:49,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 12:18:49,045 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 96 flow [2023-08-25 12:18:49,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-25 12:18:49,046 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -227 predicate places. [2023-08-25 12:18:49,046 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 96 flow [2023-08-25 12:18:49,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:49,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:18:49,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:18:49,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 12:18:49,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:18:49,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:18:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash -464701359, now seen corresponding path program 1 times [2023-08-25 12:18:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:18:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962755067] [2023-08-25 12:18:49,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:18:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:18:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:18:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:18:49,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:18:49,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962755067] [2023-08-25 12:18:49,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962755067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:18:49,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:18:49,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 12:18:49,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29848499] [2023-08-25 12:18:49,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:18:49,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 12:18:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:18:49,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 12:18:49,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-25 12:18:49,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 534 [2023-08-25 12:18:49,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:18:49,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:18:49,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 534 [2023-08-25 12:18:49,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:19:02,865 INFO L124 PetriNetUnfolderBase]: 5703/7760 cut-off events. [2023-08-25 12:19:02,866 INFO L125 PetriNetUnfolderBase]: For 1136/1136 co-relation queries the response was YES. [2023-08-25 12:19:02,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 7760 events. 5703/7760 cut-off events. For 1136/1136 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 33551 event pairs, 959 based on Foata normal form. 32/7792 useless extension candidates. Maximal degree in co-relation 17883. Up to 5929 conditions per place. [2023-08-25 12:19:02,883 INFO L140 encePairwiseOnDemand]: 527/534 looper letters, 56 selfloop transitions, 9 changer transitions 0/65 dead transitions. [2023-08-25 12:19:02,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 303 flow [2023-08-25 12:19:02,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 12:19:02,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 12:19:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 603 transitions. [2023-08-25 12:19:02,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2258426966292135 [2023-08-25 12:19:02,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 603 transitions. [2023-08-25 12:19:02,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 603 transitions. [2023-08-25 12:19:02,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:19:02,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 603 transitions. [2023-08-25 12:19:02,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:02,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:02,892 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:02,892 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 96 flow. Second operand 5 states and 603 transitions. [2023-08-25 12:19:02,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 303 flow [2023-08-25 12:19:02,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 65 transitions, 303 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 12:19:02,896 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 145 flow [2023-08-25 12:19:02,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-25 12:19:02,897 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -221 predicate places. [2023-08-25 12:19:02,897 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 145 flow [2023-08-25 12:19:02,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:02,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:19:02,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:19:02,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 12:19:02,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:19:02,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:19:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash -218031879, now seen corresponding path program 2 times [2023-08-25 12:19:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:19:02,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255779161] [2023-08-25 12:19:02,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:19:02,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:19:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:19:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:19:04,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:19:04,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255779161] [2023-08-25 12:19:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255779161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:19:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:19:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 12:19:04,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511574209] [2023-08-25 12:19:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:19:04,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 12:19:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:19:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 12:19:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-25 12:19:04,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 534 [2023-08-25 12:19:04,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:04,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:19:04,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 534 [2023-08-25 12:19:04,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:19:17,475 INFO L124 PetriNetUnfolderBase]: 6359/8672 cut-off events. [2023-08-25 12:19:17,475 INFO L125 PetriNetUnfolderBase]: For 4160/4160 co-relation queries the response was YES. [2023-08-25 12:19:17,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22470 conditions, 8672 events. 6359/8672 cut-off events. For 4160/4160 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38629 event pairs, 519 based on Foata normal form. 96/8768 useless extension candidates. Maximal degree in co-relation 22460. Up to 4161 conditions per place. [2023-08-25 12:19:17,534 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 60 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2023-08-25 12:19:17,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 376 flow [2023-08-25 12:19:17,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 12:19:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 12:19:17,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-08-25 12:19:17,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22284644194756553 [2023-08-25 12:19:17,540 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-08-25 12:19:17,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-08-25 12:19:17,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:19:17,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-08-25 12:19:17,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:17,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:17,545 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:17,545 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 145 flow. Second operand 5 states and 595 transitions. [2023-08-25 12:19:17,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 376 flow [2023-08-25 12:19:17,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 367 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-25 12:19:17,574 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 182 flow [2023-08-25 12:19:17,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-25 12:19:17,576 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -217 predicate places. [2023-08-25 12:19:17,576 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 182 flow [2023-08-25 12:19:17,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:17,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:19:17,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:19:17,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 12:19:17,577 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:19:17,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:19:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash -717675186, now seen corresponding path program 1 times [2023-08-25 12:19:17,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:19:17,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943926624] [2023-08-25 12:19:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:19:17,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:19:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:19:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:19:18,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:19:18,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943926624] [2023-08-25 12:19:18,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943926624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:19:18,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:19:18,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 12:19:18,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506870627] [2023-08-25 12:19:18,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:19:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 12:19:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:19:18,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 12:19:18,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 12:19:18,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 534 [2023-08-25 12:19:18,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:18,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:19:18,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 534 [2023-08-25 12:19:18,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:19:27,447 INFO L124 PetriNetUnfolderBase]: 4244/6026 cut-off events. [2023-08-25 12:19:27,448 INFO L125 PetriNetUnfolderBase]: For 6224/6224 co-relation queries the response was YES. [2023-08-25 12:19:27,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16733 conditions, 6026 events. 4244/6026 cut-off events. For 6224/6224 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 28224 event pairs, 955 based on Foata normal form. 234/6260 useless extension candidates. Maximal degree in co-relation 16722. Up to 5079 conditions per place. [2023-08-25 12:19:27,462 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 63 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2023-08-25 12:19:27,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 466 flow [2023-08-25 12:19:27,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 12:19:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 12:19:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-25 12:19:27,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2397003745318352 [2023-08-25 12:19:27,474 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-25 12:19:27,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-25 12:19:27,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:19:27,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-25 12:19:27,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:27,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:27,477 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 534.0) internal successors, (2136), 4 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:27,477 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 182 flow. Second operand 3 states and 384 transitions. [2023-08-25 12:19:27,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 466 flow [2023-08-25 12:19:27,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 425 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-25 12:19:27,487 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 191 flow [2023-08-25 12:19:27,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-25 12:19:27,488 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -217 predicate places. [2023-08-25 12:19:27,488 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 191 flow [2023-08-25 12:19:27,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:27,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:19:27,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:19:27,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 12:19:27,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:19:27,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:19:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -684027177, now seen corresponding path program 1 times [2023-08-25 12:19:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:19:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080746042] [2023-08-25 12:19:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:19:27,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:19:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:19:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:19:27,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:19:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080746042] [2023-08-25 12:19:27,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080746042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:19:27,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:19:27,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:19:27,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052938405] [2023-08-25 12:19:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:19:27,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 12:19:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:19:27,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 12:19:27,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 12:19:27,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 534 [2023-08-25 12:19:27,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:27,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:19:27,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 534 [2023-08-25 12:19:27,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:19:33,185 INFO L124 PetriNetUnfolderBase]: 2351/3500 cut-off events. [2023-08-25 12:19:33,185 INFO L125 PetriNetUnfolderBase]: For 2489/2489 co-relation queries the response was YES. [2023-08-25 12:19:33,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10319 conditions, 3500 events. 2351/3500 cut-off events. For 2489/2489 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15984 event pairs, 610 based on Foata normal form. 264/3764 useless extension candidates. Maximal degree in co-relation 10308. Up to 1451 conditions per place. [2023-08-25 12:19:33,194 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 88 selfloop transitions, 9 changer transitions 0/97 dead transitions. [2023-08-25 12:19:33,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 97 transitions, 641 flow [2023-08-25 12:19:33,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:19:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:19:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-08-25 12:19:33,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24110486891385768 [2023-08-25 12:19:33,199 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-08-25 12:19:33,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-08-25 12:19:33,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:19:33,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-08-25 12:19:33,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:33,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:33,215 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:33,215 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 191 flow. Second operand 4 states and 515 transitions. [2023-08-25 12:19:33,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 97 transitions, 641 flow [2023-08-25 12:19:33,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 97 transitions, 636 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 12:19:33,221 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 238 flow [2023-08-25 12:19:33,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=238, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-25 12:19:33,221 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -214 predicate places. [2023-08-25 12:19:33,222 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 238 flow [2023-08-25 12:19:33,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:33,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:19:33,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:19:33,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 12:19:33,222 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:19:33,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:19:33,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1274601651, now seen corresponding path program 1 times [2023-08-25 12:19:33,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:19:33,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982962199] [2023-08-25 12:19:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:19:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:19:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:19:33,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:19:33,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:19:33,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982962199] [2023-08-25 12:19:33,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982962199] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:19:33,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:19:33,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:19:33,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143086235] [2023-08-25 12:19:33,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:19:33,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 12:19:33,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:19:33,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 12:19:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 12:19:33,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 534 [2023-08-25 12:19:33,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:33,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:19:33,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 534 [2023-08-25 12:19:33,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:19:40,698 INFO L124 PetriNetUnfolderBase]: 3004/4518 cut-off events. [2023-08-25 12:19:40,699 INFO L125 PetriNetUnfolderBase]: For 6147/6147 co-relation queries the response was YES. [2023-08-25 12:19:40,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14701 conditions, 4518 events. 3004/4518 cut-off events. For 6147/6147 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 22780 event pairs, 366 based on Foata normal form. 53/4571 useless extension candidates. Maximal degree in co-relation 14689. Up to 2785 conditions per place. [2023-08-25 12:19:40,708 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 87 selfloop transitions, 2 changer transitions 20/109 dead transitions. [2023-08-25 12:19:40,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 109 transitions, 803 flow [2023-08-25 12:19:40,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:19:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:19:40,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-25 12:19:40,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23642322097378277 [2023-08-25 12:19:40,714 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-25 12:19:40,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-25 12:19:40,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:19:40,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-25 12:19:40,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:40,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:40,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:40,717 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 238 flow. Second operand 4 states and 505 transitions. [2023-08-25 12:19:40,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 109 transitions, 803 flow [2023-08-25 12:19:40,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 757 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-25 12:19:40,727 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 233 flow [2023-08-25 12:19:40,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-25 12:19:40,728 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -211 predicate places. [2023-08-25 12:19:40,728 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 233 flow [2023-08-25 12:19:40,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:40,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:19:40,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:19:40,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 12:19:40,728 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:19:40,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:19:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash -998707649, now seen corresponding path program 2 times [2023-08-25 12:19:40,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:19:40,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708271467] [2023-08-25 12:19:40,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:19:40,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:19:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:19:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:19:41,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:19:41,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708271467] [2023-08-25 12:19:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708271467] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:19:41,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:19:41,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 12:19:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227899249] [2023-08-25 12:19:41,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:19:41,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 12:19:41,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:19:41,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 12:19:41,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-25 12:19:41,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 534 [2023-08-25 12:19:41,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:41,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:19:41,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 534 [2023-08-25 12:19:41,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:19:46,266 INFO L124 PetriNetUnfolderBase]: 2245/3367 cut-off events. [2023-08-25 12:19:46,266 INFO L125 PetriNetUnfolderBase]: For 4425/4425 co-relation queries the response was YES. [2023-08-25 12:19:46,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10687 conditions, 3367 events. 2245/3367 cut-off events. For 4425/4425 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15865 event pairs, 617 based on Foata normal form. 158/3525 useless extension candidates. Maximal degree in co-relation 10673. Up to 1368 conditions per place. [2023-08-25 12:19:46,274 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 97 selfloop transitions, 13 changer transitions 7/117 dead transitions. [2023-08-25 12:19:46,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 804 flow [2023-08-25 12:19:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 12:19:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 12:19:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-25 12:19:46,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24119850187265918 [2023-08-25 12:19:46,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-25 12:19:46,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-25 12:19:46,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:19:46,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-25 12:19:46,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:46,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:46,290 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 534.0) internal successors, (3204), 6 states have internal predecessors, (3204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:46,290 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 233 flow. Second operand 5 states and 644 transitions. [2023-08-25 12:19:46,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 117 transitions, 804 flow [2023-08-25 12:19:46,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 117 transitions, 800 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 12:19:46,296 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 295 flow [2023-08-25 12:19:46,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=295, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2023-08-25 12:19:46,297 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -207 predicate places. [2023-08-25 12:19:46,297 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 295 flow [2023-08-25 12:19:46,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:46,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:19:46,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:19:46,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 12:19:46,298 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:19:46,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:19:46,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1618821373, now seen corresponding path program 1 times [2023-08-25 12:19:46,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:19:46,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640982745] [2023-08-25 12:19:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:19:46,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:19:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:19:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:19:46,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:19:46,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640982745] [2023-08-25 12:19:46,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640982745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:19:46,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:19:46,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:19:46,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367945299] [2023-08-25 12:19:46,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:19:46,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 12:19:46,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:19:46,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 12:19:46,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 12:19:46,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 534 [2023-08-25 12:19:46,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:46,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:19:46,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 534 [2023-08-25 12:19:46,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:19:53,728 INFO L124 PetriNetUnfolderBase]: 3029/4621 cut-off events. [2023-08-25 12:19:53,728 INFO L125 PetriNetUnfolderBase]: For 9567/9567 co-relation queries the response was YES. [2023-08-25 12:19:53,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16615 conditions, 4621 events. 3029/4621 cut-off events. For 9567/9567 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 24849 event pairs, 277 based on Foata normal form. 11/4632 useless extension candidates. Maximal degree in co-relation 16600. Up to 2528 conditions per place. [2023-08-25 12:19:53,738 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 83 selfloop transitions, 2 changer transitions 40/125 dead transitions. [2023-08-25 12:19:53,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 125 transitions, 1015 flow [2023-08-25 12:19:53,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:19:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:19:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-25 12:19:53,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23782771535580524 [2023-08-25 12:19:53,740 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-25 12:19:53,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-25 12:19:53,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:19:53,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-25 12:19:53,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:53,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:53,744 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:53,744 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 295 flow. Second operand 4 states and 508 transitions. [2023-08-25 12:19:53,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 125 transitions, 1015 flow [2023-08-25 12:19:53,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 125 transitions, 925 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-08-25 12:19:53,768 INFO L231 Difference]: Finished difference. Result has 64 places, 50 transitions, 274 flow [2023-08-25 12:19:53,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2023-08-25 12:19:53,769 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -205 predicate places. [2023-08-25 12:19:53,769 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 274 flow [2023-08-25 12:19:53,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:53,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:19:53,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:19:53,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 12:19:53,769 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:19:53,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:19:53,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1480113365, now seen corresponding path program 2 times [2023-08-25 12:19:53,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:19:53,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419946679] [2023-08-25 12:19:53,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:19:53,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:19:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:19:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:19:54,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:19:54,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419946679] [2023-08-25 12:19:54,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419946679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:19:54,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:19:54,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 12:19:54,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836234106] [2023-08-25 12:19:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:19:54,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 12:19:54,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:19:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 12:19:54,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 12:19:54,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 534 [2023-08-25 12:19:54,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:19:54,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:19:54,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 534 [2023-08-25 12:19:54,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:20:00,934 INFO L124 PetriNetUnfolderBase]: 2908/4372 cut-off events. [2023-08-25 12:20:00,935 INFO L125 PetriNetUnfolderBase]: For 7368/7368 co-relation queries the response was YES. [2023-08-25 12:20:00,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15248 conditions, 4372 events. 2908/4372 cut-off events. For 7368/7368 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22384 event pairs, 680 based on Foata normal form. 55/4427 useless extension candidates. Maximal degree in co-relation 15231. Up to 1856 conditions per place. [2023-08-25 12:20:00,943 INFO L140 encePairwiseOnDemand]: 528/534 looper letters, 71 selfloop transitions, 17 changer transitions 32/120 dead transitions. [2023-08-25 12:20:00,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 120 transitions, 858 flow [2023-08-25 12:20:00,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 12:20:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 12:20:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 756 transitions. [2023-08-25 12:20:00,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23595505617977527 [2023-08-25 12:20:00,946 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 756 transitions. [2023-08-25 12:20:00,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 756 transitions. [2023-08-25 12:20:00,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:20:00,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 756 transitions. [2023-08-25 12:20:00,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:00,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 534.0) internal successors, (3738), 7 states have internal predecessors, (3738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:00,951 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 534.0) internal successors, (3738), 7 states have internal predecessors, (3738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:00,951 INFO L175 Difference]: Start difference. First operand has 64 places, 50 transitions, 274 flow. Second operand 6 states and 756 transitions. [2023-08-25 12:20:00,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 120 transitions, 858 flow [2023-08-25 12:20:01,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 120 transitions, 837 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-25 12:20:01,004 INFO L231 Difference]: Finished difference. Result has 68 places, 48 transitions, 295 flow [2023-08-25 12:20:01,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=68, PETRI_TRANSITIONS=48} [2023-08-25 12:20:01,005 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -201 predicate places. [2023-08-25 12:20:01,005 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 295 flow [2023-08-25 12:20:01,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.66666666666667) internal successors, (694), 6 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:01,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:20:01,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:20:01,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 12:20:01,006 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:20:01,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:20:01,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1377490579, now seen corresponding path program 1 times [2023-08-25 12:20:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:20:01,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17109460] [2023-08-25 12:20:01,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:20:01,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:20:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:20:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 12:20:01,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:20:01,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17109460] [2023-08-25 12:20:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17109460] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:20:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:20:01,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:20:01,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406367771] [2023-08-25 12:20:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:20:01,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 12:20:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:20:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 12:20:01,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 12:20:01,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 534 [2023-08-25 12:20:01,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:01,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:20:01,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 534 [2023-08-25 12:20:01,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:20:06,435 INFO L124 PetriNetUnfolderBase]: 1984/3130 cut-off events. [2023-08-25 12:20:06,435 INFO L125 PetriNetUnfolderBase]: For 6572/6572 co-relation queries the response was YES. [2023-08-25 12:20:06,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11632 conditions, 3130 events. 1984/3130 cut-off events. For 6572/6572 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16137 event pairs, 273 based on Foata normal form. 1/3131 useless extension candidates. Maximal degree in co-relation 11615. Up to 1784 conditions per place. [2023-08-25 12:20:06,442 INFO L140 encePairwiseOnDemand]: 531/534 looper letters, 51 selfloop transitions, 1 changer transitions 52/104 dead transitions. [2023-08-25 12:20:06,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 865 flow [2023-08-25 12:20:06,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:20:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:20:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2023-08-25 12:20:06,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23361423220973782 [2023-08-25 12:20:06,447 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions. [2023-08-25 12:20:06,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions. [2023-08-25 12:20:06,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:20:06,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions. [2023-08-25 12:20:06,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:06,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:06,450 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 534.0) internal successors, (2670), 5 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:06,450 INFO L175 Difference]: Start difference. First operand has 68 places, 48 transitions, 295 flow. Second operand 4 states and 499 transitions. [2023-08-25 12:20:06,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 865 flow [2023-08-25 12:20:06,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 104 transitions, 748 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-25 12:20:06,472 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 208 flow [2023-08-25 12:20:06,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=534, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2023-08-25 12:20:06,472 INFO L281 CegarLoopForPetriNet]: 269 programPoint places, -204 predicate places. [2023-08-25 12:20:06,472 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 208 flow [2023-08-25 12:20:06,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:20:06,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:20:06,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:20:06,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 12:20:06,473 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr132ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 327 more)] === [2023-08-25 12:20:06,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:20:06,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1184422981, now seen corresponding path program 2 times [2023-08-25 12:20:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:20:06,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348766210] [2023-08-25 12:20:06,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:20:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:20:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 12:20:06,773 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 12:20:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 12:20:07,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 12:20:07,019 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 12:20:07,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONASSERT (330 of 331 remaining) [2023-08-25 12:20:07,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (329 of 331 remaining) [2023-08-25 12:20:07,021 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (328 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (327 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (326 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (325 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (324 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (323 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (322 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (321 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (320 of 331 remaining) [2023-08-25 12:20:07,023 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONDATA_RACE (319 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONDATA_RACE (318 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONDATA_RACE (317 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONDATA_RACE (316 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONDATA_RACE (315 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONDATA_RACE (314 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6ASSERT_VIOLATIONDATA_RACE (313 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8ASSERT_VIOLATIONDATA_RACE (312 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7ASSERT_VIOLATIONDATA_RACE (311 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9ASSERT_VIOLATIONDATA_RACE (310 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10ASSERT_VIOLATIONDATA_RACE (309 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11ASSERT_VIOLATIONDATA_RACE (308 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12ASSERT_VIOLATIONDATA_RACE (307 of 331 remaining) [2023-08-25 12:20:07,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13ASSERT_VIOLATIONDATA_RACE (306 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14ASSERT_VIOLATIONDATA_RACE (305 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15ASSERT_VIOLATIONDATA_RACE (304 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16ASSERT_VIOLATIONDATA_RACE (303 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17ASSERT_VIOLATIONDATA_RACE (302 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18ASSERT_VIOLATIONDATA_RACE (301 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19ASSERT_VIOLATIONDATA_RACE (300 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err20ASSERT_VIOLATIONDATA_RACE (299 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err21ASSERT_VIOLATIONDATA_RACE (298 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err22ASSERT_VIOLATIONDATA_RACE (297 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err23ASSERT_VIOLATIONDATA_RACE (296 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err24ASSERT_VIOLATIONDATA_RACE (295 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err25ASSERT_VIOLATIONDATA_RACE (294 of 331 remaining) [2023-08-25 12:20:07,025 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err26ASSERT_VIOLATIONDATA_RACE (293 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err27ASSERT_VIOLATIONDATA_RACE (292 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err28ASSERT_VIOLATIONDATA_RACE (291 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err29ASSERT_VIOLATIONDATA_RACE (290 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err30ASSERT_VIOLATIONDATA_RACE (289 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err31ASSERT_VIOLATIONDATA_RACE (288 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONDATA_RACE (287 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONDATA_RACE (286 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONDATA_RACE (285 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3ASSERT_VIOLATIONDATA_RACE (284 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4ASSERT_VIOLATIONDATA_RACE (283 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5ASSERT_VIOLATIONDATA_RACE (282 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6ASSERT_VIOLATIONDATA_RACE (281 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7ASSERT_VIOLATIONDATA_RACE (280 of 331 remaining) [2023-08-25 12:20:07,026 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8ASSERT_VIOLATIONASSERT (279 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9ASSERT_VIOLATIONDATA_RACE (278 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10ASSERT_VIOLATIONDATA_RACE (277 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11ASSERT_VIOLATIONDATA_RACE (276 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12ASSERT_VIOLATIONDATA_RACE (275 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13ASSERT_VIOLATIONDATA_RACE (274 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14ASSERT_VIOLATIONDATA_RACE (273 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15ASSERT_VIOLATIONDATA_RACE (272 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16ASSERT_VIOLATIONDATA_RACE (271 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17ASSERT_VIOLATIONDATA_RACE (270 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18ASSERT_VIOLATIONDATA_RACE (269 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19ASSERT_VIOLATIONDATA_RACE (268 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err20ASSERT_VIOLATIONDATA_RACE (267 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err21ASSERT_VIOLATIONDATA_RACE (266 of 331 remaining) [2023-08-25 12:20:07,027 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err22ASSERT_VIOLATIONDATA_RACE (265 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err23ASSERT_VIOLATIONDATA_RACE (264 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err24ASSERT_VIOLATIONDATA_RACE (263 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err25ASSERT_VIOLATIONDATA_RACE (262 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err26ASSERT_VIOLATIONDATA_RACE (261 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err28ASSERT_VIOLATIONDATA_RACE (260 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err27ASSERT_VIOLATIONDATA_RACE (259 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err29ASSERT_VIOLATIONDATA_RACE (258 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err31ASSERT_VIOLATIONDATA_RACE (257 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err30ASSERT_VIOLATIONDATA_RACE (256 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err32ASSERT_VIOLATIONDATA_RACE (255 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err33ASSERT_VIOLATIONDATA_RACE (254 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err34ASSERT_VIOLATIONDATA_RACE (253 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err35ASSERT_VIOLATIONDATA_RACE (252 of 331 remaining) [2023-08-25 12:20:07,028 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err36ASSERT_VIOLATIONDATA_RACE (251 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err37ASSERT_VIOLATIONDATA_RACE (250 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err38ASSERT_VIOLATIONDATA_RACE (249 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err39ASSERT_VIOLATIONDATA_RACE (248 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err40ASSERT_VIOLATIONDATA_RACE (247 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err41ASSERT_VIOLATIONDATA_RACE (246 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err42ASSERT_VIOLATIONDATA_RACE (245 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err43ASSERT_VIOLATIONDATA_RACE (244 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err44ASSERT_VIOLATIONDATA_RACE (243 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err45ASSERT_VIOLATIONDATA_RACE (242 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err46ASSERT_VIOLATIONDATA_RACE (241 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err47ASSERT_VIOLATIONDATA_RACE (240 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err48ASSERT_VIOLATIONDATA_RACE (239 of 331 remaining) [2023-08-25 12:20:07,029 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err49ASSERT_VIOLATIONDATA_RACE (238 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err50ASSERT_VIOLATIONDATA_RACE (237 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err51ASSERT_VIOLATIONDATA_RACE (236 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err52ASSERT_VIOLATIONDATA_RACE (235 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err53ASSERT_VIOLATIONDATA_RACE (234 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err54ASSERT_VIOLATIONDATA_RACE (233 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (232 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (231 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (230 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (229 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (228 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (227 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (226 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (225 of 331 remaining) [2023-08-25 12:20:07,030 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (224 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (223 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (222 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (221 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (220 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (219 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (218 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (217 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (216 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (215 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (214 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (213 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (212 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (211 of 331 remaining) [2023-08-25 12:20:07,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (210 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (209 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (208 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (207 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (206 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (205 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (204 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (203 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (202 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (201 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (200 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (199 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (198 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (197 of 331 remaining) [2023-08-25 12:20:07,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (196 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (195 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (194 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (193 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (192 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (191 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (190 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (189 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (188 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (187 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (186 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (185 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (184 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (183 of 331 remaining) [2023-08-25 12:20:07,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (182 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (181 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (180 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (179 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (178 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (177 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (176 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (175 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (174 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (173 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (172 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (171 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (170 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (169 of 331 remaining) [2023-08-25 12:20:07,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (168 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (167 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (166 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (165 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (164 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (163 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (162 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (161 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (160 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (159 of 331 remaining) [2023-08-25 12:20:07,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (158 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (157 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (156 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (155 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (154 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (153 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (152 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (151 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (150 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (149 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (148 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (147 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (146 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (145 of 331 remaining) [2023-08-25 12:20:07,037 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (144 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (143 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (142 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (141 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (140 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (139 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (138 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (137 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (136 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (135 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (134 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (133 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (132 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (131 of 331 remaining) [2023-08-25 12:20:07,038 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (130 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (129 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (128 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (127 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (126 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (125 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (124 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (123 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (122 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (121 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (120 of 331 remaining) [2023-08-25 12:20:07,039 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (119 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (118 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (117 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (116 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (115 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (114 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (113 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (112 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (111 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (110 of 331 remaining) [2023-08-25 12:20:07,040 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (109 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (108 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (107 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (106 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (105 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (104 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (103 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (102 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131ASSERT_VIOLATIONDATA_RACE (101 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (98 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (97 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (96 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (95 of 331 remaining) [2023-08-25 12:20:07,041 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (94 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (93 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (92 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (91 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (90 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (89 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (88 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (87 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONDATA_RACE (86 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONDATA_RACE (85 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONDATA_RACE (84 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONDATA_RACE (83 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONDATA_RACE (82 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONDATA_RACE (81 of 331 remaining) [2023-08-25 12:20:07,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6ASSERT_VIOLATIONDATA_RACE (80 of 331 remaining) [2023-08-25 12:20:07,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8ASSERT_VIOLATIONDATA_RACE (79 of 331 remaining) [2023-08-25 12:20:07,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7ASSERT_VIOLATIONDATA_RACE (78 of 331 remaining) [2023-08-25 12:20:07,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9ASSERT_VIOLATIONDATA_RACE (77 of 331 remaining) [2023-08-25 12:20:07,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10ASSERT_VIOLATIONDATA_RACE (76 of 331 remaining) [2023-08-25 12:20:07,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11ASSERT_VIOLATIONDATA_RACE (75 of 331 remaining) [2023-08-25 12:20:07,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12ASSERT_VIOLATIONDATA_RACE (74 of 331 remaining) [2023-08-25 12:20:07,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13ASSERT_VIOLATIONDATA_RACE (73 of 331 remaining) [2023-08-25 12:20:07,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14ASSERT_VIOLATIONDATA_RACE (72 of 331 remaining) [2023-08-25 12:20:07,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15ASSERT_VIOLATIONDATA_RACE (71 of 331 remaining) [2023-08-25 12:20:07,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16ASSERT_VIOLATIONDATA_RACE (70 of 331 remaining) [2023-08-25 12:20:07,045 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17ASSERT_VIOLATIONDATA_RACE (69 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18ASSERT_VIOLATIONDATA_RACE (68 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19ASSERT_VIOLATIONDATA_RACE (67 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err20ASSERT_VIOLATIONDATA_RACE (66 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err21ASSERT_VIOLATIONDATA_RACE (65 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err22ASSERT_VIOLATIONDATA_RACE (64 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err23ASSERT_VIOLATIONDATA_RACE (63 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err24ASSERT_VIOLATIONDATA_RACE (62 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err25ASSERT_VIOLATIONDATA_RACE (61 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err26ASSERT_VIOLATIONDATA_RACE (60 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err27ASSERT_VIOLATIONDATA_RACE (59 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err28ASSERT_VIOLATIONDATA_RACE (58 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err29ASSERT_VIOLATIONDATA_RACE (57 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err30ASSERT_VIOLATIONDATA_RACE (56 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err31ASSERT_VIOLATIONDATA_RACE (55 of 331 remaining) [2023-08-25 12:20:07,046 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONDATA_RACE (54 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONDATA_RACE (53 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONDATA_RACE (52 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3ASSERT_VIOLATIONDATA_RACE (51 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4ASSERT_VIOLATIONDATA_RACE (50 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5ASSERT_VIOLATIONDATA_RACE (49 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6ASSERT_VIOLATIONDATA_RACE (48 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7ASSERT_VIOLATIONDATA_RACE (47 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8ASSERT_VIOLATIONASSERT (46 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9ASSERT_VIOLATIONDATA_RACE (45 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10ASSERT_VIOLATIONDATA_RACE (44 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11ASSERT_VIOLATIONDATA_RACE (43 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12ASSERT_VIOLATIONDATA_RACE (42 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13ASSERT_VIOLATIONDATA_RACE (41 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14ASSERT_VIOLATIONDATA_RACE (40 of 331 remaining) [2023-08-25 12:20:07,047 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15ASSERT_VIOLATIONDATA_RACE (39 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16ASSERT_VIOLATIONDATA_RACE (38 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17ASSERT_VIOLATIONDATA_RACE (37 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18ASSERT_VIOLATIONDATA_RACE (36 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19ASSERT_VIOLATIONDATA_RACE (35 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err20ASSERT_VIOLATIONDATA_RACE (34 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err21ASSERT_VIOLATIONDATA_RACE (33 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err22ASSERT_VIOLATIONDATA_RACE (32 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err23ASSERT_VIOLATIONDATA_RACE (31 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err24ASSERT_VIOLATIONDATA_RACE (30 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err25ASSERT_VIOLATIONDATA_RACE (29 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err26ASSERT_VIOLATIONDATA_RACE (28 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err28ASSERT_VIOLATIONDATA_RACE (27 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err27ASSERT_VIOLATIONDATA_RACE (26 of 331 remaining) [2023-08-25 12:20:07,048 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err29ASSERT_VIOLATIONDATA_RACE (25 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err31ASSERT_VIOLATIONDATA_RACE (24 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err30ASSERT_VIOLATIONDATA_RACE (23 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err32ASSERT_VIOLATIONDATA_RACE (22 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err33ASSERT_VIOLATIONDATA_RACE (21 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err34ASSERT_VIOLATIONDATA_RACE (20 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err35ASSERT_VIOLATIONDATA_RACE (19 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err36ASSERT_VIOLATIONDATA_RACE (18 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err37ASSERT_VIOLATIONDATA_RACE (17 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err38ASSERT_VIOLATIONDATA_RACE (16 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err39ASSERT_VIOLATIONDATA_RACE (15 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err40ASSERT_VIOLATIONDATA_RACE (14 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err41ASSERT_VIOLATIONDATA_RACE (13 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err42ASSERT_VIOLATIONDATA_RACE (12 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err43ASSERT_VIOLATIONDATA_RACE (11 of 331 remaining) [2023-08-25 12:20:07,049 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err44ASSERT_VIOLATIONDATA_RACE (10 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err45ASSERT_VIOLATIONDATA_RACE (9 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err46ASSERT_VIOLATIONDATA_RACE (8 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err47ASSERT_VIOLATIONDATA_RACE (7 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err48ASSERT_VIOLATIONDATA_RACE (6 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err49ASSERT_VIOLATIONDATA_RACE (5 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err50ASSERT_VIOLATIONDATA_RACE (4 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err51ASSERT_VIOLATIONDATA_RACE (3 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err52ASSERT_VIOLATIONDATA_RACE (2 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err53ASSERT_VIOLATIONDATA_RACE (1 of 331 remaining) [2023-08-25 12:20:07,050 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err54ASSERT_VIOLATIONDATA_RACE (0 of 331 remaining) [2023-08-25 12:20:07,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 12:20:07,050 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-25 12:20:07,062 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 12:20:07,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 12:20:07,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 12:20:07 BasicIcfg [2023-08-25 12:20:07,134 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 12:20:07,134 INFO L158 Benchmark]: Toolchain (without parser) took 809083.09ms. Allocated memory was 423.6MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 398.5MB in the beginning and 5.8GB in the end (delta: -5.4GB). Peak memory consumption was 4.5GB. Max. memory is 16.0GB. [2023-08-25 12:20:07,135 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 423.6MB. Free memory was 399.8MB in the beginning and 399.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 12:20:07,135 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.23ms. Allocated memory is still 423.6MB. Free memory was 398.0MB in the beginning and 371.5MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-25 12:20:07,135 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.49ms. Allocated memory is still 423.6MB. Free memory was 371.5MB in the beginning and 366.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 12:20:07,135 INFO L158 Benchmark]: Boogie Preprocessor took 68.05ms. Allocated memory is still 423.6MB. Free memory was 366.8MB in the beginning and 362.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 12:20:07,135 INFO L158 Benchmark]: RCFGBuilder took 125172.23ms. Allocated memory was 423.6MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 362.6MB in the beginning and 5.5GB in the end (delta: -5.1GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-25 12:20:07,135 INFO L158 Benchmark]: TraceAbstraction took 683256.82ms. Allocated memory is still 10.3GB. Free memory was 5.5GB in the beginning and 5.8GB in the end (delta: -288.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 12:20:07,136 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.14ms. Allocated memory is still 423.6MB. Free memory was 399.8MB in the beginning and 399.7MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 487.23ms. Allocated memory is still 423.6MB. Free memory was 398.0MB in the beginning and 371.5MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 94.49ms. Allocated memory is still 423.6MB. Free memory was 371.5MB in the beginning and 366.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 68.05ms. Allocated memory is still 423.6MB. Free memory was 366.8MB in the beginning and 362.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 125172.23ms. Allocated memory was 423.6MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 362.6MB in the beginning and 5.5GB in the end (delta: -5.1GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. * TraceAbstraction took 683256.82ms. Allocated memory is still 10.3GB. Free memory was 5.5GB in the beginning and 5.8GB in the end (delta: -288.2MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 520.1s, 373 PlacesBefore, 269 PlacesAfterwards, 363 TransitionsBefore, 256 TransitionsAfterwards, 53832 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 105 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 167 TotalNumberOfCompositions, 513771 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83100, independent: 79951, independent conditional: 0, independent unconditional: 79951, dependent: 3149, dependent conditional: 0, dependent unconditional: 3149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 16869, independent: 16513, independent conditional: 0, independent unconditional: 16513, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 83100, independent: 63438, independent conditional: 0, independent unconditional: 63438, dependent: 2793, dependent conditional: 0, dependent unconditional: 2793, unknown: 16869, unknown conditional: 0, unknown unconditional: 16869] , Statistics on independence cache: Total cache size (in pairs): 5995, Positive cache size: 5764, Positive conditional cache size: 0, Positive unconditional cache size: 5764, Negative cache size: 231, Negative conditional cache size: 0, Negative unconditional cache size: 231, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1133; [L849] FCALL, FORK 0 pthread_create(&t1133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1133, ((void *)0), P0, ((void *)0))=-3, t1133={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1134; [L851] FCALL, FORK 0 pthread_create(&t1134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1134, ((void *)0), P1, ((void *)0))=-2, t1133={5:0}, t1134={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1135; [L853] FCALL, FORK 0 pthread_create(&t1135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1135, ((void *)0), P2, ((void *)0))=-1, t1133={5:0}, t1134={6:0}, t1135={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 pthread_t t1136; [L855] FCALL, FORK 0 pthread_create(&t1136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1136, ((void *)0), P3, ((void *)0))=0, t1133={5:0}, t1134={6:0}, t1135={7:0}, t1136={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L804] 4 z$w_buff1 = z$w_buff0 [L805] 4 z$w_buff0 = 2 [L806] 4 z$w_buff1_used = z$w_buff0_used [L807] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff1_used && z$w_buff0_used [L808] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L808] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 a = 1 [L820] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] EXPR 1 __unbuffered_cnt + 1 [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] EXPR 2 __unbuffered_cnt + 1 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 [L790] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L790] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L791] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 [L792] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L792] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 [L793] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 [L794] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 [L794] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L794] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L826] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 [L828] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L828] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 [L829] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L829] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 [L830] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 [L830] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L830] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L797] EXPR 3 __unbuffered_cnt + 1 [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L833] EXPR 4 __unbuffered_cnt + 1 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] EXPR 0 __unbuffered_cnt == 4 [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] 0 assume_abort_if_not(main$tmp_guard0) [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 [L861] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 [L863] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L863] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 [L864] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L864] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 [L865] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 [L865] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L865] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 z$flush_delayed = weak$$choice2 [L871] 0 z$mem_tmp = z [L872] EXPR 0 !z$w_buff0_used [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L872] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] EXPR 0 !z$w_buff0_used [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L873] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L873] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] EXPR 0 !z$w_buff0_used [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L874] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L874] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] EXPR 0 !z$w_buff0_used [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L875] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] EXPR 0 !z$w_buff0_used [L877] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used [L877] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 [L877] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L877] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L877] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !z$w_buff0_used [L878] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used [L878] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 [L878] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] EXPR 0 z == 2 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 [L879] EXPR 0 __unbuffered_p0_EAX == 0 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 [L879] EXPR 0 __unbuffered_p1_EAX == 0 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 [L879] EXPR 0 __unbuffered_p3_EAX == 1 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0 [L879] EXPR 0 __unbuffered_p3_EBX == 0 [L879] EXPR 0 z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0 [L879] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L880] 0 z = z$flush_delayed ? z$mem_tmp : z [L881] 0 z$flush_delayed = (_Bool)0 [L883] 0 __VERIFIER_assert(main$tmp_guard1) [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix043.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={54:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 772]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 790]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 791]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 805]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 833]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 833]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 862]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 868]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 869]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 870]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 873]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 875]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 877]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 879]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 881]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 883]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 498 locations, 331 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: 679.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 145.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 525.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1177 IncrementalHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 0 mSDtfsCounter, 1177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=524occurred in iteration=0, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 1055 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-25 12:20:07,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...