/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.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 00:48:04,197 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 00:48:04,198 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 00:48:04,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 00:48:04,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 00:48:04,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 00:48:04,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 00:48:04,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 00:48:04,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 00:48:04,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 00:48:04,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 00:48:04,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 00:48:04,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 00:48:04,242 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 00:48:04,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 00:48:04,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 00:48:04,244 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 00:48:04,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 00:48:04,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 00:48:04,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 00:48:04,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 00:48:04,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 00:48:04,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 00:48:04,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 00:48:04,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 00:48:04,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 00:48:04,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 00:48:04,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 00:48:04,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 00:48:04,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 00:48:04,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 00:48:04,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 00:48:04,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 00:48:04,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 00:48:04,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 00:48:04,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 00:48:04,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 00:48:04,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 00:48:04,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 00:48:04,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 00:48:04,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 00:48:04,265 INFO L101 SettingsManager]: Beginning 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-01-28 00:48:04,286 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 00:48:04,286 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 00:48:04,287 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 00:48:04,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 00:48:04,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 00:48:04,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 00:48:04,288 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 00:48:04,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 00:48:04,288 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 00:48:04,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 00:48:04,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 00:48:04,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:48:04,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 00:48:04,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 00:48:04,291 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 00:48:04,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 00:48:04,291 INFO L138 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: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-01-28 00:48:04,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 00:48:04,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 00:48:04,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 00:48:04,483 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 00:48:04,484 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 00:48:04,484 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-01-28 00:48:05,571 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 00:48:05,811 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 00:48:05,811 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-01-28 00:48:05,834 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1668bf6/8a31f1809a53448abb9add7039aa057b/FLAGc4ce53706 [2023-01-28 00:48:06,162 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf1668bf6/8a31f1809a53448abb9add7039aa057b [2023-01-28 00:48:06,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 00:48:06,164 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 00:48:06,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 00:48:06,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 00:48:06,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 00:48:06,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fbe2d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06, skipping insertion in model container [2023-01-28 00:48:06,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 00:48:06,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 00:48:06,285 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i[995,1008] [2023-01-28 00:48:06,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:48:06,480 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 00:48:06,488 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i[995,1008] [2023-01-28 00:48:06,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 00:48:06,572 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:48:06,572 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 00:48:06,577 INFO L208 MainTranslator]: Completed translation [2023-01-28 00:48:06,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06 WrapperNode [2023-01-28 00:48:06,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 00:48:06,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 00:48:06,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 00:48:06,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 00:48:06,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,634 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2023-01-28 00:48:06,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 00:48:06,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 00:48:06,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 00:48:06,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 00:48:06,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,696 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 00:48:06,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 00:48:06,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 00:48:06,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 00:48:06,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (1/1) ... [2023-01-28 00:48:06,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 00:48:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 00:48:06,745 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-01-28 00:48:06,769 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-01-28 00:48:06,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 00:48:06,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 00:48:06,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 00:48:06,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 00:48:06,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 00:48:06,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 00:48:06,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 00:48:06,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 00:48:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 00:48:06,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 00:48:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 00:48:06,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 00:48:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 00:48:06,791 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 00:48:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 00:48:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 00:48:06,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 00:48:06,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 00:48:06,792 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 00:48:06,893 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 00:48:06,894 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 00:48:07,259 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 00:48:07,456 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 00:48:07,456 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 00:48:07,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:48:07 BoogieIcfgContainer [2023-01-28 00:48:07,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 00:48:07,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 00:48:07,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 00:48:07,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 00:48:07,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 12:48:06" (1/3) ... [2023-01-28 00:48:07,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5d45bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:48:07, skipping insertion in model container [2023-01-28 00:48:07,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 12:48:06" (2/3) ... [2023-01-28 00:48:07,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5d45bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 12:48:07, skipping insertion in model container [2023-01-28 00:48:07,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 12:48:07" (3/3) ... [2023-01-28 00:48:07,463 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-01-28 00:48:07,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 00:48:07,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 00:48:07,475 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 00:48:07,534 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 00:48:07,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-01-28 00:48:07,623 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-01-28 00:48:07,624 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:48:07,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-01-28 00:48:07,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-01-28 00:48:07,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 262 flow [2023-01-28 00:48:07,640 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 00:48:07,646 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 125 transitions, 262 flow [2023-01-28 00:48:07,654 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 125 transitions, 262 flow [2023-01-28 00:48:07,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 125 transitions, 262 flow [2023-01-28 00:48:07,676 INFO L130 PetriNetUnfolder]: 1/125 cut-off events. [2023-01-28 00:48:07,677 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:48:07,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 1/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 47 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-28 00:48:07,678 INFO L119 LiptonReduction]: Number of co-enabled transitions 1736 [2023-01-28 00:48:14,272 INFO L134 LiptonReduction]: Checked pairs total: 4893 [2023-01-28 00:48:14,272 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-01-28 00:48:14,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 00:48:14,305 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;@7ea9cc7c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 00:48:14,306 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 00:48:14,330 INFO L130 PetriNetUnfolder]: 1/25 cut-off events. [2023-01-28 00:48:14,330 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:48:14,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:14,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:14,333 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:14,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:14,336 INFO L85 PathProgramCache]: Analyzing trace with hash -630249958, now seen corresponding path program 1 times [2023-01-28 00:48:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:14,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769894061] [2023-01-28 00:48:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:14,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:14,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769894061] [2023-01-28 00:48:14,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769894061] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:14,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:14,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:48:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874929916] [2023-01-28 00:48:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:14,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 00:48:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:14,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 00:48:14,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 00:48:14,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 247 [2023-01-28 00:48:14,533 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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-01-28 00:48:14,533 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:14,533 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 247 [2023-01-28 00:48:14,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:15,113 INFO L130 PetriNetUnfolder]: 2483/3464 cut-off events. [2023-01-28 00:48:15,113 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-01-28 00:48:15,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7012 conditions, 3464 events. 2483/3464 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 15783 event pairs, 2483 based on Foata normal form. 144/3454 useless extension candidates. Maximal degree in co-relation 7000. Up to 3445 conditions per place. [2023-01-28 00:48:15,129 INFO L137 encePairwiseOnDemand]: 246/247 looper letters, 22 selfloop transitions, 0 changer transitions 1/25 dead transitions. [2023-01-28 00:48:15,129 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 108 flow [2023-01-28 00:48:15,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 00:48:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 00:48:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-01-28 00:48:15,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2023-01-28 00:48:15,138 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-01-28 00:48:15,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-01-28 00:48:15,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:15,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-01-28 00:48:15,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 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-01-28 00:48:15,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 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-01-28 00:48:15,145 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 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-01-28 00:48:15,146 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 2 states and 286 transitions. [2023-01-28 00:48:15,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 108 flow [2023-01-28 00:48:15,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 00:48:15,150 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 56 flow [2023-01-28 00:48:15,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-01-28 00:48:15,153 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2023-01-28 00:48:15,153 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 56 flow [2023-01-28 00:48:15,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 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-01-28 00:48:15,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:15,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:15,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 00:48:15,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:15,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash -630221128, now seen corresponding path program 1 times [2023-01-28 00:48:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:15,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712551904] [2023-01-28 00:48:15,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:15,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:15,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712551904] [2023-01-28 00:48:15,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712551904] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:15,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:48:15,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571787396] [2023-01-28 00:48:15,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:15,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:48:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:48:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:48:15,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 247 [2023-01-28 00:48:15,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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-01-28 00:48:15,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:15,657 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 247 [2023-01-28 00:48:15,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:16,141 INFO L130 PetriNetUnfolder]: 2083/3178 cut-off events. [2023-01-28 00:48:16,142 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 00:48:16,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6227 conditions, 3178 events. 2083/3178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16842 event pairs, 399 based on Foata normal form. 144/3319 useless extension candidates. Maximal degree in co-relation 6224. Up to 2013 conditions per place. [2023-01-28 00:48:16,152 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 36 selfloop transitions, 2 changer transitions 19/59 dead transitions. [2023-01-28 00:48:16,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 246 flow [2023-01-28 00:48:16,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:48:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:48:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-01-28 00:48:16,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5619433198380567 [2023-01-28 00:48:16,155 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-01-28 00:48:16,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-01-28 00:48:16,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:16,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-01-28 00:48:16,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:48:16,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:16,160 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:16,160 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 56 flow. Second operand 5 states and 694 transitions. [2023-01-28 00:48:16,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 246 flow [2023-01-28 00:48:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 00:48:16,161 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 68 flow [2023-01-28 00:48:16,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-01-28 00:48:16,162 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-01-28 00:48:16,162 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 68 flow [2023-01-28 00:48:16,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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-01-28 00:48:16,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:16,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:16,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 00:48:16,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:16,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1937959561, now seen corresponding path program 1 times [2023-01-28 00:48:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:16,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705326125] [2023-01-28 00:48:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:16,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:16,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:16,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705326125] [2023-01-28 00:48:16,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705326125] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:16,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:16,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:48:16,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624781105] [2023-01-28 00:48:16,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:16,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:48:16,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:16,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:48:16,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:48:16,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 247 [2023-01-28 00:48:16,452 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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-01-28 00:48:16,452 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:16,452 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 247 [2023-01-28 00:48:16,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:16,867 INFO L130 PetriNetUnfolder]: 1815/2736 cut-off events. [2023-01-28 00:48:16,867 INFO L131 PetriNetUnfolder]: For 571/571 co-relation queries the response was YES. [2023-01-28 00:48:16,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6018 conditions, 2736 events. 1815/2736 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13816 event pairs, 338 based on Foata normal form. 96/2831 useless extension candidates. Maximal degree in co-relation 6011. Up to 1912 conditions per place. [2023-01-28 00:48:16,880 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 31 selfloop transitions, 2 changer transitions 16/51 dead transitions. [2023-01-28 00:48:16,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 227 flow [2023-01-28 00:48:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:48:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:48:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 686 transitions. [2023-01-28 00:48:16,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5554655870445344 [2023-01-28 00:48:16,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 686 transitions. [2023-01-28 00:48:16,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 686 transitions. [2023-01-28 00:48:16,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:16,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 686 transitions. [2023-01-28 00:48:16,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.2) internal successors, (686), 5 states have internal predecessors, (686), 0 states have call successors, (0), 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-01-28 00:48:16,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:16,886 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:16,886 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 68 flow. Second operand 5 states and 686 transitions. [2023-01-28 00:48:16,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 227 flow [2023-01-28 00:48:16,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 217 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:48:16,894 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 72 flow [2023-01-28 00:48:16,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-01-28 00:48:16,895 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-01-28 00:48:16,895 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 72 flow [2023-01-28 00:48:16,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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-01-28 00:48:16,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:16,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:16,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 00:48:16,896 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:16,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1359621863, now seen corresponding path program 1 times [2023-01-28 00:48:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:16,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131967572] [2023-01-28 00:48:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131967572] [2023-01-28 00:48:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131967572] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:48:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017917709] [2023-01-28 00:48:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:17,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:48:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:17,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:48:17,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:48:17,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 247 [2023-01-28 00:48:17,174 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 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-01-28 00:48:17,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:17,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 247 [2023-01-28 00:48:17,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:17,763 INFO L130 PetriNetUnfolder]: 3170/4579 cut-off events. [2023-01-28 00:48:17,763 INFO L131 PetriNetUnfolder]: For 800/800 co-relation queries the response was YES. [2023-01-28 00:48:17,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10329 conditions, 4579 events. 3170/4579 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 22797 event pairs, 637 based on Foata normal form. 108/4683 useless extension candidates. Maximal degree in co-relation 10321. Up to 1729 conditions per place. [2023-01-28 00:48:17,780 INFO L137 encePairwiseOnDemand]: 242/247 looper letters, 43 selfloop transitions, 3 changer transitions 23/70 dead transitions. [2023-01-28 00:48:17,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 321 flow [2023-01-28 00:48:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:48:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:48:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 815 transitions. [2023-01-28 00:48:17,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5499325236167342 [2023-01-28 00:48:17,782 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 815 transitions. [2023-01-28 00:48:17,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 815 transitions. [2023-01-28 00:48:17,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:17,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 815 transitions. [2023-01-28 00:48:17,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 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-01-28 00:48:17,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:17,787 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:17,787 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 72 flow. Second operand 6 states and 815 transitions. [2023-01-28 00:48:17,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 321 flow [2023-01-28 00:48:17,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 311 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 00:48:17,793 INFO L231 Difference]: Finished difference. Result has 45 places, 24 transitions, 82 flow [2023-01-28 00:48:17,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=24} [2023-01-28 00:48:17,794 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-01-28 00:48:17,794 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 24 transitions, 82 flow [2023-01-28 00:48:17,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 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-01-28 00:48:17,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:17,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:17,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 00:48:17,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:17,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash -802220554, now seen corresponding path program 1 times [2023-01-28 00:48:17,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:17,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724443882] [2023-01-28 00:48:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:19,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724443882] [2023-01-28 00:48:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724443882] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 00:48:19,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417968167] [2023-01-28 00:48:19,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:19,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 00:48:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:19,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 00:48:19,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 00:48:19,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 247 [2023-01-28 00:48:19,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 24 transitions, 82 flow. Second operand has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 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-01-28 00:48:19,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:19,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 247 [2023-01-28 00:48:19,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:19,595 INFO L130 PetriNetUnfolder]: 1486/2190 cut-off events. [2023-01-28 00:48:19,596 INFO L131 PetriNetUnfolder]: For 1101/1101 co-relation queries the response was YES. [2023-01-28 00:48:19,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5336 conditions, 2190 events. 1486/2190 cut-off events. For 1101/1101 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9719 event pairs, 309 based on Foata normal form. 64/2254 useless extension candidates. Maximal degree in co-relation 5326. Up to 1755 conditions per place. [2023-01-28 00:48:19,604 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 41 selfloop transitions, 6 changer transitions 13/61 dead transitions. [2023-01-28 00:48:19,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 309 flow [2023-01-28 00:48:19,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:48:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:48:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 656 transitions. [2023-01-28 00:48:19,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4426450742240216 [2023-01-28 00:48:19,606 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 656 transitions. [2023-01-28 00:48:19,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 656 transitions. [2023-01-28 00:48:19,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:19,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 656 transitions. [2023-01-28 00:48:19,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.33333333333333) internal successors, (656), 6 states have internal predecessors, (656), 0 states have call successors, (0), 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-01-28 00:48:19,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:19,609 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:19,610 INFO L175 Difference]: Start difference. First operand has 45 places, 24 transitions, 82 flow. Second operand 6 states and 656 transitions. [2023-01-28 00:48:19,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 309 flow [2023-01-28 00:48:19,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 279 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-01-28 00:48:19,612 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 108 flow [2023-01-28 00:48:19,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-01-28 00:48:19,613 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2023-01-28 00:48:19,613 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 108 flow [2023-01-28 00:48:19,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 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-01-28 00:48:19,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:19,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:19,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 00:48:19,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:19,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:19,614 INFO L85 PathProgramCache]: Analyzing trace with hash 833815455, now seen corresponding path program 1 times [2023-01-28 00:48:19,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:19,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518557855] [2023-01-28 00:48:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:19,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:19,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:19,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:19,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518557855] [2023-01-28 00:48:19,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518557855] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:19,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:19,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:48:19,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198893663] [2023-01-28 00:48:19,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:19,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:48:19,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:19,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:48:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:48:19,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 247 [2023-01-28 00:48:19,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 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-01-28 00:48:19,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:19,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 247 [2023-01-28 00:48:19,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:20,371 INFO L130 PetriNetUnfolder]: 1729/2494 cut-off events. [2023-01-28 00:48:20,371 INFO L131 PetriNetUnfolder]: For 1139/1139 co-relation queries the response was YES. [2023-01-28 00:48:20,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6348 conditions, 2494 events. 1729/2494 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11056 event pairs, 1082 based on Foata normal form. 48/2541 useless extension candidates. Maximal degree in co-relation 6338. Up to 2088 conditions per place. [2023-01-28 00:48:20,382 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 30 selfloop transitions, 10 changer transitions 8/49 dead transitions. [2023-01-28 00:48:20,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 263 flow [2023-01-28 00:48:20,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:48:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:48:20,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 629 transitions. [2023-01-28 00:48:20,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093117408906883 [2023-01-28 00:48:20,384 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 629 transitions. [2023-01-28 00:48:20,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 629 transitions. [2023-01-28 00:48:20,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:20,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 629 transitions. [2023-01-28 00:48:20,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 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-01-28 00:48:20,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:20,387 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:20,387 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 108 flow. Second operand 5 states and 629 transitions. [2023-01-28 00:48:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 263 flow [2023-01-28 00:48:20,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 255 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-01-28 00:48:20,390 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 166 flow [2023-01-28 00:48:20,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-01-28 00:48:20,391 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-01-28 00:48:20,391 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 166 flow [2023-01-28 00:48:20,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 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-01-28 00:48:20,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:20,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:20,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 00:48:20,391 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:20,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash -460826115, now seen corresponding path program 2 times [2023-01-28 00:48:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:20,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009902557] [2023-01-28 00:48:20,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:20,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:21,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:21,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:21,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009902557] [2023-01-28 00:48:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009902557] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:21,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:21,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:48:21,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655993742] [2023-01-28 00:48:21,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:21,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:48:21,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:21,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:48:21,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:48:21,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2023-01-28 00:48:21,028 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 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-01-28 00:48:21,028 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:21,028 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2023-01-28 00:48:21,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:21,437 INFO L130 PetriNetUnfolder]: 1795/2596 cut-off events. [2023-01-28 00:48:21,437 INFO L131 PetriNetUnfolder]: For 1732/1732 co-relation queries the response was YES. [2023-01-28 00:48:21,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7821 conditions, 2596 events. 1795/2596 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11661 event pairs, 1070 based on Foata normal form. 60/2655 useless extension candidates. Maximal degree in co-relation 7810. Up to 2108 conditions per place. [2023-01-28 00:48:21,449 INFO L137 encePairwiseOnDemand]: 238/247 looper letters, 31 selfloop transitions, 13 changer transitions 14/59 dead transitions. [2023-01-28 00:48:21,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 371 flow [2023-01-28 00:48:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:48:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:48:21,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-01-28 00:48:21,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-01-28 00:48:21,451 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-01-28 00:48:21,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-01-28 00:48:21,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:21,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-01-28 00:48:21,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 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-01-28 00:48:21,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:21,455 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:21,455 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 166 flow. Second operand 6 states and 741 transitions. [2023-01-28 00:48:21,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 371 flow [2023-01-28 00:48:21,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 352 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-01-28 00:48:21,459 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 228 flow [2023-01-28 00:48:21,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-01-28 00:48:21,459 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2023-01-28 00:48:21,460 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 228 flow [2023-01-28 00:48:21,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.66666666666667) internal successors, (706), 6 states have internal predecessors, (706), 0 states have call successors, (0), 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-01-28 00:48:21,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:21,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:21,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 00:48:21,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:21,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:21,460 INFO L85 PathProgramCache]: Analyzing trace with hash -459962176, now seen corresponding path program 1 times [2023-01-28 00:48:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570603840] [2023-01-28 00:48:21,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:21,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:21,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:21,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570603840] [2023-01-28 00:48:21,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570603840] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:21,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:21,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 00:48:21,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757790757] [2023-01-28 00:48:21,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:21,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 00:48:21,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:21,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 00:48:21,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 00:48:21,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 247 [2023-01-28 00:48:21,651 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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-01-28 00:48:21,651 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:21,651 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 247 [2023-01-28 00:48:21,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:21,941 INFO L130 PetriNetUnfolder]: 1197/1779 cut-off events. [2023-01-28 00:48:21,941 INFO L131 PetriNetUnfolder]: For 3303/3438 co-relation queries the response was YES. [2023-01-28 00:48:21,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6374 conditions, 1779 events. 1197/1779 cut-off events. For 3303/3438 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7989 event pairs, 258 based on Foata normal form. 163/1935 useless extension candidates. Maximal degree in co-relation 6361. Up to 1608 conditions per place. [2023-01-28 00:48:21,953 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 54 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2023-01-28 00:48:21,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 469 flow [2023-01-28 00:48:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 00:48:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 00:48:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-01-28 00:48:21,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5587044534412956 [2023-01-28 00:48:21,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-01-28 00:48:21,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-01-28 00:48:21,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:21,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-01-28 00:48:21,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 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-01-28 00:48:21,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 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-01-28 00:48:21,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 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-01-28 00:48:21,957 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 228 flow. Second operand 3 states and 414 transitions. [2023-01-28 00:48:21,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 469 flow [2023-01-28 00:48:21,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 444 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-01-28 00:48:21,961 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 241 flow [2023-01-28 00:48:21,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-01-28 00:48:21,963 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-01-28 00:48:21,963 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 241 flow [2023-01-28 00:48:21,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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-01-28 00:48:21,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:21,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:21,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 00:48:21,963 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:21,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:21,966 INFO L85 PathProgramCache]: Analyzing trace with hash 773162674, now seen corresponding path program 1 times [2023-01-28 00:48:21,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:21,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706574228] [2023-01-28 00:48:21,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:21,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706574228] [2023-01-28 00:48:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706574228] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 00:48:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946950358] [2023-01-28 00:48:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:22,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 00:48:22,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 00:48:22,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 00:48:22,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 247 [2023-01-28 00:48:22,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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-01-28 00:48:22,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:22,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 247 [2023-01-28 00:48:22,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:22,395 INFO L130 PetriNetUnfolder]: 688/1093 cut-off events. [2023-01-28 00:48:22,395 INFO L131 PetriNetUnfolder]: For 1976/2056 co-relation queries the response was YES. [2023-01-28 00:48:22,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4308 conditions, 1093 events. 688/1093 cut-off events. For 1976/2056 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4689 event pairs, 84 based on Foata normal form. 133/1219 useless extension candidates. Maximal degree in co-relation 4295. Up to 666 conditions per place. [2023-01-28 00:48:22,401 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 70 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2023-01-28 00:48:22,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 617 flow [2023-01-28 00:48:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 00:48:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 00:48:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-01-28 00:48:22,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5597165991902834 [2023-01-28 00:48:22,403 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-01-28 00:48:22,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-01-28 00:48:22,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:22,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-01-28 00:48:22,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 00:48:22,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 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-01-28 00:48:22,405 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 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-01-28 00:48:22,405 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 241 flow. Second operand 4 states and 553 transitions. [2023-01-28 00:48:22,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 617 flow [2023-01-28 00:48:22,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 00:48:22,409 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 288 flow [2023-01-28 00:48:22,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-01-28 00:48:22,409 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2023-01-28 00:48:22,410 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 288 flow [2023-01-28 00:48:22,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 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-01-28 00:48:22,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:22,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:22,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 00:48:22,410 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:22,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:22,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1613123840, now seen corresponding path program 1 times [2023-01-28 00:48:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:22,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954865555] [2023-01-28 00:48:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:22,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:22,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:22,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954865555] [2023-01-28 00:48:22,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954865555] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:22,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:22,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:48:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325003461] [2023-01-28 00:48:22,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:22,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:48:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:48:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:48:22,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 247 [2023-01-28 00:48:22,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 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-01-28 00:48:22,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:22,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 247 [2023-01-28 00:48:22,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:22,963 INFO L130 PetriNetUnfolder]: 1339/2156 cut-off events. [2023-01-28 00:48:22,963 INFO L131 PetriNetUnfolder]: For 4968/5069 co-relation queries the response was YES. [2023-01-28 00:48:22,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9031 conditions, 2156 events. 1339/2156 cut-off events. For 4968/5069 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10730 event pairs, 241 based on Foata normal form. 131/2279 useless extension candidates. Maximal degree in co-relation 9017. Up to 1221 conditions per place. [2023-01-28 00:48:22,972 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 67 selfloop transitions, 2 changer transitions 33/105 dead transitions. [2023-01-28 00:48:22,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 843 flow [2023-01-28 00:48:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:48:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:48:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-01-28 00:48:22,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5497975708502024 [2023-01-28 00:48:22,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-01-28 00:48:22,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-01-28 00:48:22,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:22,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-01-28 00:48:22,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 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-01-28 00:48:22,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:22,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:22,978 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 288 flow. Second operand 5 states and 679 transitions. [2023-01-28 00:48:22,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 843 flow [2023-01-28 00:48:22,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 801 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-01-28 00:48:22,983 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 285 flow [2023-01-28 00:48:22,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-01-28 00:48:22,984 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2023-01-28 00:48:22,984 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 285 flow [2023-01-28 00:48:22,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 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-01-28 00:48:22,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:22,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:22,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 00:48:22,985 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:22,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash -300813236, now seen corresponding path program 2 times [2023-01-28 00:48:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:22,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851771153] [2023-01-28 00:48:22,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:23,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:23,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851771153] [2023-01-28 00:48:23,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851771153] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:23,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:23,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 00:48:23,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382297847] [2023-01-28 00:48:23,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:23,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 00:48:23,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 00:48:23,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-28 00:48:23,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 247 [2023-01-28 00:48:23,231 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 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-01-28 00:48:23,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:23,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 247 [2023-01-28 00:48:23,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:23,432 INFO L130 PetriNetUnfolder]: 678/1110 cut-off events. [2023-01-28 00:48:23,432 INFO L131 PetriNetUnfolder]: For 2426/2526 co-relation queries the response was YES. [2023-01-28 00:48:23,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 1110 events. 678/1110 cut-off events. For 2426/2526 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5115 event pairs, 57 based on Foata normal form. 156/1243 useless extension candidates. Maximal degree in co-relation 4456. Up to 397 conditions per place. [2023-01-28 00:48:23,437 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 75 selfloop transitions, 13 changer transitions 0/93 dead transitions. [2023-01-28 00:48:23,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 727 flow [2023-01-28 00:48:23,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 00:48:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 00:48:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-01-28 00:48:23,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5578947368421052 [2023-01-28 00:48:23,439 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-01-28 00:48:23,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-01-28 00:48:23,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:23,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-01-28 00:48:23,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 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-01-28 00:48:23,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:23,443 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 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-01-28 00:48:23,443 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 285 flow. Second operand 5 states and 689 transitions. [2023-01-28 00:48:23,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 727 flow [2023-01-28 00:48:23,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 714 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 00:48:23,446 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 326 flow [2023-01-28 00:48:23,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-01-28 00:48:23,447 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-01-28 00:48:23,447 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 326 flow [2023-01-28 00:48:23,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 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-01-28 00:48:23,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:23,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:23,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 00:48:23,447 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:23,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1113364253, now seen corresponding path program 1 times [2023-01-28 00:48:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410499445] [2023-01-28 00:48:23,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:23,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410499445] [2023-01-28 00:48:24,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410499445] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:24,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:24,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:48:24,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843125470] [2023-01-28 00:48:24,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:24,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 00:48:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:24,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 00:48:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-28 00:48:24,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2023-01-28 00:48:24,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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-01-28 00:48:24,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:24,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2023-01-28 00:48:24,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:24,934 INFO L130 PetriNetUnfolder]: 1001/1687 cut-off events. [2023-01-28 00:48:24,934 INFO L131 PetriNetUnfolder]: For 5000/5010 co-relation queries the response was YES. [2023-01-28 00:48:24,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7764 conditions, 1687 events. 1001/1687 cut-off events. For 5000/5010 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8561 event pairs, 240 based on Foata normal form. 15/1693 useless extension candidates. Maximal degree in co-relation 7748. Up to 981 conditions per place. [2023-01-28 00:48:24,942 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 58 selfloop transitions, 13 changer transitions 29/102 dead transitions. [2023-01-28 00:48:24,942 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 927 flow [2023-01-28 00:48:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 00:48:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 00:48:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions. [2023-01-28 00:48:24,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2023-01-28 00:48:24,944 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 858 transitions. [2023-01-28 00:48:24,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions. [2023-01-28 00:48:24,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:24,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions. [2023-01-28 00:48:24,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 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-01-28 00:48:24,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 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-01-28 00:48:24,948 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 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-01-28 00:48:24,948 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 326 flow. Second operand 7 states and 858 transitions. [2023-01-28 00:48:24,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 927 flow [2023-01-28 00:48:24,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 837 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-01-28 00:48:24,961 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 369 flow [2023-01-28 00:48:24,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-01-28 00:48:24,961 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2023-01-28 00:48:24,962 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 369 flow [2023-01-28 00:48:24,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 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-01-28 00:48:24,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:24,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:24,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 00:48:24,962 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:24,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash -36945931, now seen corresponding path program 1 times [2023-01-28 00:48:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:24,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544714814] [2023-01-28 00:48:24,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:24,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 00:48:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 00:48:25,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 00:48:25,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544714814] [2023-01-28 00:48:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544714814] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 00:48:25,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 00:48:25,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 00:48:25,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185369779] [2023-01-28 00:48:25,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 00:48:25,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 00:48:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 00:48:25,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 00:48:25,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-01-28 00:48:25,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 247 [2023-01-28 00:48:25,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 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-01-28 00:48:25,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 00:48:25,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 247 [2023-01-28 00:48:25,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 00:48:25,456 INFO L130 PetriNetUnfolder]: 783/1277 cut-off events. [2023-01-28 00:48:25,456 INFO L131 PetriNetUnfolder]: For 4340/4443 co-relation queries the response was YES. [2023-01-28 00:48:25,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5800 conditions, 1277 events. 783/1277 cut-off events. For 4340/4443 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6360 event pairs, 51 based on Foata normal form. 130/1384 useless extension candidates. Maximal degree in co-relation 5780. Up to 480 conditions per place. [2023-01-28 00:48:25,461 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 57 selfloop transitions, 17 changer transitions 29/105 dead transitions. [2023-01-28 00:48:25,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 994 flow [2023-01-28 00:48:25,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 00:48:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 00:48:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2023-01-28 00:48:25,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5492577597840755 [2023-01-28 00:48:25,463 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 814 transitions. [2023-01-28 00:48:25,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 814 transitions. [2023-01-28 00:48:25,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 00:48:25,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 814 transitions. [2023-01-28 00:48:25,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 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-01-28 00:48:25,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:25,467 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 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-01-28 00:48:25,467 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 369 flow. Second operand 6 states and 814 transitions. [2023-01-28 00:48:25,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 994 flow [2023-01-28 00:48:25,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 105 transitions, 854 flow, removed 46 selfloop flow, removed 7 redundant places. [2023-01-28 00:48:25,479 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 288 flow [2023-01-28 00:48:25,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2023-01-28 00:48:25,479 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-01-28 00:48:25,480 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 288 flow [2023-01-28 00:48:25,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 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-01-28 00:48:25,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 00:48:25,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:25,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 00:48:25,480 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 00:48:25,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 00:48:25,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1586549304, now seen corresponding path program 1 times [2023-01-28 00:48:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 00:48:25,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950296235] [2023-01-28 00:48:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 00:48:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 00:48:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:48:25,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 00:48:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 00:48:25,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 00:48:25,666 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 00:48:25,666 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 00:48:25,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-28 00:48:25,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 00:48:25,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 00:48:25,668 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-28 00:48:25,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 00:48:25,668 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 00:48:25,672 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 00:48:25,673 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 00:48:25,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 12:48:25 BasicIcfg [2023-01-28 00:48:25,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 00:48:25,756 INFO L158 Benchmark]: Toolchain (without parser) took 19591.71ms. Allocated memory was 574.6MB in the beginning and 1.4GB in the end (delta: 813.7MB). Free memory was 531.6MB in the beginning and 962.4MB in the end (delta: -430.7MB). Peak memory consumption was 385.5MB. Max. memory is 16.0GB. [2023-01-28 00:48:25,756 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 329.3MB. Free memory is still 276.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 00:48:25,756 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.11ms. Allocated memory is still 574.6MB. Free memory was 531.3MB in the beginning and 506.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 00:48:25,756 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.13ms. Allocated memory is still 574.6MB. Free memory was 506.0MB in the beginning and 503.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 00:48:25,757 INFO L158 Benchmark]: Boogie Preprocessor took 65.24ms. Allocated memory is still 574.6MB. Free memory was 503.2MB in the beginning and 500.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 00:48:25,757 INFO L158 Benchmark]: RCFGBuilder took 757.75ms. Allocated memory is still 574.6MB. Free memory was 500.4MB in the beginning and 474.9MB in the end (delta: 25.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.0GB. [2023-01-28 00:48:25,757 INFO L158 Benchmark]: TraceAbstraction took 18296.59ms. Allocated memory was 574.6MB in the beginning and 1.4GB in the end (delta: 813.7MB). Free memory was 473.9MB in the beginning and 962.4MB in the end (delta: -488.5MB). Peak memory consumption was 326.2MB. Max. memory is 16.0GB. [2023-01-28 00:48:25,758 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 329.3MB. Free memory is still 276.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 412.11ms. Allocated memory is still 574.6MB. Free memory was 531.3MB in the beginning and 506.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.13ms. Allocated memory is still 574.6MB. Free memory was 506.0MB in the beginning and 503.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 65.24ms. Allocated memory is still 574.6MB. Free memory was 503.2MB in the beginning and 500.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 757.75ms. Allocated memory is still 574.6MB. Free memory was 500.4MB in the beginning and 474.9MB in the end (delta: 25.5MB). Peak memory consumption was 32.1MB. Max. memory is 16.0GB. * TraceAbstraction took 18296.59ms. Allocated memory was 574.6MB in the beginning and 1.4GB in the end (delta: 813.7MB). Free memory was 473.9MB in the beginning and 962.4MB in the end (delta: -488.5MB). Peak memory consumption was 326.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 137 PlacesBefore, 38 PlacesAfterwards, 125 TransitionsBefore, 26 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 104 TotalNumberOfCompositions, 4893 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1862, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 894, independent: 857, independent conditional: 0, independent unconditional: 857, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1862, independent: 786, independent conditional: 0, independent unconditional: 786, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 894, unknown conditional: 0, unknown unconditional: 894] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=9, t2225={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=10, t2225={7:0}, t2226={5:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2227; [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=11, t2225={7:0}, t2226={5:0}, t2227={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 pthread_t t2228; [L809] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=12, t2225={7:0}, t2226={5:0}, t2227={6:0}, t2228={8:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={7:0}, t2226={5:0}, t2227={6:0}, t2228={8:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 861]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 174 locations, 5 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: 18.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 351 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1303 IncrementalHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 4 mSDtfsCounter, 1303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=12, InterpolantAutomatonStates: 65, 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.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 00:48:25,795 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...