/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 PROGRAM_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/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 01:37:28,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 01:37:28,097 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-26 01:37:28,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 01:37:28,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 01:37:28,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 01:37:28,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 01:37:28,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 01:37:28,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 01:37:28,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 01:37:28,138 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 01:37:28,139 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 01:37:28,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 01:37:28,140 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 01:37:28,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 01:37:28,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 01:37:28,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 01:37:28,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 01:37:28,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 01:37:28,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 01:37:28,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 01:37:28,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 01:37:28,142 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 01:37:28,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 01:37:28,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 01:37:28,143 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 01:37:28,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 01:37:28,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 01:37:28,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 01:37:28,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 01:37:28,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 01:37:28,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 01:37:28,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 01:37:28,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 01:37:28,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 01:37:28,146 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 -> PROGRAM_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-26 01:37:28,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 01:37:28,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 01:37:28,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 01:37:28,459 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 01:37:28,460 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 01:37:28,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 01:37:29,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 01:37:29,949 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 01:37:29,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 01:37:29,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e1fe6511/7f1ef78558af4b46a2dc2d9b5b74fd56/FLAG418b5df85 [2023-08-26 01:37:29,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e1fe6511/7f1ef78558af4b46a2dc2d9b5b74fd56 [2023-08-26 01:37:29,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 01:37:29,978 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 01:37:29,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 01:37:29,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 01:37:29,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 01:37:29,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:37:29" (1/1) ... [2023-08-26 01:37:29,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4033211f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:29, skipping insertion in model container [2023-08-26 01:37:29,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:37:29" (1/1) ... [2023-08-26 01:37:30,034 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 01:37:30,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 01:37:30,447 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 01:37:30,478 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 01:37:30,479 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 01:37:30,543 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 01:37:30,574 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 01:37:30,575 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 01:37:30,581 INFO L206 MainTranslator]: Completed translation [2023-08-26 01:37:30,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30 WrapperNode [2023-08-26 01:37:30,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 01:37:30,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 01:37:30,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 01:37:30,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 01:37:30,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,701 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 933 [2023-08-26 01:37:30,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 01:37:30,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 01:37:30,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 01:37:30,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 01:37:30,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 01:37:30,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 01:37:30,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 01:37:30,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 01:37:30,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (1/1) ... [2023-08-26 01:37:30,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 01:37:30,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 01:37:30,778 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-26 01:37:30,790 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-26 01:37:30,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 01:37:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 01:37:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 01:37:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 01:37:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 01:37:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 01:37:30,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 01:37:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 01:37:30,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 01:37:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 01:37:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 01:37:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 01:37:30,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 01:37:30,822 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 01:37:30,975 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 01:37:30,977 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 01:37:31,937 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 01:37:58,435 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 01:37:58,435 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 01:37:58,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:37:58 BoogieIcfgContainer [2023-08-26 01:37:58,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 01:37:58,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 01:37:58,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 01:37:58,442 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 01:37:58,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:37:29" (1/3) ... [2023-08-26 01:37:58,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29171802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:37:58, skipping insertion in model container [2023-08-26 01:37:58,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:37:30" (2/3) ... [2023-08-26 01:37:58,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29171802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:37:58, skipping insertion in model container [2023-08-26 01:37:58,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:37:58" (3/3) ... [2023-08-26 01:37:58,445 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-26 01:37:58,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 01:37:58,459 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 214 error locations. [2023-08-26 01:37:58,459 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 01:38:00,917 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 01:38:00,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 311 transitions, 632 flow [2023-08-26 01:38:04,902 INFO L124 PetriNetUnfolderBase]: 3/309 cut-off events. [2023-08-26 01:38:04,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 01:38:04,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 309 events. 3/309 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 1824 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 273. Up to 2 conditions per place. [2023-08-26 01:38:04,913 INFO L82 GeneralOperation]: Start removeDead. Operand has 315 places, 311 transitions, 632 flow [2023-08-26 01:38:04,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 309 transitions, 624 flow [2023-08-26 01:38:04,928 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 01:38:04,935 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 313 places, 309 transitions, 624 flow [2023-08-26 01:38:04,938 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 313 places, 309 transitions, 624 flow [2023-08-26 01:38:04,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 313 places, 309 transitions, 624 flow [2023-08-26 01:38:08,355 INFO L124 PetriNetUnfolderBase]: 3/309 cut-off events. [2023-08-26 01:38:08,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 01:38:08,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 309 events. 3/309 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 1821 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 273. Up to 2 conditions per place. [2023-08-26 01:38:08,371 INFO L119 LiptonReduction]: Number of co-enabled transitions 37896 [2023-08-26 01:40:16,497 WARN L234 SmtUtils]: Spent 2.11m on a formula simplification. DAG size of input: 9896 DAG size of output: 985 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:40:21,768 WARN L234 SmtUtils]: Spent 5.25s on a formula simplification. DAG size of input: 909 DAG size of output: 905 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:44:22,686 WARN L234 SmtUtils]: Spent 4.01m on a formula simplification. DAG size of input: 12141 DAG size of output: 1312 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:44:32,908 WARN L234 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 1223 DAG size of output: 1220 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:44:49,231 WARN L234 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 910 DAG size of output: 871 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:45:07,053 WARN L234 SmtUtils]: Spent 15.27s on a formula simplification. DAG size of input: 1225 DAG size of output: 1174 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:45:33,248 WARN L234 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 922 DAG size of output: 904 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:45:46,411 WARN L234 SmtUtils]: Spent 10.27s on a formula simplification. DAG size of input: 1237 DAG size of output: 1225 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:45:51,596 WARN L234 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 1224 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-08-26 01:45:52,267 INFO L134 LiptonReduction]: Checked pairs total: 399449 [2023-08-26 01:45:52,268 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-26 01:45:52,278 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 01:45:52,282 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;@72b08094, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 01:45:52,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 299 error locations. [2023-08-26 01:45:52,284 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 01:45:52,284 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-26 01:45:52,284 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 01:45:52,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:45:52,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 01:45:52,285 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONDATA_RACE === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:45:52,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:45:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash 5216224, now seen corresponding path program 1 times [2023-08-26 01:45:52,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:45:52,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151206649] [2023-08-26 01:45:52,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:45:52,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:45:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:45:52,592 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-26 01:45:52,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:45:52,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151206649] [2023-08-26 01:45:52,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151206649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:45:52,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:45:52,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 01:45:52,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339456688] [2023-08-26 01:45:52,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:45:52,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 01:45:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:45:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 01:45:52,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 01:45:52,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 469 [2023-08-26 01:45:52,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 230 transitions, 466 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-26 01:45:52,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:45:52,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 469 [2023-08-26 01:45:52,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:45:54,399 INFO L124 PetriNetUnfolderBase]: 264/450 cut-off events. [2023-08-26 01:45:54,399 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 01:45:54,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 450 events. 264/450 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1631 event pairs, 264 based on Foata normal form. 0/390 useless extension candidates. Maximal degree in co-relation 906. Up to 451 conditions per place. [2023-08-26 01:45:54,403 INFO L140 encePairwiseOnDemand]: 257/469 looper letters, 18 selfloop transitions, 0 changer transitions 0/18 dead transitions. [2023-08-26 01:45:54,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 18 transitions, 78 flow [2023-08-26 01:45:54,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 01:45:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 01:45:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 392 transitions. [2023-08-26 01:45:54,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.417910447761194 [2023-08-26 01:45:54,415 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 392 transitions. [2023-08-26 01:45:54,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 392 transitions. [2023-08-26 01:45:54,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:45:54,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 392 transitions. [2023-08-26 01:45:54,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 196.0) internal successors, (392), 2 states have internal predecessors, (392), 0 states have call successors, (0), 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-26 01:45:54,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 469.0) internal successors, (1407), 3 states have internal predecessors, (1407), 0 states have call successors, (0), 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-26 01:45:54,425 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 469.0) internal successors, (1407), 3 states have internal predecessors, (1407), 0 states have call successors, (0), 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-26 01:45:54,427 INFO L175 Difference]: Start difference. First operand has 237 places, 230 transitions, 466 flow. Second operand 2 states and 392 transitions. [2023-08-26 01:45:54,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 18 transitions, 78 flow [2023-08-26 01:45:54,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 18 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 01:45:54,430 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 40 flow [2023-08-26 01:45:54,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2023-08-26 01:45:54,434 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -213 predicate places. [2023-08-26 01:45:54,434 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 40 flow [2023-08-26 01:45:54,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 0 states have call successors, (0), 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-26 01:45:54,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:45:54,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 01:45:54,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 01:45:54,435 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:45:54,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:45:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash 718064115, now seen corresponding path program 1 times [2023-08-26 01:45:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:45:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879019455] [2023-08-26 01:45:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:45:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:45:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:45:54,710 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-26 01:45:54,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:45:54,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879019455] [2023-08-26 01:45:54,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879019455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:45:54,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:45:54,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 01:45:54,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505004132] [2023-08-26 01:45:54,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:45:54,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 01:45:54,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:45:54,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 01:45:54,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 01:45:54,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 469 [2023-08-26 01:45:54,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-26 01:45:54,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:45:54,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 469 [2023-08-26 01:45:54,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:45:55,981 INFO L124 PetriNetUnfolderBase]: 224/385 cut-off events. [2023-08-26 01:45:55,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 01:45:55,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 385 events. 224/385 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1416 event pairs, 24 based on Foata normal form. 0/355 useless extension candidates. Maximal degree in co-relation 782. Up to 326 conditions per place. [2023-08-26 01:45:55,985 INFO L140 encePairwiseOnDemand]: 466/469 looper letters, 21 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2023-08-26 01:45:55,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 25 transitions, 104 flow [2023-08-26 01:45:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 01:45:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 01:45:55,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2023-08-26 01:45:55,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1890547263681592 [2023-08-26 01:45:55,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 266 transitions. [2023-08-26 01:45:55,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 266 transitions. [2023-08-26 01:45:55,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:45:55,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 266 transitions. [2023-08-26 01:45:55,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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-26 01:45:55,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 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-26 01:45:56,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 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-26 01:45:56,002 INFO L175 Difference]: Start difference. First operand has 24 places, 18 transitions, 40 flow. Second operand 3 states and 266 transitions. [2023-08-26 01:45:56,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 25 transitions, 104 flow [2023-08-26 01:45:56,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 01:45:56,004 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-26 01:45:56,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-26 01:45:56,010 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -212 predicate places. [2023-08-26 01:45:56,010 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-26 01:45:56,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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-26 01:45:56,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:45:56,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:45:56,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 01:45:56,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:45:56,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:45:56,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1429877395, now seen corresponding path program 1 times [2023-08-26 01:45:56,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:45:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628895211] [2023-08-26 01:45:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:45:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:45:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:45:56,405 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-26 01:45:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:45:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628895211] [2023-08-26 01:45:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628895211] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:45:56,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:45:56,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 01:45:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479689140] [2023-08-26 01:45:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:45:56,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 01:45:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:45:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 01:45:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 01:45:56,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 469 [2023-08-26 01:45:56,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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-26 01:45:56,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:45:56,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 469 [2023-08-26 01:45:56,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:45:57,000 INFO L124 PetriNetUnfolderBase]: 157/278 cut-off events. [2023-08-26 01:45:57,000 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-26 01:45:57,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 278 events. 157/278 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 897 event pairs, 53 based on Foata normal form. 10/288 useless extension candidates. Maximal degree in co-relation 584. Up to 200 conditions per place. [2023-08-26 01:45:57,002 INFO L140 encePairwiseOnDemand]: 466/469 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-26 01:45:57,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 96 flow [2023-08-26 01:45:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 01:45:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 01:45:57,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2023-08-26 01:45:57,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1869225302061123 [2023-08-26 01:45:57,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 263 transitions. [2023-08-26 01:45:57,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 263 transitions. [2023-08-26 01:45:57,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:45:57,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 263 transitions. [2023-08-26 01:45:57,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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-26 01:45:57,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 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-26 01:45:57,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 469.0) internal successors, (1876), 4 states have internal predecessors, (1876), 0 states have call successors, (0), 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-26 01:45:57,008 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 3 states and 263 transitions. [2023-08-26 01:45:57,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 96 flow [2023-08-26 01:45:57,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 01:45:57,009 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 44 flow [2023-08-26 01:45:57,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-26 01:45:57,010 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -212 predicate places. [2023-08-26 01:45:57,010 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 44 flow [2023-08-26 01:45:57,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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-26 01:45:57,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:45:57,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:45:57,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 01:45:57,011 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:45:57,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:45:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash 220310019, now seen corresponding path program 1 times [2023-08-26 01:45:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:45:57,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524270668] [2023-08-26 01:45:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:45:57,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:45:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:45:58,653 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-26 01:45:58,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:45:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524270668] [2023-08-26 01:45:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524270668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:45:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:45:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 01:45:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847163748] [2023-08-26 01:45:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:45:58,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 01:45:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:45:58,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 01:45:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 01:45:58,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 469 [2023-08-26 01:45:58,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 44 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 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-26 01:45:58,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:45:58,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 469 [2023-08-26 01:45:58,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:45:59,249 INFO L124 PetriNetUnfolderBase]: 149/266 cut-off events. [2023-08-26 01:45:59,249 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-26 01:45:59,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 266 events. 149/266 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 849 event pairs, 53 based on Foata normal form. 4/270 useless extension candidates. Maximal degree in co-relation 591. Up to 213 conditions per place. [2023-08-26 01:45:59,251 INFO L140 encePairwiseOnDemand]: 464/469 looper letters, 25 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-26 01:45:59,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 137 flow [2023-08-26 01:45:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 01:45:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 01:45:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2023-08-26 01:45:59,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17430703624733476 [2023-08-26 01:45:59,255 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 327 transitions. [2023-08-26 01:45:59,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 327 transitions. [2023-08-26 01:45:59,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:45:59,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 327 transitions. [2023-08-26 01:45:59,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 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-26 01:45:59,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 469.0) internal successors, (2345), 5 states have internal predecessors, (2345), 0 states have call successors, (0), 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-26 01:45:59,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 469.0) internal successors, (2345), 5 states have internal predecessors, (2345), 0 states have call successors, (0), 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-26 01:45:59,260 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 44 flow. Second operand 4 states and 327 transitions. [2023-08-26 01:45:59,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 137 flow [2023-08-26 01:45:59,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 01:45:59,262 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 72 flow [2023-08-26 01:45:59,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-08-26 01:45:59,263 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -209 predicate places. [2023-08-26 01:45:59,263 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 72 flow [2023-08-26 01:45:59,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 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-26 01:45:59,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:45:59,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:45:59,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 01:45:59,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:45:59,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:45:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash -507660789, now seen corresponding path program 1 times [2023-08-26 01:45:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:45:59,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757896204] [2023-08-26 01:45:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:45:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:45:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:46:00,150 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-26 01:46:00,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:46:00,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757896204] [2023-08-26 01:46:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757896204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:46:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:46:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 01:46:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339731185] [2023-08-26 01:46:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:46:00,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 01:46:00,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:46:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 01:46:00,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 01:46:00,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 469 [2023-08-26 01:46:00,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 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-26 01:46:00,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:46:00,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 469 [2023-08-26 01:46:00,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:46:01,003 INFO L124 PetriNetUnfolderBase]: 165/292 cut-off events. [2023-08-26 01:46:01,003 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-26 01:46:01,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 292 events. 165/292 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 969 event pairs, 27 based on Foata normal form. 2/294 useless extension candidates. Maximal degree in co-relation 732. Up to 235 conditions per place. [2023-08-26 01:46:01,006 INFO L140 encePairwiseOnDemand]: 462/469 looper letters, 28 selfloop transitions, 9 changer transitions 0/37 dead transitions. [2023-08-26 01:46:01,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 187 flow [2023-08-26 01:46:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 01:46:01,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 01:46:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 405 transitions. [2023-08-26 01:46:01,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17270788912579957 [2023-08-26 01:46:01,009 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 405 transitions. [2023-08-26 01:46:01,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 405 transitions. [2023-08-26 01:46:01,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:46:01,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 405 transitions. [2023-08-26 01:46:01,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 0 states have call successors, (0), 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-26 01:46:01,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 469.0) internal successors, (2814), 6 states have internal predecessors, (2814), 0 states have call successors, (0), 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-26 01:46:01,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 469.0) internal successors, (2814), 6 states have internal predecessors, (2814), 0 states have call successors, (0), 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-26 01:46:01,015 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 72 flow. Second operand 5 states and 405 transitions. [2023-08-26 01:46:01,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 187 flow [2023-08-26 01:46:01,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 187 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 01:46:01,018 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 121 flow [2023-08-26 01:46:01,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-08-26 01:46:01,020 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -203 predicate places. [2023-08-26 01:46:01,020 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 121 flow [2023-08-26 01:46:01,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 0 states have call successors, (0), 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-26 01:46:01,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:46:01,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:46:01,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 01:46:01,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:46:01,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:46:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -693556629, now seen corresponding path program 2 times [2023-08-26 01:46:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:46:01,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480792050] [2023-08-26 01:46:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:46:01,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:46:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:46:02,177 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-26 01:46:02,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:46:02,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480792050] [2023-08-26 01:46:02,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480792050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:46:02,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:46:02,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 01:46:02,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830084423] [2023-08-26 01:46:02,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:46:02,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 01:46:02,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:46:02,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 01:46:02,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 01:46:02,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 469 [2023-08-26 01:46:02,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 01:46:02,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:46:02,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 469 [2023-08-26 01:46:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:46:03,068 INFO L124 PetriNetUnfolderBase]: 189/337 cut-off events. [2023-08-26 01:46:03,068 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2023-08-26 01:46:03,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 337 events. 189/337 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1197 event pairs, 26 based on Foata normal form. 6/343 useless extension candidates. Maximal degree in co-relation 1016. Up to 238 conditions per place. [2023-08-26 01:46:03,070 INFO L140 encePairwiseOnDemand]: 462/469 looper letters, 35 selfloop transitions, 11 changer transitions 0/46 dead transitions. [2023-08-26 01:46:03,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 46 transitions, 284 flow [2023-08-26 01:46:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 01:46:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 01:46:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 478 transitions. [2023-08-26 01:46:03,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.16986496090973702 [2023-08-26 01:46:03,074 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 478 transitions. [2023-08-26 01:46:03,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 478 transitions. [2023-08-26 01:46:03,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:46:03,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 478 transitions. [2023-08-26 01:46:03,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 79.66666666666667) internal successors, (478), 6 states have internal predecessors, (478), 0 states have call successors, (0), 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-26 01:46:03,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 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-26 01:46:03,080 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 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-26 01:46:03,080 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 121 flow. Second operand 6 states and 478 transitions. [2023-08-26 01:46:03,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 46 transitions, 284 flow [2023-08-26 01:46:03,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 274 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 01:46:03,084 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 172 flow [2023-08-26 01:46:03,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-26 01:46:03,086 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -197 predicate places. [2023-08-26 01:46:03,086 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 172 flow [2023-08-26 01:46:03,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 01:46:03,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:46:03,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:46:03,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 01:46:03,089 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:46:03,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:46:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash -502447209, now seen corresponding path program 3 times [2023-08-26 01:46:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:46:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079538802] [2023-08-26 01:46:03,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:46:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:46:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:46:04,017 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-26 01:46:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:46:04,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079538802] [2023-08-26 01:46:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079538802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:46:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:46:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 01:46:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541838845] [2023-08-26 01:46:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:46:04,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 01:46:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:46:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 01:46:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 01:46:04,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 469 [2023-08-26 01:46:04,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 0 states have call successors, (0), 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-26 01:46:04,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:46:04,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 469 [2023-08-26 01:46:04,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:46:04,883 INFO L124 PetriNetUnfolderBase]: 193/347 cut-off events. [2023-08-26 01:46:04,883 INFO L125 PetriNetUnfolderBase]: For 547/547 co-relation queries the response was YES. [2023-08-26 01:46:04,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 347 events. 193/347 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1270 event pairs, 23 based on Foata normal form. 4/351 useless extension candidates. Maximal degree in co-relation 1173. Up to 249 conditions per place. [2023-08-26 01:46:04,885 INFO L140 encePairwiseOnDemand]: 462/469 looper letters, 31 selfloop transitions, 18 changer transitions 0/49 dead transitions. [2023-08-26 01:46:04,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 353 flow [2023-08-26 01:46:04,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 01:46:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 01:46:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 558 transitions. [2023-08-26 01:46:04,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1699664940603107 [2023-08-26 01:46:04,890 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 558 transitions. [2023-08-26 01:46:04,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 558 transitions. [2023-08-26 01:46:04,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:46:04,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 558 transitions. [2023-08-26 01:46:04,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 79.71428571428571) internal successors, (558), 7 states have internal predecessors, (558), 0 states have call successors, (0), 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-26 01:46:04,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 469.0) internal successors, (3752), 8 states have internal predecessors, (3752), 0 states have call successors, (0), 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-26 01:46:04,896 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 469.0) internal successors, (3752), 8 states have internal predecessors, (3752), 0 states have call successors, (0), 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-26 01:46:04,896 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 172 flow. Second operand 7 states and 558 transitions. [2023-08-26 01:46:04,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 353 flow [2023-08-26 01:46:04,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 318 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-26 01:46:04,900 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 233 flow [2023-08-26 01:46:04,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=233, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 01:46:04,900 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -193 predicate places. [2023-08-26 01:46:04,901 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 233 flow [2023-08-26 01:46:04,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.83333333333333) internal successors, (455), 6 states have internal predecessors, (455), 0 states have call successors, (0), 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-26 01:46:04,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:46:04,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:46:04,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 01:46:04,901 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:46:04,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:46:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 342494154, now seen corresponding path program 1 times [2023-08-26 01:46:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:46:04,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084311426] [2023-08-26 01:46:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:46:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:46:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:46:05,467 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-26 01:46:05,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:46:05,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084311426] [2023-08-26 01:46:05,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084311426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:46:05,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:46:05,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 01:46:05,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297465863] [2023-08-26 01:46:05,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:46:05,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 01:46:05,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:46:05,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 01:46:05,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 01:46:05,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 469 [2023-08-26 01:46:05,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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-26 01:46:05,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:46:05,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 469 [2023-08-26 01:46:05,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:46:06,211 INFO L124 PetriNetUnfolderBase]: 121/251 cut-off events. [2023-08-26 01:46:06,211 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2023-08-26 01:46:06,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 251 events. 121/251 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 982 event pairs, 19 based on Foata normal form. 41/292 useless extension candidates. Maximal degree in co-relation 866. Up to 101 conditions per place. [2023-08-26 01:46:06,213 INFO L140 encePairwiseOnDemand]: 464/469 looper letters, 37 selfloop transitions, 4 changer transitions 33/74 dead transitions. [2023-08-26 01:46:06,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 608 flow [2023-08-26 01:46:06,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 01:46:06,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 01:46:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 428 transitions. [2023-08-26 01:46:06,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18251599147121536 [2023-08-26 01:46:06,216 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 428 transitions. [2023-08-26 01:46:06,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 428 transitions. [2023-08-26 01:46:06,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:46:06,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 428 transitions. [2023-08-26 01:46:06,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.6) internal successors, (428), 5 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-26 01:46:06,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 469.0) internal successors, (2814), 6 states have internal predecessors, (2814), 0 states have call successors, (0), 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-26 01:46:06,220 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 469.0) internal successors, (2814), 6 states have internal predecessors, (2814), 0 states have call successors, (0), 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-26 01:46:06,220 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 233 flow. Second operand 5 states and 428 transitions. [2023-08-26 01:46:06,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 608 flow [2023-08-26 01:46:06,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 74 transitions, 568 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-26 01:46:06,223 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 203 flow [2023-08-26 01:46:06,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-08-26 01:46:06,224 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -191 predicate places. [2023-08-26 01:46:06,224 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 203 flow [2023-08-26 01:46:06,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 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-26 01:46:06,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:46:06,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:46:06,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 01:46:06,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:46:06,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:46:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash -343624169, now seen corresponding path program 1 times [2023-08-26 01:46:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:46:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163836718] [2023-08-26 01:46:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:46:06,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:46:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:46:06,830 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-26 01:46:06,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:46:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163836718] [2023-08-26 01:46:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163836718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:46:06,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:46:06,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 01:46:06,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798206948] [2023-08-26 01:46:06,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:46:06,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 01:46:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:46:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 01:46:06,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 01:46:06,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 469 [2023-08-26 01:46:06,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 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-26 01:46:06,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:46:06,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 469 [2023-08-26 01:46:06,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:46:07,289 INFO L124 PetriNetUnfolderBase]: 47/116 cut-off events. [2023-08-26 01:46:07,289 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2023-08-26 01:46:07,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 116 events. 47/116 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 342 event pairs, 14 based on Foata normal form. 14/130 useless extension candidates. Maximal degree in co-relation 444. Up to 57 conditions per place. [2023-08-26 01:46:07,290 INFO L140 encePairwiseOnDemand]: 464/469 looper letters, 35 selfloop transitions, 6 changer transitions 12/53 dead transitions. [2023-08-26 01:46:07,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 429 flow [2023-08-26 01:46:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 01:46:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 01:46:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 495 transitions. [2023-08-26 01:46:07,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17590618336886993 [2023-08-26 01:46:07,294 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 495 transitions. [2023-08-26 01:46:07,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 495 transitions. [2023-08-26 01:46:07,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:46:07,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 495 transitions. [2023-08-26 01:46:07,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 82.5) internal successors, (495), 6 states have internal predecessors, (495), 0 states have call successors, (0), 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-26 01:46:07,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 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-26 01:46:07,298 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 469.0) internal successors, (3283), 7 states have internal predecessors, (3283), 0 states have call successors, (0), 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-26 01:46:07,298 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 203 flow. Second operand 6 states and 495 transitions. [2023-08-26 01:46:07,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 429 flow [2023-08-26 01:46:07,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 393 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-26 01:46:07,301 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 202 flow [2023-08-26 01:46:07,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2023-08-26 01:46:07,301 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -188 predicate places. [2023-08-26 01:46:07,301 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 202 flow [2023-08-26 01:46:07,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 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-26 01:46:07,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:46:07,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:46:07,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 01:46:07,302 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:46:07,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:46:07,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1662078886, now seen corresponding path program 1 times [2023-08-26 01:46:07,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:46:07,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252345823] [2023-08-26 01:46:07,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:46:07,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:46:07,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 01:46:07,628 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-26 01:46:07,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 01:46:07,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252345823] [2023-08-26 01:46:07,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252345823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 01:46:07,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 01:46:07,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 01:46:07,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908314443] [2023-08-26 01:46:07,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 01:46:07,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 01:46:07,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 01:46:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 01:46:07,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 01:46:07,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 469 [2023-08-26 01:46:07,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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-26 01:46:07,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 01:46:07,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 469 [2023-08-26 01:46:07,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 01:46:07,966 INFO L124 PetriNetUnfolderBase]: 41/112 cut-off events. [2023-08-26 01:46:07,966 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2023-08-26 01:46:07,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 112 events. 41/112 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 356 event pairs, 4 based on Foata normal form. 1/113 useless extension candidates. Maximal degree in co-relation 446. Up to 69 conditions per place. [2023-08-26 01:46:07,967 INFO L140 encePairwiseOnDemand]: 466/469 looper letters, 23 selfloop transitions, 1 changer transitions 28/52 dead transitions. [2023-08-26 01:46:07,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 439 flow [2023-08-26 01:46:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 01:46:07,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 01:46:07,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-08-26 01:46:07,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1849680170575693 [2023-08-26 01:46:07,969 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-08-26 01:46:07,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-08-26 01:46:07,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 01:46:07,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-08-26 01:46:07,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 01:46:07,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 469.0) internal successors, (2345), 5 states have internal predecessors, (2345), 0 states have call successors, (0), 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-26 01:46:07,973 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 469.0) internal successors, (2345), 5 states have internal predecessors, (2345), 0 states have call successors, (0), 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-26 01:46:07,973 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 202 flow. Second operand 4 states and 347 transitions. [2023-08-26 01:46:07,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 439 flow [2023-08-26 01:46:07,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 403 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-08-26 01:46:07,975 INFO L231 Difference]: Finished difference. Result has 47 places, 22 transitions, 119 flow [2023-08-26 01:46:07,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=469, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=47, PETRI_TRANSITIONS=22} [2023-08-26 01:46:07,976 INFO L281 CegarLoopForPetriNet]: 237 programPoint places, -190 predicate places. [2023-08-26 01:46:07,976 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 22 transitions, 119 flow [2023-08-26 01:46:07,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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-26 01:46:07,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 01:46:07,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 01:46:07,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 01:46:07,977 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 295 more)] === [2023-08-26 01:46:07,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 01:46:07,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1386451198, now seen corresponding path program 2 times [2023-08-26 01:46:07,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 01:46:07,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286908338] [2023-08-26 01:46:07,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 01:46:07,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 01:46:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 01:46:08,190 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 01:46:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 01:46:08,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 01:46:08,509 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 01:46:08,510 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONASSERT (298 of 299 remaining) [2023-08-26 01:46:08,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (297 of 299 remaining) [2023-08-26 01:46:08,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (296 of 299 remaining) [2023-08-26 01:46:08,511 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (295 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (294 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONDATA_RACE (293 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6ASSERT_VIOLATIONDATA_RACE (292 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8ASSERT_VIOLATIONDATA_RACE (291 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7ASSERT_VIOLATIONDATA_RACE (290 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (289 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9ASSERT_VIOLATIONDATA_RACE (288 of 299 remaining) [2023-08-26 01:46:08,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10ASSERT_VIOLATIONDATA_RACE (287 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11ASSERT_VIOLATIONDATA_RACE (286 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12ASSERT_VIOLATIONDATA_RACE (285 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13ASSERT_VIOLATIONDATA_RACE (284 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14ASSERT_VIOLATIONDATA_RACE (283 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15ASSERT_VIOLATIONDATA_RACE (282 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err16ASSERT_VIOLATIONDATA_RACE (281 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err17ASSERT_VIOLATIONDATA_RACE (280 of 299 remaining) [2023-08-26 01:46:08,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err18ASSERT_VIOLATIONDATA_RACE (279 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err19ASSERT_VIOLATIONDATA_RACE (278 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err20ASSERT_VIOLATIONDATA_RACE (277 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err21ASSERT_VIOLATIONDATA_RACE (276 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err22ASSERT_VIOLATIONDATA_RACE (275 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err23ASSERT_VIOLATIONDATA_RACE (274 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err24ASSERT_VIOLATIONDATA_RACE (273 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err25ASSERT_VIOLATIONDATA_RACE (272 of 299 remaining) [2023-08-26 01:46:08,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err26ASSERT_VIOLATIONDATA_RACE (271 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err27ASSERT_VIOLATIONDATA_RACE (270 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err28ASSERT_VIOLATIONDATA_RACE (269 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err29ASSERT_VIOLATIONDATA_RACE (268 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err30ASSERT_VIOLATIONDATA_RACE (267 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err31ASSERT_VIOLATIONDATA_RACE (266 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (265 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (264 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (263 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (262 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (261 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONDATA_RACE (260 of 299 remaining) [2023-08-26 01:46:08,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONDATA_RACE (259 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONDATA_RACE (258 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONASSERT (257 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONDATA_RACE (256 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONDATA_RACE (255 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONDATA_RACE (254 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONDATA_RACE (253 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONDATA_RACE (252 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONDATA_RACE (251 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONDATA_RACE (250 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONDATA_RACE (249 of 299 remaining) [2023-08-26 01:46:08,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONDATA_RACE (248 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONDATA_RACE (247 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONDATA_RACE (246 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONDATA_RACE (245 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONDATA_RACE (244 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONDATA_RACE (243 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONDATA_RACE (242 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONDATA_RACE (241 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONDATA_RACE (240 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONDATA_RACE (239 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONDATA_RACE (238 of 299 remaining) [2023-08-26 01:46:08,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONDATA_RACE (237 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONDATA_RACE (236 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONDATA_RACE (235 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONDATA_RACE (234 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err32ASSERT_VIOLATIONDATA_RACE (233 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err33ASSERT_VIOLATIONDATA_RACE (232 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err34ASSERT_VIOLATIONDATA_RACE (231 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err35ASSERT_VIOLATIONDATA_RACE (230 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err36ASSERT_VIOLATIONDATA_RACE (229 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err37ASSERT_VIOLATIONDATA_RACE (228 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err38ASSERT_VIOLATIONDATA_RACE (227 of 299 remaining) [2023-08-26 01:46:08,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err39ASSERT_VIOLATIONDATA_RACE (226 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err40ASSERT_VIOLATIONDATA_RACE (225 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err41ASSERT_VIOLATIONDATA_RACE (224 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err42ASSERT_VIOLATIONDATA_RACE (223 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err43ASSERT_VIOLATIONDATA_RACE (222 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err44ASSERT_VIOLATIONDATA_RACE (221 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err45ASSERT_VIOLATIONDATA_RACE (220 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err46ASSERT_VIOLATIONDATA_RACE (219 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err47ASSERT_VIOLATIONDATA_RACE (218 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err48ASSERT_VIOLATIONDATA_RACE (217 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err49ASSERT_VIOLATIONDATA_RACE (216 of 299 remaining) [2023-08-26 01:46:08,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err50ASSERT_VIOLATIONDATA_RACE (215 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (214 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (213 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (212 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (211 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (210 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (209 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (208 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (207 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (206 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (205 of 299 remaining) [2023-08-26 01:46:08,522 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (204 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (203 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (202 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (201 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (200 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (199 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (198 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (197 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (196 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (195 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (194 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (193 of 299 remaining) [2023-08-26 01:46:08,523 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (192 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (191 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (190 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (189 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (188 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (187 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (186 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (185 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (184 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (183 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (182 of 299 remaining) [2023-08-26 01:46:08,524 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (181 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (180 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (179 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (178 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (177 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (176 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (175 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (174 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (173 of 299 remaining) [2023-08-26 01:46:08,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONDATA_RACE (172 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONDATA_RACE (171 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONDATA_RACE (170 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONDATA_RACE (169 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONDATA_RACE (168 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONDATA_RACE (167 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONDATA_RACE (166 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONDATA_RACE (165 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONDATA_RACE (164 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONDATA_RACE (163 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONDATA_RACE (162 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONDATA_RACE (161 of 299 remaining) [2023-08-26 01:46:08,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONDATA_RACE (160 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONDATA_RACE (159 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONDATA_RACE (158 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONDATA_RACE (157 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONDATA_RACE (156 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONDATA_RACE (155 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONDATA_RACE (154 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONDATA_RACE (153 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONDATA_RACE (152 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONDATA_RACE (151 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONDATA_RACE (150 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONDATA_RACE (149 of 299 remaining) [2023-08-26 01:46:08,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONDATA_RACE (148 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONDATA_RACE (147 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONDATA_RACE (146 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONDATA_RACE (145 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONDATA_RACE (144 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONDATA_RACE (143 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72ASSERT_VIOLATIONDATA_RACE (142 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONDATA_RACE (141 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONDATA_RACE (140 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONDATA_RACE (139 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONDATA_RACE (138 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONDATA_RACE (137 of 299 remaining) [2023-08-26 01:46:08,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONDATA_RACE (136 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONDATA_RACE (135 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONDATA_RACE (134 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONDATA_RACE (133 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONDATA_RACE (132 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONDATA_RACE (131 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONDATA_RACE (130 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONDATA_RACE (129 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONDATA_RACE (128 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONDATA_RACE (127 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONDATA_RACE (126 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONDATA_RACE (125 of 299 remaining) [2023-08-26 01:46:08,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONDATA_RACE (124 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONDATA_RACE (123 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONDATA_RACE (122 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94ASSERT_VIOLATIONDATA_RACE (121 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95ASSERT_VIOLATIONDATA_RACE (120 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONDATA_RACE (119 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96ASSERT_VIOLATIONDATA_RACE (118 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97ASSERT_VIOLATIONDATA_RACE (117 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONDATA_RACE (116 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONDATA_RACE (115 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONDATA_RACE (114 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONDATA_RACE (113 of 299 remaining) [2023-08-26 01:46:08,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONDATA_RACE (112 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98ASSERT_VIOLATIONDATA_RACE (111 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105ASSERT_VIOLATIONDATA_RACE (110 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106ASSERT_VIOLATIONDATA_RACE (109 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONDATA_RACE (108 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONDATA_RACE (107 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108ASSERT_VIOLATIONDATA_RACE (106 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109ASSERT_VIOLATIONDATA_RACE (105 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONDATA_RACE (104 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112ASSERT_VIOLATIONDATA_RACE (103 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113ASSERT_VIOLATIONDATA_RACE (102 of 299 remaining) [2023-08-26 01:46:08,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONDATA_RACE (101 of 299 remaining) [2023-08-26 01:46:08,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONDATA_RACE (100 of 299 remaining) [2023-08-26 01:46:08,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115ASSERT_VIOLATIONDATA_RACE (99 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116ASSERT_VIOLATIONDATA_RACE (98 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117ASSERT_VIOLATIONDATA_RACE (97 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118ASSERT_VIOLATIONDATA_RACE (96 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONDATA_RACE (95 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120ASSERT_VIOLATIONDATA_RACE (94 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121ASSERT_VIOLATIONDATA_RACE (93 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONDATA_RACE (92 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONDATA_RACE (91 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONDATA_RACE (90 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONDATA_RACE (89 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONDATA_RACE (88 of 299 remaining) [2023-08-26 01:46:08,534 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONDATA_RACE (87 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONDATA_RACE (86 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONDATA_RACE (85 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (84 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (83 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONDATA_RACE (82 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONDATA_RACE (81 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONDATA_RACE (80 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONDATA_RACE (79 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5ASSERT_VIOLATIONDATA_RACE (78 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6ASSERT_VIOLATIONDATA_RACE (77 of 299 remaining) [2023-08-26 01:46:08,535 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8ASSERT_VIOLATIONDATA_RACE (76 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7ASSERT_VIOLATIONDATA_RACE (75 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONDATA_RACE (74 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9ASSERT_VIOLATIONDATA_RACE (73 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10ASSERT_VIOLATIONDATA_RACE (72 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11ASSERT_VIOLATIONDATA_RACE (71 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12ASSERT_VIOLATIONDATA_RACE (70 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13ASSERT_VIOLATIONDATA_RACE (69 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14ASSERT_VIOLATIONDATA_RACE (68 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15ASSERT_VIOLATIONDATA_RACE (67 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err16ASSERT_VIOLATIONDATA_RACE (66 of 299 remaining) [2023-08-26 01:46:08,536 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err17ASSERT_VIOLATIONDATA_RACE (65 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err18ASSERT_VIOLATIONDATA_RACE (64 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err19ASSERT_VIOLATIONDATA_RACE (63 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err20ASSERT_VIOLATIONDATA_RACE (62 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err21ASSERT_VIOLATIONDATA_RACE (61 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err22ASSERT_VIOLATIONDATA_RACE (60 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err23ASSERT_VIOLATIONDATA_RACE (59 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err24ASSERT_VIOLATIONDATA_RACE (58 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err25ASSERT_VIOLATIONDATA_RACE (57 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err26ASSERT_VIOLATIONDATA_RACE (56 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err27ASSERT_VIOLATIONDATA_RACE (55 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err28ASSERT_VIOLATIONDATA_RACE (54 of 299 remaining) [2023-08-26 01:46:08,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err29ASSERT_VIOLATIONDATA_RACE (53 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err30ASSERT_VIOLATIONDATA_RACE (52 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err31ASSERT_VIOLATIONDATA_RACE (51 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONDATA_RACE (50 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONDATA_RACE (49 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONDATA_RACE (48 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONDATA_RACE (47 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONDATA_RACE (46 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5ASSERT_VIOLATIONDATA_RACE (45 of 299 remaining) [2023-08-26 01:46:08,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6ASSERT_VIOLATIONDATA_RACE (44 of 299 remaining) [2023-08-26 01:46:08,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7ASSERT_VIOLATIONDATA_RACE (43 of 299 remaining) [2023-08-26 01:46:08,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err8ASSERT_VIOLATIONASSERT (42 of 299 remaining) [2023-08-26 01:46:08,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err9ASSERT_VIOLATIONDATA_RACE (41 of 299 remaining) [2023-08-26 01:46:08,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err10ASSERT_VIOLATIONDATA_RACE (40 of 299 remaining) [2023-08-26 01:46:08,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err11ASSERT_VIOLATIONDATA_RACE (39 of 299 remaining) [2023-08-26 01:46:08,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err12ASSERT_VIOLATIONDATA_RACE (38 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err13ASSERT_VIOLATIONDATA_RACE (37 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err14ASSERT_VIOLATIONDATA_RACE (36 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err15ASSERT_VIOLATIONDATA_RACE (35 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err16ASSERT_VIOLATIONDATA_RACE (34 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err17ASSERT_VIOLATIONDATA_RACE (33 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err18ASSERT_VIOLATIONDATA_RACE (32 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err19ASSERT_VIOLATIONDATA_RACE (31 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err20ASSERT_VIOLATIONDATA_RACE (30 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err21ASSERT_VIOLATIONDATA_RACE (29 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err22ASSERT_VIOLATIONDATA_RACE (28 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err23ASSERT_VIOLATIONDATA_RACE (27 of 299 remaining) [2023-08-26 01:46:08,542 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err24ASSERT_VIOLATIONDATA_RACE (26 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err25ASSERT_VIOLATIONDATA_RACE (25 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err27ASSERT_VIOLATIONDATA_RACE (24 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err26ASSERT_VIOLATIONDATA_RACE (23 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err28ASSERT_VIOLATIONDATA_RACE (22 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err29ASSERT_VIOLATIONDATA_RACE (21 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err30ASSERT_VIOLATIONDATA_RACE (20 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err31ASSERT_VIOLATIONDATA_RACE (19 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err32ASSERT_VIOLATIONDATA_RACE (18 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err33ASSERT_VIOLATIONDATA_RACE (17 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err34ASSERT_VIOLATIONDATA_RACE (16 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err35ASSERT_VIOLATIONDATA_RACE (15 of 299 remaining) [2023-08-26 01:46:08,543 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err36ASSERT_VIOLATIONDATA_RACE (14 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err37ASSERT_VIOLATIONDATA_RACE (13 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err38ASSERT_VIOLATIONDATA_RACE (12 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err39ASSERT_VIOLATIONDATA_RACE (11 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err40ASSERT_VIOLATIONDATA_RACE (10 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err41ASSERT_VIOLATIONDATA_RACE (9 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err42ASSERT_VIOLATIONDATA_RACE (8 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err43ASSERT_VIOLATIONDATA_RACE (7 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err44ASSERT_VIOLATIONDATA_RACE (6 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err45ASSERT_VIOLATIONDATA_RACE (5 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err46ASSERT_VIOLATIONDATA_RACE (4 of 299 remaining) [2023-08-26 01:46:08,544 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err47ASSERT_VIOLATIONDATA_RACE (3 of 299 remaining) [2023-08-26 01:46:08,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err48ASSERT_VIOLATIONDATA_RACE (2 of 299 remaining) [2023-08-26 01:46:08,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err49ASSERT_VIOLATIONDATA_RACE (1 of 299 remaining) [2023-08-26 01:46:08,545 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err50ASSERT_VIOLATIONDATA_RACE (0 of 299 remaining) [2023-08-26 01:46:08,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 01:46:08,545 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 01:46:08,557 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 01:46:08,557 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 01:46:08,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:46:08 BasicIcfg [2023-08-26 01:46:08,648 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 01:46:08,649 INFO L158 Benchmark]: Toolchain (without parser) took 518671.08ms. Allocated memory was 341.8MB in the beginning and 9.4GB in the end (delta: 9.0GB). Free memory was 299.6MB in the beginning and 7.8GB in the end (delta: -7.5GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-26 01:46:08,649 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 341.8MB. Free memory is still 318.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 01:46:08,649 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.62ms. Allocated memory is still 341.8MB. Free memory was 299.6MB in the beginning and 274.1MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 01:46:08,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.67ms. Allocated memory is still 341.8MB. Free memory was 274.1MB in the beginning and 316.0MB in the end (delta: -41.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.0GB. [2023-08-26 01:46:08,651 INFO L158 Benchmark]: Boogie Preprocessor took 46.56ms. Allocated memory is still 341.8MB. Free memory was 316.0MB in the beginning and 311.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 01:46:08,651 INFO L158 Benchmark]: RCFGBuilder took 27688.09ms. Allocated memory was 341.8MB in the beginning and 8.0GB in the end (delta: 7.6GB). Free memory was 311.8MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-26 01:46:08,652 INFO L158 Benchmark]: TraceAbstraction took 490208.87ms. Allocated memory was 8.0GB in the beginning and 9.4GB in the end (delta: 1.4GB). Free memory was 5.7GB in the beginning and 7.8GB in the end (delta: -2.1GB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 01:46:08,653 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 341.8MB. Free memory is still 318.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 602.62ms. Allocated memory is still 341.8MB. Free memory was 299.6MB in the beginning and 274.1MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 119.67ms. Allocated memory is still 341.8MB. Free memory was 274.1MB in the beginning and 316.0MB in the end (delta: -41.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.56ms. Allocated memory is still 341.8MB. Free memory was 316.0MB in the beginning and 311.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 27688.09ms. Allocated memory was 341.8MB in the beginning and 8.0GB in the end (delta: 7.6GB). Free memory was 311.8MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. * TraceAbstraction took 490208.87ms. Allocated memory was 8.0GB in the beginning and 9.4GB in the end (delta: 1.4GB). Free memory was 5.7GB in the beginning and 7.8GB in the end (delta: -2.1GB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 467.3s, 313 PlacesBefore, 237 PlacesAfterwards, 309 TransitionsBefore, 230 TransitionsAfterwards, 37896 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 106 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 158 TotalNumberOfCompositions, 399449 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59848, independent: 56901, independent conditional: 0, independent unconditional: 56901, dependent: 2947, dependent conditional: 0, dependent unconditional: 2947, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 11374, independent: 10955, independent conditional: 0, independent unconditional: 10955, dependent: 419, dependent conditional: 0, dependent unconditional: 419, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 59848, independent: 45946, independent conditional: 0, independent unconditional: 45946, dependent: 2528, dependent conditional: 0, dependent unconditional: 2528, unknown: 11374, unknown conditional: 0, unknown unconditional: 11374] , Statistics on independence cache: Total cache size (in pairs): 4920, Positive cache size: 4623, Positive conditional cache size: 0, Positive unconditional cache size: 4623, Negative cache size: 297, Negative conditional cache size: 0, Negative unconditional cache size: 297, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1091; [L803] FCALL, FORK 0 pthread_create(&t1091, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1091, ((void *)0), P0, ((void *)0))=-2, t1091={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 0 pthread_t t1092; [L805] FCALL, FORK 0 pthread_create(&t1092, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1092, ((void *)0), P1, ((void *)0))=-1, t1091={5:0}, t1092={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 2 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L764] EXPR 2 x$w_buff1_used && x$w_buff0_used [L764] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L740] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L743] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 [L746] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L746] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L747] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L747] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L748] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L748] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L749] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L750] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L750] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] EXPR 1 __unbuffered_cnt + 1 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L782] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L784] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] EXPR 2 __unbuffered_cnt + 1 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] EXPR 0 __unbuffered_cnt == 2 [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] 0 assume_abort_if_not(main$tmp_guard0) [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 [L811] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L813] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L815] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 x$flush_delayed = weak$$choice2 [L821] 0 x$mem_tmp = x [L822] EXPR 0 !x$w_buff0_used [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 [L822] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L822] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L823] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L823] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L824] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L824] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L825] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L825] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L826] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L827] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L828] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 0 x == 2 [L829] EXPR 0 x == 2 && __unbuffered_p1_EAX == 1 [L829] EXPR 0 __unbuffered_p1_EAX == 1 [L829] EXPR 0 x == 2 && __unbuffered_p1_EAX == 1 [L829] EXPR 0 x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 [L829] EXPR 0 __unbuffered_p1_EBX == 0 [L829] EXPR 0 x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 [L829] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L830] 0 x = x$flush_delayed ? x$mem_tmp : x [L831] 0 x$flush_delayed = (_Bool)0 [L833] 0 __VERIFIER_assert(main$tmp_guard1) [L833] 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", "mix041_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={53:54}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 740]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - 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: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - 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: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 749]: 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: 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: 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: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 764]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 764]: 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: 765]: 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: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 767]: 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: 771]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 781]: 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: 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: 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: 783]: 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: 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: 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: 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: 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: 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: 809]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 812]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 820]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 824]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 827]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 831]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 833]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: 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 5 procedures, 412 locations, 299 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: 487.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 471.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 596 IncrementalHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 0 mSDtfsCounter, 596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=0, InterpolantAutomatonStates: 45, 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.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 649 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-26 01:46:08,755 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...