/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/mix042.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 12:03:32,682 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 12:03:32,752 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:03:32,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 12:03:32,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 12:03:32,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 12:03:32,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 12:03:32,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 12:03:32,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 12:03:32,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 12:03:32,778 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 12:03:32,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 12:03:32,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 12:03:32,779 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 12:03:32,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 12:03:32,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 12:03:32,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 12:03:32,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 12:03:32,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 12:03:32,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 12:03:32,782 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 12:03:32,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 12:03:32,782 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 12:03:32,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 12:03:32,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 12:03:32,783 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 12:03:32,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 12:03:32,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 12:03:32,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 12:03:32,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 12:03:32,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 12:03:32,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 12:03:32,786 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 12:03:32,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 12:03:32,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 12:03:32,787 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:03:33,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 12:03:33,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 12:03:33,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 12:03:33,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 12:03:33,136 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 12:03:33,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2023-08-25 12:03:34,385 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 12:03:34,594 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 12:03:34,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2023-08-25 12:03:34,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faaf22da/108d9212773745e881c28eb77d6e615b/FLAG409fbad95 [2023-08-25 12:03:34,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9faaf22da/108d9212773745e881c28eb77d6e615b [2023-08-25 12:03:34,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 12:03:34,625 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 12:03:34,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 12:03:34,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 12:03:34,628 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 12:03:34,629 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 12:03:34" (1/1) ... [2023-08-25 12:03:34,630 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec3c36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:34, skipping insertion in model container [2023-08-25 12:03:34,630 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 12:03:34" (1/1) ... [2023-08-25 12:03:34,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 12:03:35,112 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 12:03:35,127 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 12:03:35,156 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-25 12:03:35,158 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-25 12:03:35,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 12:03:35,249 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 12:03:35,249 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 12:03:35,256 INFO L206 MainTranslator]: Completed translation [2023-08-25 12:03:35,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35 WrapperNode [2023-08-25 12:03:35,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 12:03:35,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 12:03:35,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 12:03:35,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 12:03:35,266 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:03:35" (1/1) ... [2023-08-25 12:03:35,300 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:03:35" (1/1) ... [2023-08-25 12:03:35,358 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 961 [2023-08-25 12:03:35,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 12:03:35,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 12:03:35,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 12:03:35,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 12:03:35,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 12:03:35,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 12:03:35,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 12:03:35,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 12:03:35,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (1/1) ... [2023-08-25 12:03:35,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 12:03:35,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 12:03:35,494 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:03:35,507 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:03:35,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 12:03:35,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 12:03:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 12:03:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 12:03:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 12:03:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-25 12:03:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-25 12:03:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-25 12:03:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-25 12:03:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-25 12:03:35,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-25 12:03:35,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 12:03:35,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 12:03:35,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 12:03:35,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 12:03:35,540 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:03:35,737 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 12:03:35,738 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 12:03:36,788 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 12:03:53,101 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 12:03:53,101 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-25 12:03:53,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 12:03:53 BoogieIcfgContainer [2023-08-25 12:03:53,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 12:03:53,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 12:03:53,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 12:03:53,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 12:03:53,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 12:03:34" (1/3) ... [2023-08-25 12:03:53,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29faba75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 12:03:53, skipping insertion in model container [2023-08-25 12:03:53,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:03:35" (2/3) ... [2023-08-25 12:03:53,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29faba75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 12:03:53, skipping insertion in model container [2023-08-25 12:03:53,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 12:03:53" (3/3) ... [2023-08-25 12:03:53,110 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2023-08-25 12:03:53,123 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 12:03:53,124 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 222 error locations. [2023-08-25 12:03:53,125 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 12:03:55,034 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 12:03:55,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 346 places, 339 transitions, 693 flow [2023-08-25 12:03:56,326 INFO L124 PetriNetUnfolderBase]: 3/336 cut-off events. [2023-08-25 12:03:56,326 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:03:56,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 336 events. 3/336 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 1829 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 298. Up to 2 conditions per place. [2023-08-25 12:03:56,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 346 places, 339 transitions, 693 flow [2023-08-25 12:03:56,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 343 places, 336 transitions, 681 flow [2023-08-25 12:03:56,364 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 12:03:56,377 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 343 places, 336 transitions, 681 flow [2023-08-25 12:03:56,383 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 343 places, 336 transitions, 681 flow [2023-08-25 12:03:56,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 343 places, 336 transitions, 681 flow [2023-08-25 12:03:57,113 INFO L124 PetriNetUnfolderBase]: 3/336 cut-off events. [2023-08-25 12:03:57,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:03:57,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 336 events. 3/336 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 1833 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 298. Up to 2 conditions per place. [2023-08-25 12:03:57,132 INFO L119 LiptonReduction]: Number of co-enabled transitions 45544 [2023-08-25 12:05:25,581 WARN L234 SmtUtils]: Spent 1.46m on a formula simplification. DAG size of input: 6074 DAG size of output: 1832 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:05:39,227 WARN L234 SmtUtils]: Spent 13.58s on a formula simplification. DAG size of input: 1708 DAG size of output: 1705 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:08:03,523 WARN L234 SmtUtils]: Spent 2.40m on a formula simplification. DAG size of input: 7561 DAG size of output: 2247 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:08:27,251 WARN L234 SmtUtils]: Spent 23.64s on a formula simplification. DAG size of input: 2094 DAG size of output: 2085 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:08:42,471 WARN L234 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 1708 DAG size of output: 1705 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:08:50,020 WARN L234 SmtUtils]: Spent 7.49s on a formula simplification that was a NOOP. DAG size: 1705 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:09:01,534 WARN L234 SmtUtils]: Spent 11.48s on a formula simplification that was a NOOP. DAG size: 2088 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:09:12,804 WARN L234 SmtUtils]: Spent 11.20s on a formula simplification that was a NOOP. DAG size: 2088 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:09:20,571 WARN L234 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 1708 DAG size of output: 889 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:09:39,882 WARN L234 SmtUtils]: Spent 16.84s on a formula simplification. DAG size of input: 2091 DAG size of output: 1188 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:09:44,980 WARN L234 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 1184 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:10:00,505 WARN L234 SmtUtils]: Spent 15.43s on a formula simplification. DAG size of input: 1716 DAG size of output: 1713 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:10:08,237 WARN L234 SmtUtils]: Spent 7.70s on a formula simplification that was a NOOP. DAG size: 1713 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:10:31,078 WARN L234 SmtUtils]: Spent 22.81s on a formula simplification. DAG size of input: 2099 DAG size of output: 2096 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:10:42,721 WARN L234 SmtUtils]: Spent 11.56s on a formula simplification that was a NOOP. DAG size: 2096 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:10:48,469 WARN L234 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 886 DAG size of output: 883 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:11:12,918 WARN L234 SmtUtils]: Spent 11.70s on a formula simplification that was a NOOP. DAG size: 1721 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:11:20,511 WARN L234 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 1719 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:11:56,051 WARN L234 SmtUtils]: Spent 35.51s on a formula simplification. DAG size of input: 2104 DAG size of output: 2101 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:12:07,932 WARN L234 SmtUtils]: Spent 11.73s on a formula simplification that was a NOOP. DAG size: 2099 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-25 12:12:08,700 INFO L134 LiptonReduction]: Checked pairs total: 391059 [2023-08-25 12:12:08,701 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-08-25 12:12:08,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 12:12:08,715 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;@4e0b861e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 12:12:08,715 INFO L358 AbstractCegarLoop]: Starting to check reachability of 315 error locations. [2023-08-25 12:12:08,717 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 12:12:08,718 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-25 12:12:08,718 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:12:08,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:08,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-25 12:12:08,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONDATA_RACE === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:08,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:08,722 INFO L85 PathProgramCache]: Analyzing trace with hash 5492569, now seen corresponding path program 1 times [2023-08-25 12:12:08,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:08,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335324690] [2023-08-25 12:12:08,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:08,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:12:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:12:09,012 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:12:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:12:09,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335324690] [2023-08-25 12:12:09,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335324690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:12:09,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:12:09,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 12:12:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499142927] [2023-08-25 12:12:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:12:09,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 12:12:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:12:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 12:12:09,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 12:12:09,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 485 [2023-08-25 12:12:09,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 243 transitions, 495 flow. Second operand has 2 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 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:12:09,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:12:09,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 485 [2023-08-25 12:12:09,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:12:19,972 INFO L124 PetriNetUnfolderBase]: 1614/2363 cut-off events. [2023-08-25 12:12:19,973 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-25 12:12:19,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4781 conditions, 2363 events. 1614/2363 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9823 event pairs, 1614 based on Foata normal form. 0/2123 useless extension candidates. Maximal degree in co-relation 4770. Up to 2364 conditions per place. [2023-08-25 12:12:19,985 INFO L140 encePairwiseOnDemand]: 265/485 looper letters, 23 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-08-25 12:12:19,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 101 flow [2023-08-25 12:12:19,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 12:12:19,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 12:12:19,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 437 transitions. [2023-08-25 12:12:19,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4505154639175258 [2023-08-25 12:12:19,998 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 437 transitions. [2023-08-25 12:12:19,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 437 transitions. [2023-08-25 12:12:20,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:12:20,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 437 transitions. [2023-08-25 12:12:20,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 0 states have call successors, (0), 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:12:20,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 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:12:20,009 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 485.0) internal successors, (1455), 3 states have internal predecessors, (1455), 0 states have call successors, (0), 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:12:20,010 INFO L175 Difference]: Start difference. First operand has 253 places, 243 transitions, 495 flow. Second operand 2 states and 437 transitions. [2023-08-25 12:12:20,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 101 flow [2023-08-25 12:12:20,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 12:12:20,014 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-08-25 12:12:20,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-08-25 12:12:20,019 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -222 predicate places. [2023-08-25 12:12:20,019 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-08-25 12:12:20,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 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:12:20,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:20,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:12:20,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 12:12:20,020 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:20,020 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash 410394291, now seen corresponding path program 1 times [2023-08-25 12:12:20,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:20,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543995195] [2023-08-25 12:12:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:20,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:12:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:12:20,281 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:12:20,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:12:20,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543995195] [2023-08-25 12:12:20,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543995195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:12:20,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:12:20,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 12:12:20,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822456471] [2023-08-25 12:12:20,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:12:20,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 12:12:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:12:20,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 12:12:20,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 12:12:20,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 485 [2023-08-25 12:12:20,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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:12:20,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:12:20,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 485 [2023-08-25 12:12:20,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:12:29,284 INFO L124 PetriNetUnfolderBase]: 1379/2028 cut-off events. [2023-08-25 12:12:29,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 12:12:29,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4109 conditions, 2028 events. 1379/2028 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8397 event pairs, 204 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 4106. Up to 1676 conditions per place. [2023-08-25 12:12:29,292 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 29 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-08-25 12:12:29,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 138 flow [2023-08-25 12:12:29,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 12:12:29,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 12:12:29,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-08-25 12:12:29,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22130584192439862 [2023-08-25 12:12:29,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-08-25 12:12:29,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-08-25 12:12:29,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:12:29,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-08-25 12:12:29,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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:12:29,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 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:12:29,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 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:12:29,309 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 322 transitions. [2023-08-25 12:12:29,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 138 flow [2023-08-25 12:12:29,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 12:12:29,310 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-25 12:12:29,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-25 12:12:29,313 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -221 predicate places. [2023-08-25 12:12:29,313 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-25 12:12:29,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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:12:29,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:29,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:12:29,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 12:12:29,314 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:29,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:29,317 INFO L85 PathProgramCache]: Analyzing trace with hash -747837478, now seen corresponding path program 1 times [2023-08-25 12:12:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602594642] [2023-08-25 12:12:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:29,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:12:29,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:12:29,706 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:12:29,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:12:29,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602594642] [2023-08-25 12:12:29,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602594642] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:12:29,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:12:29,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 12:12:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007333864] [2023-08-25 12:12:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:12:29,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 12:12:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:12:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 12:12:29,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 12:12:29,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 485 [2023-08-25 12:12:29,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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:12:29,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:12:29,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 485 [2023-08-25 12:12:29,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:12:33,131 INFO L124 PetriNetUnfolderBase]: 991/1480 cut-off events. [2023-08-25 12:12:33,131 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-25 12:12:33,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 1480 events. 991/1480 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5714 event pairs, 335 based on Foata normal form. 40/1520 useless extension candidates. Maximal degree in co-relation 3071. Up to 1037 conditions per place. [2023-08-25 12:12:33,137 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-25 12:12:33,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 130 flow [2023-08-25 12:12:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 12:12:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 12:12:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-25 12:12:33,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21924398625429553 [2023-08-25 12:12:33,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-25 12:12:33,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-25 12:12:33,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:12:33,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-25 12:12:33,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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:12:33,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 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:12:33,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 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:12:33,144 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 3 states and 319 transitions. [2023-08-25 12:12:33,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 130 flow [2023-08-25 12:12:33,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 12:12:33,150 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 56 flow [2023-08-25 12:12:33,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-25 12:12:33,152 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -221 predicate places. [2023-08-25 12:12:33,152 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 56 flow [2023-08-25 12:12:33,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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:12:33,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:33,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:12:33,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 12:12:33,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:33,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:33,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1451882402, now seen corresponding path program 1 times [2023-08-25 12:12:33,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:33,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052690983] [2023-08-25 12:12:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:12:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:12:36,738 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:12:36,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:12:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052690983] [2023-08-25 12:12:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052690983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:12:36,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:12:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:12:36,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661742000] [2023-08-25 12:12:36,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:12:36,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 12:12:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:12:36,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 12:12:36,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 12:12:36,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 485 [2023-08-25 12:12:36,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 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:12:36,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:12:36,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 485 [2023-08-25 12:12:36,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:12:40,380 INFO L124 PetriNetUnfolderBase]: 1033/1546 cut-off events. [2023-08-25 12:12:40,380 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-25 12:12:40,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3364 conditions, 1546 events. 1033/1546 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6023 event pairs, 327 based on Foata normal form. 16/1562 useless extension candidates. Maximal degree in co-relation 3359. Up to 1247 conditions per place. [2023-08-25 12:12:40,387 INFO L140 encePairwiseOnDemand]: 479/485 looper letters, 39 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2023-08-25 12:12:40,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 207 flow [2023-08-25 12:12:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 12:12:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 12:12:40,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-08-25 12:12:40,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20536082474226805 [2023-08-25 12:12:40,390 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-08-25 12:12:40,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-08-25 12:12:40,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:12:40,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-08-25 12:12:40,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:12:40,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 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:12:40,397 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 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:12:40,397 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 56 flow. Second operand 5 states and 498 transitions. [2023-08-25 12:12:40,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 207 flow [2023-08-25 12:12:40,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 47 transitions, 201 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 12:12:40,399 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 99 flow [2023-08-25 12:12:40,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-25 12:12:40,400 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -217 predicate places. [2023-08-25 12:12:40,400 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 99 flow [2023-08-25 12:12:40,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.2) internal successors, (461), 5 states have internal predecessors, (461), 0 states have call successors, (0), 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:12:40,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:40,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:12:40,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 12:12:40,401 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:40,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:40,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1412154662, now seen corresponding path program 2 times [2023-08-25 12:12:40,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:40,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715709284] [2023-08-25 12:12:40,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:40,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:12:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:12:42,841 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:12:42,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:12:42,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715709284] [2023-08-25 12:12:42,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715709284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:12:42,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:12:42,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:12:42,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641030070] [2023-08-25 12:12:42,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:12:42,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 12:12:42,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:12:42,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 12:12:42,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-25 12:12:42,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 485 [2023-08-25 12:12:42,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 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:12:42,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:12:42,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 485 [2023-08-25 12:12:42,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:12:46,604 INFO L124 PetriNetUnfolderBase]: 989/1486 cut-off events. [2023-08-25 12:12:46,605 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2023-08-25 12:12:46,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3686 conditions, 1486 events. 989/1486 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5765 event pairs, 329 based on Foata normal form. 16/1502 useless extension candidates. Maximal degree in co-relation 3679. Up to 1133 conditions per place. [2023-08-25 12:12:46,612 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 36 selfloop transitions, 9 changer transitions 0/45 dead transitions. [2023-08-25 12:12:46,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 232 flow [2023-08-25 12:12:46,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:12:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:12:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-25 12:12:46,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20927835051546392 [2023-08-25 12:12:46,616 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-25 12:12:46,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-25 12:12:46,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:12:46,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-25 12:12:46,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 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:12:46,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:12:46,621 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:12:46,622 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 99 flow. Second operand 4 states and 406 transitions. [2023-08-25 12:12:46,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 232 flow [2023-08-25 12:12:46,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 12:12:46,624 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 137 flow [2023-08-25 12:12:46,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-25 12:12:46,625 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -213 predicate places. [2023-08-25 12:12:46,625 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 137 flow [2023-08-25 12:12:46,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 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:12:46,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:46,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:12:46,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 12:12:46,626 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:46,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1327360263, now seen corresponding path program 1 times [2023-08-25 12:12:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:46,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712947468] [2023-08-25 12:12:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:46,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:12:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:12:49,121 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:12:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:12:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712947468] [2023-08-25 12:12:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712947468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:12:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:12:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 12:12:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332950875] [2023-08-25 12:12:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:12:49,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 12:12:49,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:12:49,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 12:12:49,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-25 12:12:49,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 485 [2023-08-25 12:12:49,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 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:12:49,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:12:49,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 485 [2023-08-25 12:12:49,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:12:53,011 INFO L124 PetriNetUnfolderBase]: 1017/1530 cut-off events. [2023-08-25 12:12:53,011 INFO L125 PetriNetUnfolderBase]: For 828/828 co-relation queries the response was YES. [2023-08-25 12:12:53,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4141 conditions, 1530 events. 1017/1530 cut-off events. For 828/828 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6030 event pairs, 117 based on Foata normal form. 8/1538 useless extension candidates. Maximal degree in co-relation 4132. Up to 882 conditions per place. [2023-08-25 12:12:53,017 INFO L140 encePairwiseOnDemand]: 478/485 looper letters, 50 selfloop transitions, 13 changer transitions 0/63 dead transitions. [2023-08-25 12:12:53,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 63 transitions, 346 flow [2023-08-25 12:12:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 12:12:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 12:12:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 605 transitions. [2023-08-25 12:12:53,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20790378006872853 [2023-08-25 12:12:53,022 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 605 transitions. [2023-08-25 12:12:53,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 605 transitions. [2023-08-25 12:12:53,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:12:53,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 605 transitions. [2023-08-25 12:12:53,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.83333333333333) internal successors, (605), 6 states have internal predecessors, (605), 0 states have call successors, (0), 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:12:53,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 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:12:53,029 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 485.0) internal successors, (3395), 7 states have internal predecessors, (3395), 0 states have call successors, (0), 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:12:53,029 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 137 flow. Second operand 6 states and 605 transitions. [2023-08-25 12:12:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 63 transitions, 346 flow [2023-08-25 12:12:53,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 328 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-25 12:12:53,033 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 185 flow [2023-08-25 12:12:53,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-25 12:12:53,034 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -208 predicate places. [2023-08-25 12:12:53,034 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 185 flow [2023-08-25 12:12:53,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 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:12:53,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:53,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:12:53,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 12:12:53,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:53,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:53,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1340362593, now seen corresponding path program 2 times [2023-08-25 12:12:53,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:53,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696333772] [2023-08-25 12:12:53,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:53,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:12:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:12:55,491 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:12:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:12:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696333772] [2023-08-25 12:12:55,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696333772] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:12:55,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:12:55,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 12:12:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546354783] [2023-08-25 12:12:55,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:12:55,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 12:12:55,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:12:55,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 12:12:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-25 12:12:55,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 485 [2023-08-25 12:12:55,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 185 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:12:55,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:12:55,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 485 [2023-08-25 12:12:55,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:12:59,800 INFO L124 PetriNetUnfolderBase]: 1133/1710 cut-off events. [2023-08-25 12:12:59,800 INFO L125 PetriNetUnfolderBase]: For 1554/1554 co-relation queries the response was YES. [2023-08-25 12:12:59,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 1710 events. 1133/1710 cut-off events. For 1554/1554 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7038 event pairs, 121 based on Foata normal form. 24/1734 useless extension candidates. Maximal degree in co-relation 4976. Up to 831 conditions per place. [2023-08-25 12:12:59,809 INFO L140 encePairwiseOnDemand]: 479/485 looper letters, 47 selfloop transitions, 13 changer transitions 0/60 dead transitions. [2023-08-25 12:12:59,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 378 flow [2023-08-25 12:12:59,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 12:12:59,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 12:12:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-25 12:12:59,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2065979381443299 [2023-08-25 12:12:59,813 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-25 12:12:59,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-25 12:12:59,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:12:59,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-25 12:12:59,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:12:59,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 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:12:59,818 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 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:12:59,819 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 185 flow. Second operand 5 states and 501 transitions. [2023-08-25 12:12:59,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 378 flow [2023-08-25 12:12:59,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 361 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-25 12:12:59,826 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 222 flow [2023-08-25 12:12:59,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-25 12:12:59,826 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -205 predicate places. [2023-08-25 12:12:59,827 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 222 flow [2023-08-25 12:12:59,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 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:12:59,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:12:59,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:12:59,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 12:12:59,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:12:59,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:12:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash 28051517, now seen corresponding path program 1 times [2023-08-25 12:12:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:12:59,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728612048] [2023-08-25 12:12:59,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:12:59,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:13:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:13:00,333 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:13:00,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:13:00,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728612048] [2023-08-25 12:13:00,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728612048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:13:00,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:13:00,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 12:13:00,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740213922] [2023-08-25 12:13:00,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:13:00,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 12:13:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:13:00,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 12:13:00,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 12:13:00,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 485 [2023-08-25 12:13:00,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:13:00,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:13:00,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 485 [2023-08-25 12:13:00,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:13:02,818 INFO L124 PetriNetUnfolderBase]: 605/996 cut-off events. [2023-08-25 12:13:02,818 INFO L125 PetriNetUnfolderBase]: For 1339/1339 co-relation queries the response was YES. [2023-08-25 12:13:02,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 996 events. 605/996 cut-off events. For 1339/1339 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4189 event pairs, 147 based on Foata normal form. 69/1065 useless extension candidates. Maximal degree in co-relation 3076. Up to 779 conditions per place. [2023-08-25 12:13:02,822 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 58 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-25 12:13:02,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 483 flow [2023-08-25 12:13:02,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 12:13:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 12:13:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-25 12:13:02,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22405498281786942 [2023-08-25 12:13:02,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-25 12:13:02,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-25 12:13:02,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:13:02,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-25 12:13:02,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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:13:02,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 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:13:02,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 485.0) internal successors, (1940), 4 states have internal predecessors, (1940), 0 states have call successors, (0), 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:13:02,828 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 222 flow. Second operand 3 states and 326 transitions. [2023-08-25 12:13:02,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 483 flow [2023-08-25 12:13:02,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 62 transitions, 448 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-25 12:13:02,833 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 226 flow [2023-08-25 12:13:02,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-25 12:13:02,833 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -205 predicate places. [2023-08-25 12:13:02,833 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 226 flow [2023-08-25 12:13:02,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:13:02,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:13:02,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:13:02,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 12:13:02,834 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:13:02,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:13:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash -390569918, now seen corresponding path program 1 times [2023-08-25 12:13:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:13:02,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760773459] [2023-08-25 12:13:02,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:13:02,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:13:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:13:03,311 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:13:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:13:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760773459] [2023-08-25 12:13:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760773459] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:13:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:13:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:13:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818342929] [2023-08-25 12:13:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:13:03,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 12:13:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:13:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 12:13:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 12:13:03,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 485 [2023-08-25 12:13:03,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 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:13:03,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:13:03,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 485 [2023-08-25 12:13:03,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:13:04,368 INFO L124 PetriNetUnfolderBase]: 305/541 cut-off events. [2023-08-25 12:13:04,368 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2023-08-25 12:13:04,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 541 events. 305/541 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2054 event pairs, 103 based on Foata normal form. 59/600 useless extension candidates. Maximal degree in co-relation 1773. Up to 218 conditions per place. [2023-08-25 12:13:04,371 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 63 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2023-08-25 12:13:04,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 494 flow [2023-08-25 12:13:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:13:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:13:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-25 12:13:04,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22474226804123712 [2023-08-25 12:13:04,373 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-25 12:13:04,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-25 12:13:04,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:13:04,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-25 12:13:04,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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:13:04,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:13:04,377 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:13:04,377 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 226 flow. Second operand 4 states and 436 transitions. [2023-08-25 12:13:04,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 494 flow [2023-08-25 12:13:04,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 471 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-25 12:13:04,380 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 201 flow [2023-08-25 12:13:04,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=201, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-25 12:13:04,381 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -206 predicate places. [2023-08-25 12:13:04,381 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 201 flow [2023-08-25 12:13:04,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 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:13:04,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:13:04,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:13:04,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 12:13:04,382 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:13:04,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:13:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash -691614404, now seen corresponding path program 1 times [2023-08-25 12:13:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:13:04,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494641880] [2023-08-25 12:13:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:13:04,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:13:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:13:04,644 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:13:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:13:04,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494641880] [2023-08-25 12:13:04,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494641880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:13:04,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:13:04,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:13:04,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534038766] [2023-08-25 12:13:04,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:13:04,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 12:13:04,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:13:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 12:13:04,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 12:13:04,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 485 [2023-08-25 12:13:04,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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:13:04,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:13:04,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 485 [2023-08-25 12:13:04,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:13:06,291 INFO L124 PetriNetUnfolderBase]: 380/690 cut-off events. [2023-08-25 12:13:06,291 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2023-08-25 12:13:06,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2385 conditions, 690 events. 380/690 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3077 event pairs, 28 based on Foata normal form. 9/699 useless extension candidates. Maximal degree in co-relation 2373. Up to 432 conditions per place. [2023-08-25 12:13:06,294 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 61 selfloop transitions, 2 changer transitions 21/84 dead transitions. [2023-08-25 12:13:06,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 84 transitions, 649 flow [2023-08-25 12:13:06,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:13:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:13:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-25 12:13:06,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22061855670103092 [2023-08-25 12:13:06,296 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-25 12:13:06,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-25 12:13:06,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:13:06,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-25 12:13:06,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 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:13:06,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:13:06,300 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:13:06,300 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 201 flow. Second operand 4 states and 428 transitions. [2023-08-25 12:13:06,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 84 transitions, 649 flow [2023-08-25 12:13:06,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 84 transitions, 615 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-25 12:13:06,303 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 200 flow [2023-08-25 12:13:06,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-08-25 12:13:06,304 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -203 predicate places. [2023-08-25 12:13:06,304 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 200 flow [2023-08-25 12:13:06,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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:13:06,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:13:06,304 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 12:13:06,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 12:13:06,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:13:06,305 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:13:06,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1956451722, now seen corresponding path program 2 times [2023-08-25 12:13:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:13:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690005441] [2023-08-25 12:13:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:13:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:13:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:13:06,778 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:13:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:13:06,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690005441] [2023-08-25 12:13:06,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690005441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:13:06,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:13:06,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 12:13:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947513872] [2023-08-25 12:13:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:13:06,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 12:13:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:13:06,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 12:13:06,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-25 12:13:06,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 485 [2023-08-25 12:13:06,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:13:06,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:13:06,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 485 [2023-08-25 12:13:06,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:13:07,832 INFO L124 PetriNetUnfolderBase]: 323/572 cut-off events. [2023-08-25 12:13:07,833 INFO L125 PetriNetUnfolderBase]: For 849/849 co-relation queries the response was YES. [2023-08-25 12:13:07,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1960 conditions, 572 events. 323/572 cut-off events. For 849/849 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2328 event pairs, 105 based on Foata normal form. 24/596 useless extension candidates. Maximal degree in co-relation 1946. Up to 249 conditions per place. [2023-08-25 12:13:07,835 INFO L140 encePairwiseOnDemand]: 480/485 looper letters, 49 selfloop transitions, 10 changer transitions 13/72 dead transitions. [2023-08-25 12:13:07,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 520 flow [2023-08-25 12:13:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 12:13:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 12:13:07,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-25 12:13:07,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21938144329896908 [2023-08-25 12:13:07,838 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-25 12:13:07,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-25 12:13:07,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:13:07,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-25 12:13:07,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 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:13:07,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 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:13:07,843 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 485.0) internal successors, (2910), 6 states have internal predecessors, (2910), 0 states have call successors, (0), 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:13:07,843 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 200 flow. Second operand 5 states and 532 transitions. [2023-08-25 12:13:07,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 520 flow [2023-08-25 12:13:07,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 505 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-25 12:13:07,846 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 211 flow [2023-08-25 12:13:07,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-25 12:13:07,847 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -200 predicate places. [2023-08-25 12:13:07,847 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 211 flow [2023-08-25 12:13:07,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 12:13:07,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:13:07,847 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] [2023-08-25 12:13:07,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 12:13:07,847 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:13:07,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:13:07,848 INFO L85 PathProgramCache]: Analyzing trace with hash 983258514, now seen corresponding path program 1 times [2023-08-25 12:13:07,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:13:07,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233429836] [2023-08-25 12:13:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:13:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:13:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 12:13:08,122 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:13:08,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 12:13:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233429836] [2023-08-25 12:13:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233429836] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 12:13:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 12:13:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 12:13:08,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187378300] [2023-08-25 12:13:08,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 12:13:08,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 12:13:08,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 12:13:08,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 12:13:08,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 12:13:08,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 485 [2023-08-25 12:13:08,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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:13:08,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 12:13:08,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 485 [2023-08-25 12:13:08,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 12:13:08,992 INFO L124 PetriNetUnfolderBase]: 312/582 cut-off events. [2023-08-25 12:13:08,993 INFO L125 PetriNetUnfolderBase]: For 1123/1123 co-relation queries the response was YES. [2023-08-25 12:13:08,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2141 conditions, 582 events. 312/582 cut-off events. For 1123/1123 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2560 event pairs, 47 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 2127. Up to 329 conditions per place. [2023-08-25 12:13:08,995 INFO L140 encePairwiseOnDemand]: 482/485 looper letters, 35 selfloop transitions, 1 changer transitions 39/75 dead transitions. [2023-08-25 12:13:08,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 604 flow [2023-08-25 12:13:08,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 12:13:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 12:13:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-08-25 12:13:08,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21855670103092784 [2023-08-25 12:13:08,997 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-08-25 12:13:08,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-08-25 12:13:08,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 12:13:08,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-08-25 12:13:08,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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:13:09,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:13:09,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 485.0) internal successors, (2425), 5 states have internal predecessors, (2425), 0 states have call successors, (0), 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:13:09,001 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 211 flow. Second operand 4 states and 424 transitions. [2023-08-25 12:13:09,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 604 flow [2023-08-25 12:13:09,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 546 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-25 12:13:09,005 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 158 flow [2023-08-25 12:13:09,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=485, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2023-08-25 12:13:09,006 INFO L281 CegarLoopForPetriNet]: 253 programPoint places, -200 predicate places. [2023-08-25 12:13:09,006 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 158 flow [2023-08-25 12:13:09,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 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:13:09,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 12:13:09,007 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] [2023-08-25 12:13:09,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 12:13:09,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr131ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 311 more)] === [2023-08-25 12:13:09,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 12:13:09,007 INFO L85 PathProgramCache]: Analyzing trace with hash -515727606, now seen corresponding path program 2 times [2023-08-25 12:13:09,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 12:13:09,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703892311] [2023-08-25 12:13:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 12:13:09,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 12:13:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 12:13:09,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 12:13:09,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 12:13:09,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 12:13:09,539 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 12:13:09,540 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONASSERT (314 of 315 remaining) [2023-08-25 12:13:09,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (313 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (312 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (311 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (310 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (309 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (308 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (307 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (306 of 315 remaining) [2023-08-25 12:13:09,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (305 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (304 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONDATA_RACE (303 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONDATA_RACE (302 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONDATA_RACE (301 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONDATA_RACE (300 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONDATA_RACE (299 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONDATA_RACE (298 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONDATA_RACE (297 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONDATA_RACE (296 of 315 remaining) [2023-08-25 12:13:09,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONDATA_RACE (295 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONDATA_RACE (294 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONDATA_RACE (293 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONDATA_RACE (292 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONDATA_RACE (291 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONDATA_RACE (290 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONDATA_RACE (289 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONDATA_RACE (288 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONDATA_RACE (287 of 315 remaining) [2023-08-25 12:13:09,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONDATA_RACE (286 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONDATA_RACE (285 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONDATA_RACE (284 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONDATA_RACE (283 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONDATA_RACE (282 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONDATA_RACE (281 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONDATA_RACE (280 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONDATA_RACE (279 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONDATA_RACE (278 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONDATA_RACE (277 of 315 remaining) [2023-08-25 12:13:09,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONDATA_RACE (276 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONDATA_RACE (275 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONDATA_RACE (274 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONDATA_RACE (273 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONDATA_RACE (272 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONDATA_RACE (271 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6ASSERT_VIOLATIONDATA_RACE (270 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7ASSERT_VIOLATIONDATA_RACE (269 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8ASSERT_VIOLATIONASSERT (268 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9ASSERT_VIOLATIONDATA_RACE (267 of 315 remaining) [2023-08-25 12:13:09,546 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10ASSERT_VIOLATIONDATA_RACE (266 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11ASSERT_VIOLATIONDATA_RACE (265 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12ASSERT_VIOLATIONDATA_RACE (264 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13ASSERT_VIOLATIONDATA_RACE (263 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14ASSERT_VIOLATIONDATA_RACE (262 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15ASSERT_VIOLATIONDATA_RACE (261 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16ASSERT_VIOLATIONDATA_RACE (260 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17ASSERT_VIOLATIONDATA_RACE (259 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18ASSERT_VIOLATIONDATA_RACE (258 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19ASSERT_VIOLATIONDATA_RACE (257 of 315 remaining) [2023-08-25 12:13:09,547 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err20ASSERT_VIOLATIONDATA_RACE (256 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err21ASSERT_VIOLATIONDATA_RACE (255 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err22ASSERT_VIOLATIONDATA_RACE (254 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err23ASSERT_VIOLATIONDATA_RACE (253 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err24ASSERT_VIOLATIONDATA_RACE (252 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err25ASSERT_VIOLATIONDATA_RACE (251 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err26ASSERT_VIOLATIONDATA_RACE (250 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err27ASSERT_VIOLATIONDATA_RACE (249 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err28ASSERT_VIOLATIONDATA_RACE (248 of 315 remaining) [2023-08-25 12:13:09,548 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err29ASSERT_VIOLATIONDATA_RACE (247 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err30ASSERT_VIOLATIONDATA_RACE (246 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err31ASSERT_VIOLATIONDATA_RACE (245 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err32ASSERT_VIOLATIONDATA_RACE (244 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err33ASSERT_VIOLATIONDATA_RACE (243 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err34ASSERT_VIOLATIONDATA_RACE (242 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err35ASSERT_VIOLATIONDATA_RACE (241 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err36ASSERT_VIOLATIONDATA_RACE (240 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err37ASSERT_VIOLATIONDATA_RACE (239 of 315 remaining) [2023-08-25 12:13:09,549 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err38ASSERT_VIOLATIONDATA_RACE (238 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err39ASSERT_VIOLATIONDATA_RACE (237 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err40ASSERT_VIOLATIONDATA_RACE (236 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err41ASSERT_VIOLATIONDATA_RACE (235 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err42ASSERT_VIOLATIONDATA_RACE (234 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err43ASSERT_VIOLATIONDATA_RACE (233 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err44ASSERT_VIOLATIONDATA_RACE (232 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err45ASSERT_VIOLATIONDATA_RACE (231 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err46ASSERT_VIOLATIONDATA_RACE (230 of 315 remaining) [2023-08-25 12:13:09,550 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err47ASSERT_VIOLATIONDATA_RACE (229 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err48ASSERT_VIOLATIONDATA_RACE (228 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err49ASSERT_VIOLATIONDATA_RACE (227 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err50ASSERT_VIOLATIONDATA_RACE (226 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err51ASSERT_VIOLATIONDATA_RACE (225 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err52ASSERT_VIOLATIONDATA_RACE (224 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (223 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (222 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (221 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (220 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (219 of 315 remaining) [2023-08-25 12:13:09,551 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (218 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (217 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (216 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (215 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (214 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (213 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (212 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (211 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (210 of 315 remaining) [2023-08-25 12:13:09,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (209 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (208 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (207 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (206 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (205 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (204 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (203 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (202 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (201 of 315 remaining) [2023-08-25 12:13:09,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (200 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (199 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (198 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (197 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (196 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (195 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (194 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (193 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (192 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (191 of 315 remaining) [2023-08-25 12:13:09,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (190 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (189 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (188 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (187 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (186 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (185 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (184 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (183 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (182 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (181 of 315 remaining) [2023-08-25 12:13:09,555 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (180 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (179 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (178 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (177 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (176 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (175 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (174 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (173 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (172 of 315 remaining) [2023-08-25 12:13:09,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (171 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (170 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (169 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (168 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (167 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (166 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (165 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (164 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (163 of 315 remaining) [2023-08-25 12:13:09,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (162 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (161 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (160 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (159 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (158 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (157 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (156 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (155 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (154 of 315 remaining) [2023-08-25 12:13:09,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (153 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (152 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (151 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (150 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (149 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (148 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (147 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (146 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (145 of 315 remaining) [2023-08-25 12:13:09,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (144 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (143 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (142 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (141 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (140 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (139 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (138 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (137 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (136 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (135 of 315 remaining) [2023-08-25 12:13:09,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (134 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (133 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (132 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (131 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (130 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (129 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (128 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (127 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (126 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (125 of 315 remaining) [2023-08-25 12:13:09,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (124 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (123 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (122 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (121 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (120 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (119 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (118 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (117 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (116 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (115 of 315 remaining) [2023-08-25 12:13:09,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (114 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (113 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (112 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (111 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (110 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (109 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (108 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (107 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (106 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (105 of 315 remaining) [2023-08-25 12:13:09,563 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (104 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (103 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (102 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (101 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (100 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (99 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (98 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (97 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (96 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (95 of 315 remaining) [2023-08-25 12:13:09,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (94 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONDATA_RACE (93 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (89 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (88 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (87 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (86 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (85 of 315 remaining) [2023-08-25 12:13:09,565 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (84 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (83 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (82 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (81 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (80 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONDATA_RACE (79 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONDATA_RACE (78 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONDATA_RACE (77 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONDATA_RACE (76 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONDATA_RACE (75 of 315 remaining) [2023-08-25 12:13:09,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONDATA_RACE (74 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONDATA_RACE (73 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONDATA_RACE (72 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONDATA_RACE (71 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONDATA_RACE (70 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONDATA_RACE (69 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONDATA_RACE (68 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONDATA_RACE (67 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONDATA_RACE (66 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONDATA_RACE (65 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONDATA_RACE (64 of 315 remaining) [2023-08-25 12:13:09,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONDATA_RACE (63 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONDATA_RACE (62 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONDATA_RACE (61 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONDATA_RACE (60 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONDATA_RACE (59 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONDATA_RACE (58 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONDATA_RACE (57 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONDATA_RACE (56 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONDATA_RACE (55 of 315 remaining) [2023-08-25 12:13:09,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONDATA_RACE (54 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONDATA_RACE (53 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONDATA_RACE (52 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONDATA_RACE (51 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONDATA_RACE (50 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONDATA_RACE (49 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4ASSERT_VIOLATIONDATA_RACE (48 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5ASSERT_VIOLATIONDATA_RACE (47 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6ASSERT_VIOLATIONDATA_RACE (46 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7ASSERT_VIOLATIONDATA_RACE (45 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8ASSERT_VIOLATIONASSERT (44 of 315 remaining) [2023-08-25 12:13:09,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9ASSERT_VIOLATIONDATA_RACE (43 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10ASSERT_VIOLATIONDATA_RACE (42 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11ASSERT_VIOLATIONDATA_RACE (41 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12ASSERT_VIOLATIONDATA_RACE (40 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13ASSERT_VIOLATIONDATA_RACE (39 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14ASSERT_VIOLATIONDATA_RACE (38 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15ASSERT_VIOLATIONDATA_RACE (37 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16ASSERT_VIOLATIONDATA_RACE (36 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17ASSERT_VIOLATIONDATA_RACE (35 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18ASSERT_VIOLATIONDATA_RACE (34 of 315 remaining) [2023-08-25 12:13:09,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19ASSERT_VIOLATIONDATA_RACE (33 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err20ASSERT_VIOLATIONDATA_RACE (32 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err21ASSERT_VIOLATIONDATA_RACE (31 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err22ASSERT_VIOLATIONDATA_RACE (30 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err23ASSERT_VIOLATIONDATA_RACE (29 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err24ASSERT_VIOLATIONDATA_RACE (28 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err25ASSERT_VIOLATIONDATA_RACE (27 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err26ASSERT_VIOLATIONDATA_RACE (26 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err27ASSERT_VIOLATIONDATA_RACE (25 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err28ASSERT_VIOLATIONDATA_RACE (24 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err29ASSERT_VIOLATIONDATA_RACE (23 of 315 remaining) [2023-08-25 12:13:09,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err30ASSERT_VIOLATIONDATA_RACE (22 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err31ASSERT_VIOLATIONDATA_RACE (21 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err32ASSERT_VIOLATIONDATA_RACE (20 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err33ASSERT_VIOLATIONDATA_RACE (19 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err34ASSERT_VIOLATIONDATA_RACE (18 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err35ASSERT_VIOLATIONDATA_RACE (17 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err36ASSERT_VIOLATIONDATA_RACE (16 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err37ASSERT_VIOLATIONDATA_RACE (15 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err38ASSERT_VIOLATIONDATA_RACE (14 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err39ASSERT_VIOLATIONDATA_RACE (13 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err40ASSERT_VIOLATIONDATA_RACE (12 of 315 remaining) [2023-08-25 12:13:09,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err41ASSERT_VIOLATIONDATA_RACE (11 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err42ASSERT_VIOLATIONDATA_RACE (10 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err43ASSERT_VIOLATIONDATA_RACE (9 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err44ASSERT_VIOLATIONDATA_RACE (8 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err45ASSERT_VIOLATIONDATA_RACE (7 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err46ASSERT_VIOLATIONDATA_RACE (6 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err47ASSERT_VIOLATIONDATA_RACE (5 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err48ASSERT_VIOLATIONDATA_RACE (4 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err49ASSERT_VIOLATIONDATA_RACE (3 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err50ASSERT_VIOLATIONDATA_RACE (2 of 315 remaining) [2023-08-25 12:13:09,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err51ASSERT_VIOLATIONDATA_RACE (1 of 315 remaining) [2023-08-25 12:13:09,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err52ASSERT_VIOLATIONDATA_RACE (0 of 315 remaining) [2023-08-25 12:13:09,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 12:13:09,574 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-25 12:13:09,582 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 12:13:09,582 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 12:13:09,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 12:13:09 BasicIcfg [2023-08-25 12:13:09,668 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 12:13:09,669 INFO L158 Benchmark]: Toolchain (without parser) took 575043.84ms. Allocated memory was 377.5MB in the beginning and 9.1GB in the end (delta: 8.7GB). Free memory was 332.5MB in the beginning and 4.9GB in the end (delta: -4.6GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-08-25 12:13:09,669 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 377.5MB. Free memory is still 355.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 12:13:09,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.71ms. Allocated memory is still 377.5MB. Free memory was 332.5MB in the beginning and 306.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-25 12:13:09,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.17ms. Allocated memory is still 377.5MB. Free memory was 306.3MB in the beginning and 301.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 12:13:09,670 INFO L158 Benchmark]: Boogie Preprocessor took 84.76ms. Allocated memory is still 377.5MB. Free memory was 301.0MB in the beginning and 297.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 12:13:09,670 INFO L158 Benchmark]: RCFGBuilder took 17659.24ms. Allocated memory was 377.5MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 297.9MB in the beginning and 7.0GB in the end (delta: -6.7GB). Peak memory consumption was 927.4MB. Max. memory is 16.0GB. [2023-08-25 12:13:09,670 INFO L158 Benchmark]: TraceAbstraction took 556562.26ms. Allocated memory was 7.8GB in the beginning and 9.1GB in the end (delta: 1.3GB). Free memory was 7.0GB in the beginning and 4.9GB in the end (delta: 2.1GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-25 12:13:09,671 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.15ms. Allocated memory is still 377.5MB. Free memory is still 355.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 632.71ms. Allocated memory is still 377.5MB. Free memory was 332.5MB in the beginning and 306.3MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 99.17ms. Allocated memory is still 377.5MB. Free memory was 306.3MB in the beginning and 301.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 84.76ms. Allocated memory is still 377.5MB. Free memory was 301.0MB in the beginning and 297.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 17659.24ms. Allocated memory was 377.5MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 297.9MB in the beginning and 7.0GB in the end (delta: -6.7GB). Peak memory consumption was 927.4MB. Max. memory is 16.0GB. * TraceAbstraction took 556562.26ms. Allocated memory was 7.8GB in the beginning and 9.1GB in the end (delta: 1.3GB). Free memory was 7.0GB in the beginning and 4.9GB in the end (delta: 2.1GB). Peak memory consumption was 3.4GB. 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: 492.3s, 343 PlacesBefore, 253 PlacesAfterwards, 336 TransitionsBefore, 243 TransitionsAfterwards, 45544 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 146 TotalNumberOfCompositions, 391059 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63902, independent: 61328, independent conditional: 0, independent unconditional: 61328, dependent: 2574, dependent conditional: 0, dependent unconditional: 2574, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 12727, independent: 12391, independent conditional: 0, independent unconditional: 12391, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 63902, independent: 48937, independent conditional: 0, independent unconditional: 48937, dependent: 2238, dependent conditional: 0, dependent unconditional: 2238, unknown: 12727, unknown conditional: 0, unknown unconditional: 12727] , Statistics on independence cache: Total cache size (in pairs): 4165, Positive cache size: 3864, Positive conditional cache size: 0, Positive unconditional cache size: 3864, Negative cache size: 301, Negative conditional cache size: 0, Negative unconditional cache size: 301, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108, ((void *)0), P0, ((void *)0))=7, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109, ((void *)0), P1, ((void *)0))=8, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110, ((void *)0), P2, ((void *)0))=9, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] EXPR 3 y$w_buff1_used && y$w_buff0_used [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L755] EXPR 1 __unbuffered_cnt + 1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 [L770] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 [L772] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] EXPR 2 __unbuffered_cnt + 1 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 [L805] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 [L807] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L810] EXPR 3 __unbuffered_cnt + 1 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] EXPR 0 __unbuffered_cnt == 3 [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] 0 assume_abort_if_not(main$tmp_guard0) [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 [L838] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 [L840] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] EXPR 0 !y$w_buff0_used [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 y == 2 [L854] EXPR 0 y == 2 && __unbuffered_p0_EAX == 0 [L854] EXPR 0 __unbuffered_p0_EAX == 0 [L854] EXPR 0 y == 2 && __unbuffered_p0_EAX == 0 [L854] EXPR 0 y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 [L854] EXPR 0 __unbuffered_p2_EAX == 1 [L854] EXPR 0 y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 [L854] EXPR 0 y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 [L854] EXPR 0 __unbuffered_p2_EBX == 0 [L854] EXPR 0 y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L858] 0 __VERIFIER_assert(main$tmp_guard1) [L858] 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", "mix042.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:55}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 755]: 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: 765]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 768]: 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: 769]: 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: 769]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 771]: 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: 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: 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: 775]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 783]: 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: 784]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 786]: 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: 787]: 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: 788]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 788]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 789]: 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: 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: 800]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 800]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 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: 805]: 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: 805]: 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: 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: 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: 807]: 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: 807]: 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: 807]: 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: 832]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 843]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 850]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 851]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 858]: 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 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: 828]: 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: 830]: 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 7 procedures, 455 locations, 315 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: 554.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 46.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 493.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 753 IncrementalHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 0 mSDtfsCounter, 753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=495occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 1100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:13:09,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...