/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:50:12,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:50:12,252 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:50:12,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:50:12,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:50:12,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:50:12,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:50:12,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:50:12,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:50:12,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:50:12,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:50:12,310 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:50:12,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:50:12,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:50:12,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:50:12,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:50:12,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:50:12,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:50:12,317 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:50:12,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:50:12,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:50:12,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:50:12,324 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:50:12,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:50:12,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:50:12,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:50:12,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:50:12,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:50:12,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:50:12,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:50:12,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:50:12,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:50:12,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:50:12,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:50:12,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:50:12,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:50:12,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:50:12,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:50:12,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:50:12,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:50:12,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:50:12,345 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:50:12,372 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:50:12,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:50:12,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:50:12,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:50:12,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:50:12,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:50:12,375 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:50:12,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:50:12,375 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:50:12,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:50:12,376 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:50:12,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:50:12,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:50:12,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:50:12,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:50:12,376 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:50:12,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:50:12,377 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:50:12,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:50:12,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:50:12,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:50:12,377 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:50:12,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:50:12,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:50:12,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:50:12,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:50:12,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:50:12,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:50:12,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:50:12,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:50:12,378 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:50:12,378 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:50:12,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:50:12,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:50:12,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:50:12,573 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:50:12,573 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:50:12,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2023-01-28 06:50:13,740 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:50:13,949 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:50:13,949 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014_tso.oepc.i [2023-01-28 06:50:13,964 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419e17f4d/9d51e2acd1d541309635d1ae5b98bd40/FLAG0de84afdd [2023-01-28 06:50:13,977 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/419e17f4d/9d51e2acd1d541309635d1ae5b98bd40 [2023-01-28 06:50:13,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:50:13,981 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:50:13,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:50:13,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:50:13,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:50:13,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:50:13" (1/1) ... [2023-01-28 06:50:13,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbedd61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:13, skipping insertion in model container [2023-01-28 06:50:13,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:50:13" (1/1) ... [2023-01-28 06:50:13,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:50:14,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:50:14,161 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/mix014_tso.oepc.i[949,962] [2023-01-28 06:50:14,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:50:14,448 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:50:14,461 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/mix014_tso.oepc.i[949,962] [2023-01-28 06:50:14,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:50:14,534 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:50:14,534 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 06:50:14,540 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:50:14,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14 WrapperNode [2023-01-28 06:50:14,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:50:14,542 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:50:14,542 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:50:14,542 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:50:14,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,590 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 263 [2023-01-28 06:50:14,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:50:14,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:50:14,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:50:14,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:50:14,599 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,616 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:50:14,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:50:14,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:50:14,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:50:14,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (1/1) ... [2023-01-28 06:50:14,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:50:14,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:50:14,649 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-28 06:50:14,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-28 06:50:14,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:50:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 06:50:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:50:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:50:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:50:14,690 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-01-28 06:50:14,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-01-28 06:50:14,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-01-28 06:50:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-01-28 06:50:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-01-28 06:50:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-01-28 06:50:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-01-28 06:50:14,692 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-01-28 06:50:14,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:50:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 06:50:14,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:50:14,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:50:14,694 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:50:14,872 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:50:14,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:50:15,314 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:50:15,561 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:50:15,561 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-01-28 06:50:15,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:50:15 BoogieIcfgContainer [2023-01-28 06:50:15,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:50:15,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:50:15,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:50:15,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:50:15,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:50:13" (1/3) ... [2023-01-28 06:50:15,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a98fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:50:15, skipping insertion in model container [2023-01-28 06:50:15,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:50:14" (2/3) ... [2023-01-28 06:50:15,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a98fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:50:15, skipping insertion in model container [2023-01-28 06:50:15,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:50:15" (3/3) ... [2023-01-28 06:50:15,569 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014_tso.oepc.i [2023-01-28 06:50:15,584 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:50:15,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-01-28 06:50:15,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:50:15,638 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:50:15,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 152 transitions, 324 flow [2023-01-28 06:50:15,716 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2023-01-28 06:50:15,717 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-01-28 06:50:15,722 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 152 transitions, 324 flow [2023-01-28 06:50:15,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 148 transitions, 308 flow [2023-01-28 06:50:15,734 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:50:15,743 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 148 transitions, 308 flow [2023-01-28 06:50:15,745 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 148 transitions, 308 flow [2023-01-28 06:50:15,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 148 transitions, 308 flow [2023-01-28 06:50:15,803 INFO L130 PetriNetUnfolder]: 2/148 cut-off events. [2023-01-28 06:50:15,804 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:15,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 2/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-01-28 06:50:15,806 INFO L119 LiptonReduction]: Number of co-enabled transitions 3408 [2023-01-28 06:50:21,350 INFO L134 LiptonReduction]: Checked pairs total: 10162 [2023-01-28 06:50:21,350 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-01-28 06:50:21,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:50:21,367 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;@6ca263d6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:50:21,368 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-01-28 06:50:21,371 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2023-01-28 06:50:21,371 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:50:21,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:21,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-01-28 06:50:21,372 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:21,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash 716636913, now seen corresponding path program 1 times [2023-01-28 06:50:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:21,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763189435] [2023-01-28 06:50:21,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:21,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763189435] [2023-01-28 06:50:21,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763189435] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:21,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:50:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49228526] [2023-01-28 06:50:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:21,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:50:21,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:21,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:50:21,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:50:21,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 277 [2023-01-28 06:50:21,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:21,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:21,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 277 [2023-01-28 06:50:21,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:23,699 INFO L130 PetriNetUnfolder]: 9199/12445 cut-off events. [2023-01-28 06:50:23,699 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2023-01-28 06:50:23,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25125 conditions, 12445 events. 9199/12445 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 66293 event pairs, 2059 based on Foata normal form. 0/11236 useless extension candidates. Maximal degree in co-relation 25113. Up to 10741 conditions per place. [2023-01-28 06:50:23,783 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 45 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-01-28 06:50:23,784 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 214 flow [2023-01-28 06:50:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:50:23,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:50:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-01-28 06:50:23,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5367027677496992 [2023-01-28 06:50:23,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-01-28 06:50:23,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-01-28 06:50:23,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:23,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-01-28 06:50:23,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:23,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:23,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:23,819 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 446 transitions. [2023-01-28 06:50:23,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 214 flow [2023-01-28 06:50:23,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 06:50:23,827 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 76 flow [2023-01-28 06:50:23,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-01-28 06:50:23,833 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-01-28 06:50:23,833 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2023-01-28 06:50:23,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:23,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:23,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:23,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:50:23,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:23,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1493411583, now seen corresponding path program 1 times [2023-01-28 06:50:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:23,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577560046] [2023-01-28 06:50:23,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:23,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:24,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:24,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577560046] [2023-01-28 06:50:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577560046] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:24,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-28 06:50:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333207568] [2023-01-28 06:50:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 06:50:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 06:50:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 06:50:24,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 277 [2023-01-28 06:50:24,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:24,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:24,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 277 [2023-01-28 06:50:24,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:25,469 INFO L130 PetriNetUnfolder]: 7251/10237 cut-off events. [2023-01-28 06:50:25,469 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-01-28 06:50:25,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20719 conditions, 10237 events. 7251/10237 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 55958 event pairs, 1983 based on Foata normal form. 0/9780 useless extension candidates. Maximal degree in co-relation 20709. Up to 7717 conditions per place. [2023-01-28 06:50:25,523 INFO L137 encePairwiseOnDemand]: 274/277 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-01-28 06:50:25,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 204 flow [2023-01-28 06:50:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 06:50:25,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 06:50:25,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-01-28 06:50:25,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5318892900120337 [2023-01-28 06:50:25,526 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-01-28 06:50:25,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-01-28 06:50:25,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:25,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-01-28 06:50:25,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 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-28 06:50:25,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:25,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 277.0) internal successors, (1108), 4 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:25,529 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 3 states and 442 transitions. [2023-01-28 06:50:25,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 204 flow [2023-01-28 06:50:25,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:50:25,531 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 72 flow [2023-01-28 06:50:25,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-01-28 06:50:25,532 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-01-28 06:50:25,532 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 72 flow [2023-01-28 06:50:25,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:25,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:25,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:25,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:50:25,533 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:25,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1302217783, now seen corresponding path program 1 times [2023-01-28 06:50:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:25,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510689824] [2023-01-28 06:50:25,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:25,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:26,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:26,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510689824] [2023-01-28 06:50:26,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510689824] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:26,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:26,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:50:26,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298948050] [2023-01-28 06:50:26,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:26,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:50:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:26,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:50:26,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:50:26,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-01-28 06:50:26,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:26,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:26,129 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-01-28 06:50:26,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:28,559 INFO L130 PetriNetUnfolder]: 14917/20088 cut-off events. [2023-01-28 06:50:28,559 INFO L131 PetriNetUnfolder]: For 1010/1010 co-relation queries the response was YES. [2023-01-28 06:50:28,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41572 conditions, 20088 events. 14917/20088 cut-off events. For 1010/1010 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 100574 event pairs, 3485 based on Foata normal form. 900/20988 useless extension candidates. Maximal degree in co-relation 41562. Up to 13233 conditions per place. [2023-01-28 06:50:28,640 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 47 selfloop transitions, 2 changer transitions 32/81 dead transitions. [2023-01-28 06:50:28,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 81 transitions, 346 flow [2023-01-28 06:50:28,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-01-28 06:50:28,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467870036101083 [2023-01-28 06:50:28,642 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-01-28 06:50:28,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-01-28 06:50:28,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:28,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-01-28 06:50:28,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:28,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:28,647 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:28,647 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 5 states and 648 transitions. [2023-01-28 06:50:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 81 transitions, 346 flow [2023-01-28 06:50:28,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 81 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 06:50:28,652 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 80 flow [2023-01-28 06:50:28,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2023-01-28 06:50:28,652 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-01-28 06:50:28,653 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 80 flow [2023-01-28 06:50:28,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:28,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:28,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:28,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 06:50:28,654 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:28,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:28,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1573204752, now seen corresponding path program 1 times [2023-01-28 06:50:28,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:28,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706688724] [2023-01-28 06:50:28,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:28,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:29,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:29,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706688724] [2023-01-28 06:50:29,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706688724] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:29,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:29,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:50:29,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629757852] [2023-01-28 06:50:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:29,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:50:29,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:29,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:50:29,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:50:29,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 277 [2023-01-28 06:50:29,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 80 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:29,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:29,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 277 [2023-01-28 06:50:29,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:31,149 INFO L130 PetriNetUnfolder]: 13121/17724 cut-off events. [2023-01-28 06:50:31,149 INFO L131 PetriNetUnfolder]: For 2632/2632 co-relation queries the response was YES. [2023-01-28 06:50:31,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38547 conditions, 17724 events. 13121/17724 cut-off events. For 2632/2632 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 84304 event pairs, 3458 based on Foata normal form. 600/18324 useless extension candidates. Maximal degree in co-relation 38534. Up to 10709 conditions per place. [2023-01-28 06:50:31,223 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 55 selfloop transitions, 7 changer transitions 28/90 dead transitions. [2023-01-28 06:50:31,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 90 transitions, 392 flow [2023-01-28 06:50:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-28 06:50:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-28 06:50:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-01-28 06:50:31,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46329723225030084 [2023-01-28 06:50:31,226 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-01-28 06:50:31,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-01-28 06:50:31,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:31,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-01-28 06:50:31,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:31,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:31,232 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 277.0) internal successors, (1939), 7 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:31,232 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 80 flow. Second operand 6 states and 770 transitions. [2023-01-28 06:50:31,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 90 transitions, 392 flow [2023-01-28 06:50:31,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 90 transitions, 380 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-01-28 06:50:31,368 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 122 flow [2023-01-28 06:50:31,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-01-28 06:50:31,370 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-01-28 06:50:31,371 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 122 flow [2023-01-28 06:50:31,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:31,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:31,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:31,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:50:31,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:31,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash 417683074, now seen corresponding path program 1 times [2023-01-28 06:50:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701480178] [2023-01-28 06:50:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:31,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701480178] [2023-01-28 06:50:31,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701480178] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:31,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:31,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 06:50:31,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254372204] [2023-01-28 06:50:31,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:31,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 06:50:31,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:31,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 06:50:31,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 06:50:31,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-01-28 06:50:31,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:31,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:31,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-01-28 06:50:31,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:32,662 INFO L130 PetriNetUnfolder]: 4998/7179 cut-off events. [2023-01-28 06:50:32,662 INFO L131 PetriNetUnfolder]: For 2575/2575 co-relation queries the response was YES. [2023-01-28 06:50:32,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17604 conditions, 7179 events. 4998/7179 cut-off events. For 2575/2575 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 38634 event pairs, 935 based on Foata normal form. 488/7586 useless extension candidates. Maximal degree in co-relation 17589. Up to 4562 conditions per place. [2023-01-28 06:50:32,696 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 69 selfloop transitions, 8 changer transitions 14/96 dead transitions. [2023-01-28 06:50:32,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 96 transitions, 510 flow [2023-01-28 06:50:32,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:32,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-01-28 06:50:32,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068592057761733 [2023-01-28 06:50:32,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-01-28 06:50:32,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-01-28 06:50:32,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:32,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-01-28 06:50:32,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:32,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:32,705 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:32,705 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 122 flow. Second operand 5 states and 702 transitions. [2023-01-28 06:50:32,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 96 transitions, 510 flow [2023-01-28 06:50:32,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 96 transitions, 503 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-01-28 06:50:32,715 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 178 flow [2023-01-28 06:50:32,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-01-28 06:50:32,718 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-01-28 06:50:32,718 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 178 flow [2023-01-28 06:50:32,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:32,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:32,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:32,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 06:50:32,719 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:32,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:32,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1980879058, now seen corresponding path program 1 times [2023-01-28 06:50:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310519621] [2023-01-28 06:50:32,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:32,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:33,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:33,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310519621] [2023-01-28 06:50:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310519621] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:33,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:33,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:50:33,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144138487] [2023-01-28 06:50:33,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:33,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:50:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:33,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:50:33,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:50:33,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-01-28 06:50:33,168 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:33,168 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:33,168 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-01-28 06:50:33,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:34,205 INFO L130 PetriNetUnfolder]: 3731/5562 cut-off events. [2023-01-28 06:50:34,206 INFO L131 PetriNetUnfolder]: For 3878/3878 co-relation queries the response was YES. [2023-01-28 06:50:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16702 conditions, 5562 events. 3731/5562 cut-off events. For 3878/3878 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 30629 event pairs, 539 based on Foata normal form. 298/5796 useless extension candidates. Maximal degree in co-relation 16685. Up to 1526 conditions per place. [2023-01-28 06:50:34,245 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 86 selfloop transitions, 15 changer transitions 25/131 dead transitions. [2023-01-28 06:50:34,246 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 131 transitions, 782 flow [2023-01-28 06:50:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:50:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:50:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 983 transitions. [2023-01-28 06:50:34,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069623517276947 [2023-01-28 06:50:34,249 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 983 transitions. [2023-01-28 06:50:34,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 983 transitions. [2023-01-28 06:50:34,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:34,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 983 transitions. [2023-01-28 06:50:34,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.42857142857142) internal successors, (983), 7 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:34,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:34,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:34,256 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 178 flow. Second operand 7 states and 983 transitions. [2023-01-28 06:50:34,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 131 transitions, 782 flow [2023-01-28 06:50:34,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 131 transitions, 777 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-28 06:50:34,271 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 277 flow [2023-01-28 06:50:34,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-01-28 06:50:34,273 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 13 predicate places. [2023-01-28 06:50:34,273 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 277 flow [2023-01-28 06:50:34,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:34,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:34,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:34,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 06:50:34,275 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:34,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash 645250139, now seen corresponding path program 1 times [2023-01-28 06:50:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518606753] [2023-01-28 06:50:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:34,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:34,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518606753] [2023-01-28 06:50:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518606753] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:50:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301543153] [2023-01-28 06:50:34,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:34,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:50:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:50:34,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:50:34,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-01-28 06:50:34,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:34,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:34,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-01-28 06:50:34,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:35,518 INFO L130 PetriNetUnfolder]: 3161/4759 cut-off events. [2023-01-28 06:50:35,518 INFO L131 PetriNetUnfolder]: For 6380/6380 co-relation queries the response was YES. [2023-01-28 06:50:35,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15845 conditions, 4759 events. 3161/4759 cut-off events. For 6380/6380 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 26155 event pairs, 480 based on Foata normal form. 100/4795 useless extension candidates. Maximal degree in co-relation 15824. Up to 1235 conditions per place. [2023-01-28 06:50:35,536 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 98 selfloop transitions, 20 changer transitions 37/160 dead transitions. [2023-01-28 06:50:35,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 160 transitions, 1041 flow [2023-01-28 06:50:35,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:50:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:50:35,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1262 transitions. [2023-01-28 06:50:35,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062174087444845 [2023-01-28 06:50:35,544 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1262 transitions. [2023-01-28 06:50:35,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1262 transitions. [2023-01-28 06:50:35,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:35,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1262 transitions. [2023-01-28 06:50:35,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 140.22222222222223) internal successors, (1262), 9 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:35,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:35,552 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:35,552 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 277 flow. Second operand 9 states and 1262 transitions. [2023-01-28 06:50:35,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 160 transitions, 1041 flow [2023-01-28 06:50:35,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 160 transitions, 1006 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-01-28 06:50:35,645 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 358 flow [2023-01-28 06:50:35,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=358, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2023-01-28 06:50:35,646 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2023-01-28 06:50:35,646 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 358 flow [2023-01-28 06:50:35,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:35,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:35,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:35,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-28 06:50:35,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:35,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:35,647 INFO L85 PathProgramCache]: Analyzing trace with hash 985816812, now seen corresponding path program 1 times [2023-01-28 06:50:35,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:35,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463809819] [2023-01-28 06:50:35,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:36,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463809819] [2023-01-28 06:50:36,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463809819] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:36,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:36,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-28 06:50:36,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460895521] [2023-01-28 06:50:36,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:36,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 06:50:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:36,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 06:50:36,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-28 06:50:36,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 277 [2023-01-28 06:50:36,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:36,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:36,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 277 [2023-01-28 06:50:36,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:37,613 INFO L130 PetriNetUnfolder]: 8015/11578 cut-off events. [2023-01-28 06:50:37,613 INFO L131 PetriNetUnfolder]: For 18969/18969 co-relation queries the response was YES. [2023-01-28 06:50:37,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38123 conditions, 11578 events. 8015/11578 cut-off events. For 18969/18969 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 62138 event pairs, 1339 based on Foata normal form. 13/11591 useless extension candidates. Maximal degree in co-relation 38098. Up to 7252 conditions per place. [2023-01-28 06:50:37,645 INFO L137 encePairwiseOnDemand]: 268/277 looper letters, 96 selfloop transitions, 11 changer transitions 60/167 dead transitions. [2023-01-28 06:50:37,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 167 transitions, 1369 flow [2023-01-28 06:50:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 06:50:37,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 06:50:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2023-01-28 06:50:37,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45745229499742135 [2023-01-28 06:50:37,648 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 887 transitions. [2023-01-28 06:50:37,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 887 transitions. [2023-01-28 06:50:37,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:37,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 887 transitions. [2023-01-28 06:50:37,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:37,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:37,654 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 277.0) internal successors, (2216), 8 states have internal predecessors, (2216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:37,654 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 358 flow. Second operand 7 states and 887 transitions. [2023-01-28 06:50:37,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 167 transitions, 1369 flow [2023-01-28 06:50:37,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 167 transitions, 1185 flow, removed 51 selfloop flow, removed 7 redundant places. [2023-01-28 06:50:37,848 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 335 flow [2023-01-28 06:50:37,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=335, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-01-28 06:50:37,849 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-01-28 06:50:37,849 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 335 flow [2023-01-28 06:50:37,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:37,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:37,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:37,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-28 06:50:37,850 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:37,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:37,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2034581478, now seen corresponding path program 2 times [2023-01-28 06:50:37,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:37,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955869749] [2023-01-28 06:50:37,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:37,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:38,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:38,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955869749] [2023-01-28 06:50:38,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955869749] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:38,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:38,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:50:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704584893] [2023-01-28 06:50:38,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:38,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:50:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:50:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:50:38,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 277 [2023-01-28 06:50:38,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 335 flow. Second operand has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:38,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:38,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 277 [2023-01-28 06:50:38,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:40,013 INFO L130 PetriNetUnfolder]: 4531/6934 cut-off events. [2023-01-28 06:50:40,013 INFO L131 PetriNetUnfolder]: For 8478/8596 co-relation queries the response was YES. [2023-01-28 06:50:40,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23281 conditions, 6934 events. 4531/6934 cut-off events. For 8478/8596 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 39274 event pairs, 646 based on Foata normal form. 51/6776 useless extension candidates. Maximal degree in co-relation 23253. Up to 4115 conditions per place. [2023-01-28 06:50:40,051 INFO L137 encePairwiseOnDemand]: 267/277 looper letters, 114 selfloop transitions, 22 changer transitions 17/162 dead transitions. [2023-01-28 06:50:40,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 162 transitions, 1220 flow [2023-01-28 06:50:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-28 06:50:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-28 06:50:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1205 transitions. [2023-01-28 06:50:40,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4833533894905736 [2023-01-28 06:50:40,055 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1205 transitions. [2023-01-28 06:50:40,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1205 transitions. [2023-01-28 06:50:40,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:40,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1205 transitions. [2023-01-28 06:50:40,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.88888888888889) internal successors, (1205), 9 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:40,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:40,062 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 277.0) internal successors, (2770), 10 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:40,062 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 335 flow. Second operand 9 states and 1205 transitions. [2023-01-28 06:50:40,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 162 transitions, 1220 flow [2023-01-28 06:50:40,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 162 transitions, 1150 flow, removed 35 selfloop flow, removed 4 redundant places. [2023-01-28 06:50:40,143 INFO L231 Difference]: Finished difference. Result has 73 places, 72 transitions, 491 flow [2023-01-28 06:50:40,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=491, PETRI_PLACES=73, PETRI_TRANSITIONS=72} [2023-01-28 06:50:40,144 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2023-01-28 06:50:40,144 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 72 transitions, 491 flow [2023-01-28 06:50:40,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:40,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:40,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:40,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 06:50:40,145 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:40,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1613485612, now seen corresponding path program 3 times [2023-01-28 06:50:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400414450] [2023-01-28 06:50:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:40,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:40,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400414450] [2023-01-28 06:50:40,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400414450] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:40,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:40,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:50:40,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638037350] [2023-01-28 06:50:40,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:40,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-28 06:50:40,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:40,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-28 06:50:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-28 06:50:40,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 277 [2023-01-28 06:50:40,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 72 transitions, 491 flow. Second operand has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:40,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:40,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 277 [2023-01-28 06:50:40,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:41,700 INFO L130 PetriNetUnfolder]: 4345/6576 cut-off events. [2023-01-28 06:50:41,700 INFO L131 PetriNetUnfolder]: For 18151/18273 co-relation queries the response was YES. [2023-01-28 06:50:41,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27435 conditions, 6576 events. 4345/6576 cut-off events. For 18151/18273 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37499 event pairs, 780 based on Foata normal form. 92/6525 useless extension candidates. Maximal degree in co-relation 27411. Up to 2628 conditions per place. [2023-01-28 06:50:41,725 INFO L137 encePairwiseOnDemand]: 270/277 looper letters, 91 selfloop transitions, 18 changer transitions 44/162 dead transitions. [2023-01-28 06:50:41,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 162 transitions, 1352 flow [2023-01-28 06:50:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 06:50:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 06:50:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1097 transitions. [2023-01-28 06:50:41,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950361010830325 [2023-01-28 06:50:41,728 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1097 transitions. [2023-01-28 06:50:41,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1097 transitions. [2023-01-28 06:50:41,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:41,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1097 transitions. [2023-01-28 06:50:41,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.125) internal successors, (1097), 8 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:41,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:41,734 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 277.0) internal successors, (2493), 9 states have internal predecessors, (2493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:41,734 INFO L175 Difference]: Start difference. First operand has 73 places, 72 transitions, 491 flow. Second operand 8 states and 1097 transitions. [2023-01-28 06:50:41,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 162 transitions, 1352 flow [2023-01-28 06:50:41,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 162 transitions, 1301 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-01-28 06:50:41,836 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 415 flow [2023-01-28 06:50:41,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=415, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-01-28 06:50:41,836 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 32 predicate places. [2023-01-28 06:50:41,837 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 415 flow [2023-01-28 06:50:41,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.28571428571428) internal successors, (898), 7 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:41,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:41,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:41,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-01-28 06:50:41,837 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:41,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:41,838 INFO L85 PathProgramCache]: Analyzing trace with hash -591839033, now seen corresponding path program 1 times [2023-01-28 06:50:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:41,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917299694] [2023-01-28 06:50:41,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:41,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:42,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:42,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917299694] [2023-01-28 06:50:42,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917299694] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:42,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:42,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-28 06:50:42,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679708540] [2023-01-28 06:50:42,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:42,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-28 06:50:42,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:42,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-28 06:50:42,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-01-28 06:50:42,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 277 [2023-01-28 06:50:42,839 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 415 flow. Second operand has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:42,839 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:42,839 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 277 [2023-01-28 06:50:42,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:44,119 INFO L130 PetriNetUnfolder]: 5664/8549 cut-off events. [2023-01-28 06:50:44,119 INFO L131 PetriNetUnfolder]: For 22758/22758 co-relation queries the response was YES. [2023-01-28 06:50:44,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36231 conditions, 8549 events. 5664/8549 cut-off events. For 22758/22758 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 48114 event pairs, 964 based on Foata normal form. 1/8550 useless extension candidates. Maximal degree in co-relation 36200. Up to 4054 conditions per place. [2023-01-28 06:50:44,146 INFO L137 encePairwiseOnDemand]: 267/277 looper letters, 137 selfloop transitions, 22 changer transitions 50/209 dead transitions. [2023-01-28 06:50:44,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 209 transitions, 1769 flow [2023-01-28 06:50:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 06:50:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 06:50:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1160 transitions. [2023-01-28 06:50:44,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4187725631768953 [2023-01-28 06:50:44,149 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1160 transitions. [2023-01-28 06:50:44,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1160 transitions. [2023-01-28 06:50:44,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:44,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1160 transitions. [2023-01-28 06:50:44,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:44,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:44,157 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:44,157 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 415 flow. Second operand 10 states and 1160 transitions. [2023-01-28 06:50:44,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 209 transitions, 1769 flow [2023-01-28 06:50:44,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 209 transitions, 1554 flow, removed 54 selfloop flow, removed 9 redundant places. [2023-01-28 06:50:44,300 INFO L231 Difference]: Finished difference. Result has 80 places, 76 transitions, 513 flow [2023-01-28 06:50:44,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=513, PETRI_PLACES=80, PETRI_TRANSITIONS=76} [2023-01-28 06:50:44,301 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2023-01-28 06:50:44,301 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 76 transitions, 513 flow [2023-01-28 06:50:44,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:44,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:44,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:44,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-28 06:50:44,302 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:44,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:44,302 INFO L85 PathProgramCache]: Analyzing trace with hash 523332823, now seen corresponding path program 2 times [2023-01-28 06:50:44,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:44,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828483424] [2023-01-28 06:50:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:44,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828483424] [2023-01-28 06:50:44,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828483424] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:44,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:44,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 06:50:44,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619194548] [2023-01-28 06:50:44,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:44,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 06:50:44,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 06:50:44,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-01-28 06:50:44,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 277 [2023-01-28 06:50:44,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 76 transitions, 513 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:44,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:44,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 277 [2023-01-28 06:50:44,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:45,838 INFO L130 PetriNetUnfolder]: 5847/8914 cut-off events. [2023-01-28 06:50:45,838 INFO L131 PetriNetUnfolder]: For 25168/25195 co-relation queries the response was YES. [2023-01-28 06:50:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37557 conditions, 8914 events. 5847/8914 cut-off events. For 25168/25195 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 53857 event pairs, 1557 based on Foata normal form. 23/8867 useless extension candidates. Maximal degree in co-relation 37533. Up to 3700 conditions per place. [2023-01-28 06:50:45,871 INFO L137 encePairwiseOnDemand]: 273/277 looper letters, 78 selfloop transitions, 1 changer transitions 75/158 dead transitions. [2023-01-28 06:50:45,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 158 transitions, 1419 flow [2023-01-28 06:50:45,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 06:50:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 06:50:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2023-01-28 06:50:45,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888086642599278 [2023-01-28 06:50:45,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2023-01-28 06:50:45,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2023-01-28 06:50:45,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:45,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2023-01-28 06:50:45,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:45,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:45,877 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 277.0) internal successors, (1662), 6 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:45,877 INFO L175 Difference]: Start difference. First operand has 80 places, 76 transitions, 513 flow. Second operand 5 states and 677 transitions. [2023-01-28 06:50:45,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 158 transitions, 1419 flow [2023-01-28 06:50:46,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 158 transitions, 1400 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-01-28 06:50:46,049 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 469 flow [2023-01-28 06:50:46,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-01-28 06:50:46,049 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2023-01-28 06:50:46,049 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 469 flow [2023-01-28 06:50:46,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:46,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:46,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:46,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-01-28 06:50:46,050 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:46,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1380187699, now seen corresponding path program 3 times [2023-01-28 06:50:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:46,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407672609] [2023-01-28 06:50:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:50:48,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:50:48,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:50:48,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407672609] [2023-01-28 06:50:48,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407672609] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:50:48,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:50:48,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-01-28 06:50:48,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153164780] [2023-01-28 06:50:48,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:50:48,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 06:50:48,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:50:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 06:50:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-01-28 06:50:48,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 277 [2023-01-28 06:50:48,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 469 flow. Second operand has 12 states, 12 states have (on average 114.25) internal successors, (1371), 12 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:48,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:50:48,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 277 [2023-01-28 06:50:48,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:50:50,471 INFO L130 PetriNetUnfolder]: 4676/7445 cut-off events. [2023-01-28 06:50:50,471 INFO L131 PetriNetUnfolder]: For 19762/19989 co-relation queries the response was YES. [2023-01-28 06:50:50,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30644 conditions, 7445 events. 4676/7445 cut-off events. For 19762/19989 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 47104 event pairs, 635 based on Foata normal form. 62/7270 useless extension candidates. Maximal degree in co-relation 30613. Up to 2182 conditions per place. [2023-01-28 06:50:50,496 INFO L137 encePairwiseOnDemand]: 269/277 looper letters, 188 selfloop transitions, 19 changer transitions 33/245 dead transitions. [2023-01-28 06:50:50,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 245 transitions, 2014 flow [2023-01-28 06:50:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-28 06:50:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-28 06:50:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1245 transitions. [2023-01-28 06:50:50,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44945848375451264 [2023-01-28 06:50:50,499 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1245 transitions. [2023-01-28 06:50:50,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1245 transitions. [2023-01-28 06:50:50,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:50:50,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1245 transitions. [2023-01-28 06:50:50,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.5) internal successors, (1245), 10 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:50,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:50,506 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 277.0) internal successors, (3047), 11 states have internal predecessors, (3047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:50,506 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 469 flow. Second operand 10 states and 1245 transitions. [2023-01-28 06:50:50,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 245 transitions, 2014 flow [2023-01-28 06:50:50,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 245 transitions, 1992 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-01-28 06:50:50,634 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 597 flow [2023-01-28 06:50:50,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=597, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2023-01-28 06:50:50,634 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2023-01-28 06:50:50,634 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 597 flow [2023-01-28 06:50:50,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 114.25) internal successors, (1371), 12 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 06:50:50,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:50:50,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:50,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-01-28 06:50:50,635 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-01-28 06:50:50,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:50:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash -411139033, now seen corresponding path program 4 times [2023-01-28 06:50:50,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:50:50,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316875634] [2023-01-28 06:50:50,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:50:50,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:50:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:50:50,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-01-28 06:50:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-01-28 06:50:50,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-01-28 06:50:50,852 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-01-28 06:50:50,853 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-01-28 06:50:50,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-01-28 06:50:50,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-01-28 06:50:50,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-01-28 06:50:50,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-01-28 06:50:50,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-01-28 06:50:50,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-01-28 06:50:50,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-01-28 06:50:50,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-01-28 06:50:50,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-28 06:50:50,856 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:50:50,861 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 06:50:50,861 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 06:50:50,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 06:50:50 BasicIcfg [2023-01-28 06:50:50,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 06:50:50,970 INFO L158 Benchmark]: Toolchain (without parser) took 36990.01ms. Allocated memory was 333.4MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 290.4MB in the beginning and 2.2GB in the end (delta: -1.9GB). Peak memory consumption was 545.5MB. Max. memory is 16.0GB. [2023-01-28 06:50:50,971 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 255.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:50:50,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.29ms. Allocated memory is still 333.4MB. Free memory was 290.0MB in the beginning and 262.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-01-28 06:50:50,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.89ms. Allocated memory is still 333.4MB. Free memory was 262.1MB in the beginning and 258.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-01-28 06:50:50,971 INFO L158 Benchmark]: Boogie Preprocessor took 30.22ms. Allocated memory is still 333.4MB. Free memory was 258.3MB in the beginning and 255.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:50:50,971 INFO L158 Benchmark]: RCFGBuilder took 941.12ms. Allocated memory is still 333.4MB. Free memory was 255.6MB in the beginning and 251.3MB in the end (delta: 4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.0GB. [2023-01-28 06:50:50,972 INFO L158 Benchmark]: TraceAbstraction took 35405.44ms. Allocated memory was 333.4MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 250.5MB in the beginning and 2.2GB in the end (delta: -1.9GB). Peak memory consumption was 504.5MB. Max. memory is 16.0GB. [2023-01-28 06:50:50,977 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.11ms. Allocated memory is still 255.9MB. Free memory is still 212.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 558.29ms. Allocated memory is still 333.4MB. Free memory was 290.0MB in the beginning and 262.1MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.89ms. Allocated memory is still 333.4MB. Free memory was 262.1MB in the beginning and 258.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.22ms. Allocated memory is still 333.4MB. Free memory was 258.3MB in the beginning and 255.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 941.12ms. Allocated memory is still 333.4MB. Free memory was 255.6MB in the beginning and 251.3MB in the end (delta: 4.3MB). Peak memory consumption was 24.3MB. Max. memory is 16.0GB. * TraceAbstraction took 35405.44ms. Allocated memory was 333.4MB in the beginning and 2.7GB in the end (delta: 2.4GB). Free memory was 250.5MB in the beginning and 2.2GB in the end (delta: -1.9GB). Peak memory consumption was 504.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 159 PlacesBefore, 46 PlacesAfterwards, 148 TransitionsBefore, 34 TransitionsAfterwards, 3408 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 10162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3487, independent: 3226, independent conditional: 0, independent unconditional: 3226, dependent: 261, dependent conditional: 0, dependent unconditional: 261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1749, independent: 1706, independent conditional: 0, independent unconditional: 1706, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3487, independent: 1520, independent conditional: 0, independent unconditional: 1520, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 1749, unknown conditional: 0, unknown unconditional: 1749] , Statistics on independence cache: Total cache size (in pairs): 145, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool y$flush_delayed; [L748] 0 int y$mem_tmp; [L749] 0 _Bool y$r_buff0_thd0; [L750] 0 _Bool y$r_buff0_thd1; [L751] 0 _Bool y$r_buff0_thd2; [L752] 0 _Bool y$r_buff0_thd3; [L753] 0 _Bool y$r_buff0_thd4; [L754] 0 _Bool y$r_buff1_thd0; [L755] 0 _Bool y$r_buff1_thd1; [L756] 0 _Bool y$r_buff1_thd2; [L757] 0 _Bool y$r_buff1_thd3; [L758] 0 _Bool y$r_buff1_thd4; [L759] 0 _Bool y$read_delayed; [L760] 0 int *y$read_delayed_var; [L761] 0 int y$w_buff0; [L762] 0 _Bool y$w_buff0_used; [L763] 0 int y$w_buff1; [L764] 0 _Bool y$w_buff1_used; [L766] 0 int z = 0; [L767] 0 _Bool weak$$choice0; [L768] 0 _Bool weak$$choice2; [L922] 0 pthread_t t377; [L923] FCALL, FORK 0 pthread_create(&t377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t377, ((void *)0), P0, ((void *)0))=-3, t377={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L924] 0 pthread_t t378; [L925] FCALL, FORK 0 pthread_create(&t378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t378, ((void *)0), P1, ((void *)0))=-2, t377={5:0}, t378={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L926] 0 pthread_t t379; [L927] FCALL, FORK 0 pthread_create(&t379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t379, ((void *)0), P2, ((void *)0))=-1, t377={5:0}, t378={6:0}, t379={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L928] 0 pthread_t t380; [L929] FCALL, FORK 0 pthread_create(&t380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t380, ((void *)0), P3, ((void *)0))=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L792] 2 x$w_buff1 = x$w_buff0 [L793] 2 x$w_buff0 = 2 [L794] 2 x$w_buff1_used = x$w_buff0_used [L795] 2 x$w_buff0_used = (_Bool)1 [L796] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L796] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L797] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L798] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L799] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L800] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L801] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L802] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L851] 3 y$w_buff1 = y$w_buff0 [L852] 3 y$w_buff0 = 1 [L853] 3 y$w_buff1_used = y$w_buff0_used [L854] 3 y$w_buff0_used = (_Bool)1 [L855] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L855] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L856] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L857] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L858] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L859] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L860] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L861] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L886] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L889] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L892] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L772] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L775] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L778] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L779] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L780] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L781] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L782] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 2 x$flush_delayed = weak$$choice2 [L808] 2 x$mem_tmp = x [L809] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L810] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L811] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L812] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L813] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L815] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L816] 2 __unbuffered_p1_EAX = x [L817] 2 x = x$flush_delayed ? x$mem_tmp : x [L818] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L821] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 2 y$flush_delayed = weak$$choice2 [L824] 2 y$mem_tmp = y [L825] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L826] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L827] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L828] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L829] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L830] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L831] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L832] 2 __unbuffered_p1_EBX = y [L833] 2 y = y$flush_delayed ? y$mem_tmp : y [L834] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L867] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L868] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L869] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L870] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L871] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L872] 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) [L873] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L874] 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 [L875] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L876] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L895] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L896] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L897] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L898] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L899] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L900] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L901] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L902] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L903] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L904] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L837] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L838] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L839] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L840] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L841] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L844] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L846] 2 return 0; [L785] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 1 return 0; [L879] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L881] 3 return 0; [L907] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L909] 4 return 0; [L931] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L933] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L933] RET 0 assume_abort_if_not(main$tmp_guard0) [L935] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L936] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L937] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L938] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L939] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L940] 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) [L941] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L942] 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 [L943] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L944] 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=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t377={5:0}, t378={6:0}, t379={7:0}, t380={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L947] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L948] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L949] 0 x$flush_delayed = weak$$choice2 [L950] 0 x$mem_tmp = x [L951] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L952] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L953] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L954] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L955] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L957] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L958] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L959] 0 x = x$flush_delayed ? x$mem_tmp : x [L960] 0 x$flush_delayed = (_Bool)0 [L962] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 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: 925]: 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: 927]: 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: 929]: 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: 923]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 locations, 9 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: 35.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 776 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 776 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2367 IncrementalHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 48 mSDtfsCounter, 2367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=597occurred in iteration=13, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 3179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-01-28 06:50:51,003 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...