/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 18:18:13,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 18:18:13,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 18:18:13,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 18:18:13,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 18:18:13,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 18:18:13,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 18:18:13,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 18:18:13,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 18:18:13,070 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 18:18:13,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 18:18:13,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 18:18:13,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 18:18:13,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 18:18:13,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 18:18:13,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 18:18:13,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 18:18:13,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 18:18:13,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 18:18:13,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 18:18:13,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 18:18:13,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 18:18:13,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 18:18:13,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 18:18:13,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 18:18:13,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 18:18:13,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 18:18:13,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 18:18:13,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 18:18:13,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 18:18:13,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 18:18:13,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 18:18:13,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 18:18:13,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 18:18:13,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 18:18:13,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 18:18:13,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 18:18:13,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 18:18:13,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 18:18:13,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 18:18:13,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 18:18:13,107 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-27 18:18:13,132 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 18:18:13,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 18:18:13,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 18:18:13,133 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 18:18:13,134 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 18:18:13,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 18:18:13,134 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 18:18:13,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 18:18:13,134 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 18:18:13,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 18:18:13,135 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 18:18:13,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 18:18:13,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 18:18:13,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 18:18:13,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 18:18:13,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 18:18:13,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:18:13,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 18:18:13,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 18:18:13,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 18:18:13,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 18:18:13,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 18:18:13,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 18:18:13,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 18:18:13,138 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 [2023-01-27 18:18:13,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 18:18:13,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 18:18:13,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 18:18:13,402 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 18:18:13,402 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 18:18:13,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2023-01-27 18:18:14,607 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 18:18:14,874 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 18:18:14,875 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_power.opt.i [2023-01-27 18:18:14,888 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820f03766/29c91a3f0c5b412483d99ec8a49230e0/FLAG83ac1e74e [2023-01-27 18:18:14,901 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/820f03766/29c91a3f0c5b412483d99ec8a49230e0 [2023-01-27 18:18:14,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 18:18:14,906 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 18:18:14,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 18:18:14,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 18:18:14,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 18:18:14,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:18:14" (1/1) ... [2023-01-27 18:18:14,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ba9dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:14, skipping insertion in model container [2023-01-27 18:18:14,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 06:18:14" (1/1) ... [2023-01-27 18:18:14,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 18:18:14,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 18:18:15,129 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/safe012_power.opt.i[951,964] [2023-01-27 18:18:15,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:18:15,332 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 18:18:15,341 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/safe012_power.opt.i[951,964] [2023-01-27 18:18:15,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 18:18:15,445 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:18:15,445 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 18:18:15,452 INFO L208 MainTranslator]: Completed translation [2023-01-27 18:18:15,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15 WrapperNode [2023-01-27 18:18:15,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 18:18:15,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 18:18:15,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 18:18:15,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 18:18:15,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,513 INFO L138 Inliner]: procedures = 176, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 182 [2023-01-27 18:18:15,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 18:18:15,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 18:18:15,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 18:18:15,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 18:18:15,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,573 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 18:18:15,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 18:18:15,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 18:18:15,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 18:18:15,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (1/1) ... [2023-01-27 18:18:15,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 18:18:15,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 18:18:15,630 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-27 18:18:15,631 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-27 18:18:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 18:18:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 18:18:15,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 18:18:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 18:18:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 18:18:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 18:18:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-27 18:18:15,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-27 18:18:15,655 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-27 18:18:15,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-27 18:18:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-27 18:18:15,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-27 18:18:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 18:18:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 18:18:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 18:18:15,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 18:18:15,658 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 18:18:15,780 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 18:18:15,782 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 18:18:16,336 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 18:18:16,629 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 18:18:16,630 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-27 18:18:16,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:18:16 BoogieIcfgContainer [2023-01-27 18:18:16,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 18:18:16,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 18:18:16,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 18:18:16,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 18:18:16,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 06:18:14" (1/3) ... [2023-01-27 18:18:16,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439723b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:18:16, skipping insertion in model container [2023-01-27 18:18:16,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 06:18:15" (2/3) ... [2023-01-27 18:18:16,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3439723b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 06:18:16, skipping insertion in model container [2023-01-27 18:18:16,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 06:18:16" (3/3) ... [2023-01-27 18:18:16,640 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2023-01-27 18:18:16,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 18:18:16,657 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-01-27 18:18:16,657 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 18:18:16,729 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-27 18:18:16,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 269 flow [2023-01-27 18:18:16,833 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:18:16,833 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:18:16,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:18:16,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 269 flow [2023-01-27 18:18:16,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 124 transitions, 257 flow [2023-01-27 18:18:16,845 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 18:18:16,852 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 124 transitions, 257 flow [2023-01-27 18:18:16,854 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 124 transitions, 257 flow [2023-01-27 18:18:16,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 257 flow [2023-01-27 18:18:16,881 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2023-01-27 18:18:16,882 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:18:16,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-01-27 18:18:16,884 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-01-27 18:18:23,574 INFO L134 LiptonReduction]: Checked pairs total: 5458 [2023-01-27 18:18:23,575 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-01-27 18:18:23,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 18:18:23,592 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;@70652b89, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 18:18:23,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-01-27 18:18:23,596 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2023-01-27 18:18:23,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-27 18:18:23,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:23,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-01-27 18:18:23,598 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:23,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1792939925, now seen corresponding path program 1 times [2023-01-27 18:18:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:23,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430943528] [2023-01-27 18:18:23,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:23,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:24,005 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-27 18:18:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430943528] [2023-01-27 18:18:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430943528] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:24,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:24,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 18:18:24,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149932517] [2023-01-27 18:18:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:24,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:18:24,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:24,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:18:24,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:18:24,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 236 [2023-01-27 18:18:24,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:24,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:24,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 236 [2023-01-27 18:18:24,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:24,439 INFO L130 PetriNetUnfolder]: 920/1385 cut-off events. [2023-01-27 18:18:24,439 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-01-27 18:18:24,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 1385 events. 920/1385 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6649 event pairs, 317 based on Foata normal form. 60/1312 useless extension candidates. Maximal degree in co-relation 2794. Up to 874 conditions per place. [2023-01-27 18:18:24,452 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 28 selfloop transitions, 2 changer transitions 4/36 dead transitions. [2023-01-27 18:18:24,452 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 152 flow [2023-01-27 18:18:24,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:18:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:18:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-01-27 18:18:24,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5310734463276836 [2023-01-27 18:18:24,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-01-27 18:18:24,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-01-27 18:18:24,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:24,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-01-27 18:18:24,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-27 18:18:24,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 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-27 18:18:24,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 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-27 18:18:24,491 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 376 transitions. [2023-01-27 18:18:24,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 152 flow [2023-01-27 18:18:24,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 148 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-01-27 18:18:24,495 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-01-27 18:18:24,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-01-27 18:18:24,500 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:18:24,500 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-01-27 18:18:24,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:24,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:24,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:24,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 18:18:24,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:24,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1558069759, now seen corresponding path program 1 times [2023-01-27 18:18:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:24,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779921832] [2023-01-27 18:18:24,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:24,876 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-27 18:18:24,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:24,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779921832] [2023-01-27 18:18:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779921832] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:24,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:24,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:18:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381540112] [2023-01-27 18:18:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:24,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:18:24,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:18:24,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:18:24,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 236 [2023-01-27 18:18:24,890 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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-27 18:18:24,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:24,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 236 [2023-01-27 18:18:24,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:25,177 INFO L130 PetriNetUnfolder]: 645/1097 cut-off events. [2023-01-27 18:18:25,177 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2023-01-27 18:18:25,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2211 conditions, 1097 events. 645/1097 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5597 event pairs, 122 based on Foata normal form. 60/1153 useless extension candidates. Maximal degree in co-relation 2201. Up to 695 conditions per place. [2023-01-27 18:18:25,183 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 30 selfloop transitions, 2 changer transitions 17/51 dead transitions. [2023-01-27 18:18:25,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 51 transitions, 220 flow [2023-01-27 18:18:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:18:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:18:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-01-27 18:18:25,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008474576271187 [2023-01-27 18:18:25,187 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-01-27 18:18:25,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-01-27 18:18:25,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:25,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-01-27 18:18:25,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 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-27 18:18:25,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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-27 18:18:25,192 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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-27 18:18:25,192 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 591 transitions. [2023-01-27 18:18:25,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 51 transitions, 220 flow [2023-01-27 18:18:25,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 18:18:25,194 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 60 flow [2023-01-27 18:18:25,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=60, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2023-01-27 18:18:25,195 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-01-27 18:18:25,195 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 60 flow [2023-01-27 18:18:25,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 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-27 18:18:25,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:25,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:25,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 18:18:25,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:25,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1055487831, now seen corresponding path program 1 times [2023-01-27 18:18:25,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:25,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151532840] [2023-01-27 18:18:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:25,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:25,417 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-27 18:18:25,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:25,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151532840] [2023-01-27 18:18:25,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151532840] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:25,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:25,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:18:25,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615378583] [2023-01-27 18:18:25,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:25,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:25,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:25,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:25,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:25,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 236 [2023-01-27 18:18:25,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 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-27 18:18:25,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:25,422 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 236 [2023-01-27 18:18:25,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:25,750 INFO L130 PetriNetUnfolder]: 854/1363 cut-off events. [2023-01-27 18:18:25,750 INFO L131 PetriNetUnfolder]: For 215/215 co-relation queries the response was YES. [2023-01-27 18:18:25,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3038 conditions, 1363 events. 854/1363 cut-off events. For 215/215 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6438 event pairs, 226 based on Foata normal form. 50/1412 useless extension candidates. Maximal degree in co-relation 3025. Up to 461 conditions per place. [2023-01-27 18:18:25,757 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 31 selfloop transitions, 3 changer transitions 19/54 dead transitions. [2023-01-27 18:18:25,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 239 flow [2023-01-27 18:18:25,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 18:18:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 18:18:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 691 transitions. [2023-01-27 18:18:25,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879943502824859 [2023-01-27 18:18:25,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 691 transitions. [2023-01-27 18:18:25,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 691 transitions. [2023-01-27 18:18:25,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:25,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 691 transitions. [2023-01-27 18:18:25,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.16666666666667) internal successors, (691), 6 states have internal predecessors, (691), 0 states have call successors, (0), 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-27 18:18:25,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 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-27 18:18:25,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 236.0) internal successors, (1652), 7 states have internal predecessors, (1652), 0 states have call successors, (0), 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-27 18:18:25,764 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 60 flow. Second operand 6 states and 691 transitions. [2023-01-27 18:18:25,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 239 flow [2023-01-27 18:18:25,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 229 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-27 18:18:25,769 INFO L231 Difference]: Finished difference. Result has 38 places, 21 transitions, 70 flow [2023-01-27 18:18:25,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=21} [2023-01-27 18:18:25,770 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-01-27 18:18:25,773 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 70 flow [2023-01-27 18:18:25,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 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-27 18:18:25,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:25,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:25,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 18:18:25,774 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:25,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -363110008, now seen corresponding path program 1 times [2023-01-27 18:18:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:25,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386100987] [2023-01-27 18:18:25,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:26,124 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-27 18:18:26,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:26,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386100987] [2023-01-27 18:18:26,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386100987] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:26,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:26,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-27 18:18:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935599477] [2023-01-27 18:18:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:26,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 18:18:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:26,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 18:18:26,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 18:18:26,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-01-27 18:18:26,130 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 21 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-27 18:18:26,130 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:26,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-01-27 18:18:26,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:26,228 INFO L130 PetriNetUnfolder]: 232/405 cut-off events. [2023-01-27 18:18:26,229 INFO L131 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2023-01-27 18:18:26,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 405 events. 232/405 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1502 event pairs, 61 based on Foata normal form. 20/419 useless extension candidates. Maximal degree in co-relation 1015. Up to 347 conditions per place. [2023-01-27 18:18:26,232 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 26 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-01-27 18:18:26,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 158 flow [2023-01-27 18:18:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 18:18:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 18:18:26,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-01-27 18:18:26,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056497175141242 [2023-01-27 18:18:26,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-01-27 18:18:26,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-01-27 18:18:26,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:26,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-01-27 18:18:26,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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-27 18:18:26,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 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-27 18:18:26,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 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-27 18:18:26,242 INFO L175 Difference]: Start difference. First operand has 38 places, 21 transitions, 70 flow. Second operand 3 states and 358 transitions. [2023-01-27 18:18:26,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 158 flow [2023-01-27 18:18:26,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 137 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-01-27 18:18:26,245 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 78 flow [2023-01-27 18:18:26,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-01-27 18:18:26,247 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 18:18:26,247 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 78 flow [2023-01-27 18:18:26,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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-27 18:18:26,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:26,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:26,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 18:18:26,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:26,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 407703832, now seen corresponding path program 1 times [2023-01-27 18:18:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:26,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771754365] [2023-01-27 18:18:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:28,413 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-27 18:18:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771754365] [2023-01-27 18:18:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771754365] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:28,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:28,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 18:18:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536311874] [2023-01-27 18:18:28,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:28,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 18:18:28,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:28,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 18:18:28,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-27 18:18:28,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 236 [2023-01-27 18:18:28,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 78 flow. Second operand has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 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-27 18:18:28,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:28,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 236 [2023-01-27 18:18:28,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:28,833 INFO L130 PetriNetUnfolder]: 258/466 cut-off events. [2023-01-27 18:18:28,833 INFO L131 PetriNetUnfolder]: For 101/106 co-relation queries the response was YES. [2023-01-27 18:18:28,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 466 events. 258/466 cut-off events. For 101/106 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1924 event pairs, 121 based on Foata normal form. 23/489 useless extension candidates. Maximal degree in co-relation 1182. Up to 274 conditions per place. [2023-01-27 18:18:28,835 INFO L137 encePairwiseOnDemand]: 228/236 looper letters, 37 selfloop transitions, 7 changer transitions 16/62 dead transitions. [2023-01-27 18:18:28,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 62 transitions, 320 flow [2023-01-27 18:18:28,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 18:18:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 18:18:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 736 transitions. [2023-01-27 18:18:28,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3898305084745763 [2023-01-27 18:18:28,838 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 736 transitions. [2023-01-27 18:18:28,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 736 transitions. [2023-01-27 18:18:28,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:28,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 736 transitions. [2023-01-27 18:18:28,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 92.0) internal successors, (736), 8 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 18:18:28,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 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-27 18:18:28,843 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 236.0) internal successors, (2124), 9 states have internal predecessors, (2124), 0 states have call successors, (0), 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-27 18:18:28,843 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 78 flow. Second operand 8 states and 736 transitions. [2023-01-27 18:18:28,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 62 transitions, 320 flow [2023-01-27 18:18:28,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 18:18:28,845 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 129 flow [2023-01-27 18:18:28,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=129, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-01-27 18:18:28,846 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-27 18:18:28,846 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 129 flow [2023-01-27 18:18:28,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.0) internal successors, (609), 7 states have internal predecessors, (609), 0 states have call successors, (0), 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-27 18:18:28,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:28,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:28,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 18:18:28,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:28,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:28,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1427025261, now seen corresponding path program 1 times [2023-01-27 18:18:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:28,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264361436] [2023-01-27 18:18:28,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:29,160 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-27 18:18:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:29,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264361436] [2023-01-27 18:18:29,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264361436] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 18:18:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761189073] [2023-01-27 18:18:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:29,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 18:18:29,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 18:18:29,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 18:18:29,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-01-27 18:18:29,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-27 18:18:29,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:29,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-01-27 18:18:29,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:29,255 INFO L130 PetriNetUnfolder]: 104/221 cut-off events. [2023-01-27 18:18:29,255 INFO L131 PetriNetUnfolder]: For 190/206 co-relation queries the response was YES. [2023-01-27 18:18:29,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 221 events. 104/221 cut-off events. For 190/206 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 740 event pairs, 24 based on Foata normal form. 37/256 useless extension candidates. Maximal degree in co-relation 711. Up to 88 conditions per place. [2023-01-27 18:18:29,257 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 39 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2023-01-27 18:18:29,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 304 flow [2023-01-27 18:18:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 18:18:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 18:18:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-01-27 18:18:29,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503177966101695 [2023-01-27 18:18:29,259 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-01-27 18:18:29,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-01-27 18:18:29,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:29,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-01-27 18:18:29,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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-27 18:18:29,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 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-27 18:18:29,262 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 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-27 18:18:29,262 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 129 flow. Second operand 4 states and 475 transitions. [2023-01-27 18:18:29,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 304 flow [2023-01-27 18:18:29,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 292 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-27 18:18:29,264 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 160 flow [2023-01-27 18:18:29,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-01-27 18:18:29,265 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2023-01-27 18:18:29,265 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 160 flow [2023-01-27 18:18:29,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 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-27 18:18:29,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:29,265 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-27 18:18:29,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-27 18:18:29,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:29,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2044211323, now seen corresponding path program 1 times [2023-01-27 18:18:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331546648] [2023-01-27 18:18:29,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:29,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:29,603 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-27 18:18:29,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:29,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331546648] [2023-01-27 18:18:29,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331546648] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:29,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:29,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:18:29,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093368889] [2023-01-27 18:18:29,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:29,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:29,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:29,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:29,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 236 [2023-01-27 18:18:29,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 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-27 18:18:29,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:29,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 236 [2023-01-27 18:18:29,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:29,739 INFO L130 PetriNetUnfolder]: 76/165 cut-off events. [2023-01-27 18:18:29,739 INFO L131 PetriNetUnfolder]: For 277/311 co-relation queries the response was YES. [2023-01-27 18:18:29,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 165 events. 76/165 cut-off events. For 277/311 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 537 event pairs, 20 based on Foata normal form. 33/196 useless extension candidates. Maximal degree in co-relation 562. Up to 61 conditions per place. [2023-01-27 18:18:29,741 INFO L137 encePairwiseOnDemand]: 231/236 looper letters, 35 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2023-01-27 18:18:29,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 314 flow [2023-01-27 18:18:29,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:18:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:18:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-01-27 18:18:29,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49491525423728816 [2023-01-27 18:18:29,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-01-27 18:18:29,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-01-27 18:18:29,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:29,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-01-27 18:18:29,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 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-27 18:18:29,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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-27 18:18:29,748 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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-27 18:18:29,748 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 160 flow. Second operand 5 states and 584 transitions. [2023-01-27 18:18:29,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 314 flow [2023-01-27 18:18:29,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 282 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-01-27 18:18:29,750 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 156 flow [2023-01-27 18:18:29,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-01-27 18:18:29,751 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-01-27 18:18:29,751 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 156 flow [2023-01-27 18:18:29,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 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-27 18:18:29,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:29,751 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-27 18:18:29,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-27 18:18:29,752 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:29,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:29,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1628485414, now seen corresponding path program 1 times [2023-01-27 18:18:29,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:29,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750512756] [2023-01-27 18:18:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:29,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 18:18:30,080 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-27 18:18:30,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 18:18:30,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750512756] [2023-01-27 18:18:30,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750512756] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 18:18:30,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 18:18:30,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 18:18:30,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960906066] [2023-01-27 18:18:30,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 18:18:30,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 18:18:30,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 18:18:30,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 18:18:30,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-27 18:18:30,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 236 [2023-01-27 18:18:30,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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-27 18:18:30,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 18:18:30,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 236 [2023-01-27 18:18:30,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 18:18:30,217 INFO L130 PetriNetUnfolder]: 129/258 cut-off events. [2023-01-27 18:18:30,218 INFO L131 PetriNetUnfolder]: For 488/488 co-relation queries the response was YES. [2023-01-27 18:18:30,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 258 events. 129/258 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 912 event pairs, 33 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 905. Up to 153 conditions per place. [2023-01-27 18:18:30,219 INFO L137 encePairwiseOnDemand]: 232/236 looper letters, 32 selfloop transitions, 1 changer transitions 24/58 dead transitions. [2023-01-27 18:18:30,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 430 flow [2023-01-27 18:18:30,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 18:18:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 18:18:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 568 transitions. [2023-01-27 18:18:30,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48135593220338985 [2023-01-27 18:18:30,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 568 transitions. [2023-01-27 18:18:30,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 568 transitions. [2023-01-27 18:18:30,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 18:18:30,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 568 transitions. [2023-01-27 18:18:30,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 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-27 18:18:30,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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-27 18:18:30,225 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 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-27 18:18:30,225 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 156 flow. Second operand 5 states and 568 transitions. [2023-01-27 18:18:30,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 430 flow [2023-01-27 18:18:30,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 58 transitions, 364 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-01-27 18:18:30,228 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 127 flow [2023-01-27 18:18:30,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-01-27 18:18:30,228 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-01-27 18:18:30,228 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 127 flow [2023-01-27 18:18:30,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 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-27 18:18:30,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 18:18:30,229 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-27 18:18:30,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-27 18:18:30,229 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-01-27 18:18:30,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 18:18:30,230 INFO L85 PathProgramCache]: Analyzing trace with hash -311931218, now seen corresponding path program 2 times [2023-01-27 18:18:30,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 18:18:30,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387013388] [2023-01-27 18:18:30,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 18:18:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 18:18:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:18:30,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-27 18:18:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-27 18:18:30,454 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-27 18:18:30,455 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-27 18:18:30,456 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-01-27 18:18:30,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-01-27 18:18:30,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-01-27 18:18:30,458 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-01-27 18:18:30,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-01-27 18:18:30,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-01-27 18:18:30,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-27 18:18:30,459 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 18:18:30,464 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 18:18:30,464 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 18:18:30,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 06:18:30 BasicIcfg [2023-01-27 18:18:30,553 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 18:18:30,553 INFO L158 Benchmark]: Toolchain (without parser) took 15647.47ms. Allocated memory was 377.5MB in the beginning and 813.7MB in the end (delta: 436.2MB). Free memory was 315.8MB in the beginning and 521.5MB in the end (delta: -205.6MB). Peak memory consumption was 232.1MB. Max. memory is 16.0GB. [2023-01-27 18:18:30,553 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 377.5MB. Free memory is still 327.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 18:18:30,554 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.42ms. Allocated memory was 377.5MB in the beginning and 564.1MB in the end (delta: 186.6MB). Free memory was 315.6MB in the beginning and 525.0MB in the end (delta: -209.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. [2023-01-27 18:18:30,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.30ms. Allocated memory is still 564.1MB. Free memory was 525.0MB in the beginning and 522.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:18:30,554 INFO L158 Benchmark]: Boogie Preprocessor took 63.75ms. Allocated memory is still 564.1MB. Free memory was 522.9MB in the beginning and 520.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 18:18:30,555 INFO L158 Benchmark]: RCFGBuilder took 1053.35ms. Allocated memory is still 564.1MB. Free memory was 520.7MB in the beginning and 441.1MB in the end (delta: 79.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. [2023-01-27 18:18:30,555 INFO L158 Benchmark]: TraceAbstraction took 13918.49ms. Allocated memory was 564.1MB in the beginning and 813.7MB in the end (delta: 249.6MB). Free memory was 440.1MB in the beginning and 521.5MB in the end (delta: -81.4MB). Peak memory consumption was 169.2MB. Max. memory is 16.0GB. [2023-01-27 18:18:30,556 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.13ms. Allocated memory is still 377.5MB. Free memory is still 327.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 544.42ms. Allocated memory was 377.5MB in the beginning and 564.1MB in the end (delta: 186.6MB). Free memory was 315.6MB in the beginning and 525.0MB in the end (delta: -209.4MB). Peak memory consumption was 25.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.30ms. Allocated memory is still 564.1MB. Free memory was 525.0MB in the beginning and 522.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 63.75ms. Allocated memory is still 564.1MB. Free memory was 522.9MB in the beginning and 520.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1053.35ms. Allocated memory is still 564.1MB. Free memory was 520.7MB in the beginning and 441.1MB in the end (delta: 79.6MB). Peak memory consumption was 79.7MB. Max. memory is 16.0GB. * TraceAbstraction took 13918.49ms. Allocated memory was 564.1MB in the beginning and 813.7MB in the end (delta: 249.6MB). Free memory was 440.1MB in the beginning and 521.5MB in the end (delta: -81.4MB). Peak memory consumption was 169.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7s, 132 PlacesBefore, 34 PlacesAfterwards, 124 TransitionsBefore, 25 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 8 FixpointIterations, 58 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 5458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2377, independent: 2158, independent conditional: 0, independent unconditional: 2158, 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: 951, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2377, independent: 1239, independent conditional: 0, independent unconditional: 1239, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 951, unknown conditional: 0, unknown unconditional: 951] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2052, ((void *)0), P0, ((void *)0))=0, t2052={5: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2053, ((void *)0), P1, ((void *)0))=1, t2052={5:0}, t2053={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2054, ((void *)0), P2, ((void *)0))=2, t2052={5:0}, t2053={7:0}, t2054={8: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 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_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L777] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=0, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L828] 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) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] 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) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=0, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=0, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L772] 1 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, 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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 6 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: 13.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 583 IncrementalHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 3 mSDtfsCounter, 583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=6, InterpolantAutomatonStates: 39, 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, 3.8s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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-27 18:18:30,580 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...