/usr/bin/java -Xmx8000000000 -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-NoLbe-OGIterative-CovSimpl-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 16:38:29,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 16:38:29,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 16:38:29,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 16:38:29,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 16:38:29,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 16:38:29,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 16:38:29,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 16:38:29,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 16:38:29,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 16:38:29,451 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 16:38:29,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 16:38:29,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 16:38:29,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 16:38:29,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 16:38:29,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 16:38:29,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 16:38:29,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 16:38:29,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 16:38:29,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 16:38:29,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 16:38:29,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 16:38:29,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 16:38:29,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 16:38:29,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 16:38:29,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 16:38:29,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 16:38:29,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 16:38:29,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 16:38:29,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 16:38:29,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 16:38:29,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 16:38:29,484 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 16:38:29,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 16:38:29,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 16:38:29,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 16:38:29,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 16:38:29,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 16:38:29,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 16:38:29,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 16:38:29,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 16:38:29,490 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-NoLbe-OGIterative-CovSimpl-Hitting.epf [2021-08-13 16:38:29,519 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 16:38:29,519 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 16:38:29,521 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 16:38:29,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 16:38:29,522 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 16:38:29,522 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 16:38:29,522 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 16:38:29,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 16:38:29,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 16:38:29,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 16:38:29,523 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 16:38:29,523 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 16:38:29,523 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 16:38:29,523 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 16:38:29,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 16:38:29,523 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 16:38:29,524 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 16:38:29,524 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 16:38:29,524 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 16:38:29,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 16:38:29,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 16:38:29,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 16:38:29,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 16:38:29,525 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 16:38:29,526 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 16:38:29,526 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=true 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 [2021-08-13 16:38:29,812 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 16:38:29,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 16:38:29,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 16:38:29,829 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 16:38:29,829 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 16:38:29,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-08-13 16:38:29,874 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56d06d5/c67998b0d083456194cb009533515215/FLAG1a9d1af35 [2021-08-13 16:38:30,598 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 16:38:30,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-08-13 16:38:30,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56d06d5/c67998b0d083456194cb009533515215/FLAG1a9d1af35 [2021-08-13 16:38:30,899 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e56d06d5/c67998b0d083456194cb009533515215 [2021-08-13 16:38:30,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 16:38:30,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 16:38:30,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 16:38:30,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 16:38:30,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 16:38:30,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 04:38:30" (1/1) ... [2021-08-13 16:38:30,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5027e21f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:30, skipping insertion in model container [2021-08-13 16:38:30,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 04:38:30" (1/1) ... [2021-08-13 16:38:30,919 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 16:38:30,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 16:38:31,104 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i[950,963] [2021-08-13 16:38:31,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 16:38:31,273 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 16:38:31,280 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i[950,963] [2021-08-13 16:38:31,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 16:38:31,357 INFO L208 MainTranslator]: Completed translation [2021-08-13 16:38:31,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31 WrapperNode [2021-08-13 16:38:31,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 16:38:31,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 16:38:31,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 16:38:31,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 16:38:31,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,389 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 16:38:31,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 16:38:31,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 16:38:31,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 16:38:31,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... [2021-08-13 16:38:31,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 16:38:31,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 16:38:31,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 16:38:31,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 16:38:31,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 16:38:31,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 16:38:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 16:38:31,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 16:38:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 16:38:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 16:38:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 16:38:31,530 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 16:38:31,530 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 16:38:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 16:38:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 16:38:31,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 16:38:31,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 16:38:31,532 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 16:38:32,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 16:38:32,718 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 16:38:32,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 04:38:32 BoogieIcfgContainer [2021-08-13 16:38:32,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 16:38:32,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 16:38:32,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 16:38:32,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 16:38:32,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 04:38:30" (1/3) ... [2021-08-13 16:38:32,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3660dcca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 04:38:32, skipping insertion in model container [2021-08-13 16:38:32,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:38:31" (2/3) ... [2021-08-13 16:38:32,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3660dcca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 04:38:32, skipping insertion in model container [2021-08-13 16:38:32,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 04:38:32" (3/3) ... [2021-08-13 16:38:32,725 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2021-08-13 16:38:32,729 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 16:38:32,730 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 16:38:32,730 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 16:38:32,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,749 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,753 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,758 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,758 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,760 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,761 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,762 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,762 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 16:38:32,763 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 16:38:32,778 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-13 16:38:32,797 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 16:38:32,797 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 16:38:32,797 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 16:38:32,797 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 16:38:32,797 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 16:38:32,798 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 16:38:32,798 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 16:38:32,798 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 16:38:32,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-08-13 16:38:32,856 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-08-13 16:38:32,856 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 16:38:32,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-08-13 16:38:32,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 85 transitions, 180 flow [2021-08-13 16:38:32,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 83 transitions, 172 flow [2021-08-13 16:38:32,875 INFO L129 PetriNetUnfolder]: 0/38 cut-off events. [2021-08-13 16:38:32,875 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 16:38:32,876 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:32,877 INFO L266 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 16:38:32,881 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:32,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:32,885 INFO L82 PathProgramCache]: Analyzing trace with hash 182407281, now seen corresponding path program 1 times [2021-08-13 16:38:32,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:32,890 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336052867] [2021-08-13 16:38:32,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:33,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:33,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:33,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:33,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336052867] [2021-08-13 16:38:33,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336052867] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:33,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:33,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 16:38:33,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577927448] [2021-08-13 16:38:33,096 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 16:38:33,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:33,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 16:38:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 16:38:33,106 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 85 [2021-08-13 16:38:33,110 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,110 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:33,110 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 85 [2021-08-13 16:38:33,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:33,181 INFO L129 PetriNetUnfolder]: 16/143 cut-off events. [2021-08-13 16:38:33,181 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 16:38:33,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 143 events. 16/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 362 event pairs, 2 based on Foata normal form. 7/143 useless extension candidates. Maximal degree in co-relation 143. Up to 27 conditions per place. [2021-08-13 16:38:33,183 INFO L132 encePairwiseOnDemand]: 80/85 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2021-08-13 16:38:33,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 82 transitions, 188 flow [2021-08-13 16:38:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 16:38:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 16:38:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2021-08-13 16:38:33,191 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2021-08-13 16:38:33,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2021-08-13 16:38:33,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2021-08-13 16:38:33,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:33,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2021-08-13 16:38:33,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,200 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 0 predicate places. [2021-08-13 16:38:33,200 INFO L482 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 188 flow [2021-08-13 16:38:33,201 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,201 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:33,201 INFO L266 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, 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] [2021-08-13 16:38:33,201 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 16:38:33,201 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:33,201 INFO L82 PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times [2021-08-13 16:38:33,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:33,202 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384712233] [2021-08-13 16:38:33,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:33,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:33,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:33,325 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 16:38:33,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 16:38:33,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:33,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:33,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:33,357 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:33,357 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384712233] [2021-08-13 16:38:33,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384712233] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:33,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:33,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 16:38:33,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86914041] [2021-08-13 16:38:33,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 16:38:33,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 16:38:33,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 16:38:33,362 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 16:38:33,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:33,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 16:38:33,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:33,535 INFO L129 PetriNetUnfolder]: 59/348 cut-off events. [2021-08-13 16:38:33,535 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-08-13 16:38:33,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 348 events. 59/348 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1854 event pairs, 22 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 477. Up to 72 conditions per place. [2021-08-13 16:38:33,538 INFO L132 encePairwiseOnDemand]: 78/85 looper letters, 10 selfloop transitions, 3 changer transitions 22/106 dead transitions. [2021-08-13 16:38:33,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 106 transitions, 310 flow [2021-08-13 16:38:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 16:38:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 16:38:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 683 transitions. [2021-08-13 16:38:33,540 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8928104575163399 [2021-08-13 16:38:33,540 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 683 transitions. [2021-08-13 16:38:33,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 683 transitions. [2021-08-13 16:38:33,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:33,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 683 transitions. [2021-08-13 16:38:33,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.88888888888889) internal successors, (683), 9 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,545 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,545 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2021-08-13 16:38:33,545 INFO L482 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 310 flow [2021-08-13 16:38:33,545 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,546 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:33,546 INFO L266 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, 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] [2021-08-13 16:38:33,546 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 16:38:33,546 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:33,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1675875978, now seen corresponding path program 1 times [2021-08-13 16:38:33,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:33,547 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71804104] [2021-08-13 16:38:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:33,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:33,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:33,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 16:38:33,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 16:38:33,677 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-08-13 16:38:33,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-13 16:38:33,703 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 16:38:33,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 16:38:33,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:33,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:33,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:33,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:33,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:33,739 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71804104] [2021-08-13 16:38:33,739 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71804104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:33,739 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:33,739 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 16:38:33,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391504275] [2021-08-13 16:38:33,739 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 16:38:33,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:33,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 16:38:33,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-13 16:38:33,742 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 85 [2021-08-13 16:38:33,742 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 310 flow. Second operand has 9 states, 9 states have (on average 68.11111111111111) internal successors, (613), 9 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:33,742 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:33,742 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 85 [2021-08-13 16:38:33,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:34,020 INFO L129 PetriNetUnfolder]: 275/966 cut-off events. [2021-08-13 16:38:34,020 INFO L130 PetriNetUnfolder]: For 233/285 co-relation queries the response was YES. [2021-08-13 16:38:34,022 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 966 events. 275/966 cut-off events. For 233/285 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6797 event pairs, 49 based on Foata normal form. 0/945 useless extension candidates. Maximal degree in co-relation 1842. Up to 186 conditions per place. [2021-08-13 16:38:34,025 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 17 selfloop transitions, 5 changer transitions 68/149 dead transitions. [2021-08-13 16:38:34,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 149 transitions, 614 flow [2021-08-13 16:38:34,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 16:38:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 16:38:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 788 transitions. [2021-08-13 16:38:34,027 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8427807486631016 [2021-08-13 16:38:34,027 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 788 transitions. [2021-08-13 16:38:34,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 788 transitions. [2021-08-13 16:38:34,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:34,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 788 transitions. [2021-08-13 16:38:34,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 71.63636363636364) internal successors, (788), 11 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,031 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,031 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 18 predicate places. [2021-08-13 16:38:34,031 INFO L482 AbstractCegarLoop]: Abstraction has has 106 places, 149 transitions, 614 flow [2021-08-13 16:38:34,032 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 68.11111111111111) internal successors, (613), 9 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,032 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:34,032 INFO L266 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, 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] [2021-08-13 16:38:34,032 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 16:38:34,033 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:34,033 INFO L82 PathProgramCache]: Analyzing trace with hash 585299762, now seen corresponding path program 1 times [2021-08-13 16:38:34,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:34,034 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61538994] [2021-08-13 16:38:34,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:34,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:34,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:34,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 16:38:34,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 16:38:34,171 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-08-13 16:38:34,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-13 16:38:34,191 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 16:38:34,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 16:38:34,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:34,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:34,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:34,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:34,221 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:34,221 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61538994] [2021-08-13 16:38:34,221 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61538994] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:34,221 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:34,221 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 16:38:34,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307246222] [2021-08-13 16:38:34,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 16:38:34,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 16:38:34,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-08-13 16:38:34,224 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 85 [2021-08-13 16:38:34,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 149 transitions, 614 flow. Second operand has 9 states, 9 states have (on average 68.22222222222223) internal successors, (614), 9 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,224 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:34,224 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 85 [2021-08-13 16:38:34,224 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:34,548 INFO L129 PetriNetUnfolder]: 289/1111 cut-off events. [2021-08-13 16:38:34,548 INFO L130 PetriNetUnfolder]: For 326/624 co-relation queries the response was YES. [2021-08-13 16:38:34,550 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 1111 events. 289/1111 cut-off events. For 326/624 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8700 event pairs, 20 based on Foata normal form. 6/1097 useless extension candidates. Maximal degree in co-relation 2605. Up to 309 conditions per place. [2021-08-13 16:38:34,552 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 24 selfloop transitions, 7 changer transitions 117/207 dead transitions. [2021-08-13 16:38:34,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 207 transitions, 1224 flow [2021-08-13 16:38:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 16:38:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 16:38:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 790 transitions. [2021-08-13 16:38:34,553 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8449197860962567 [2021-08-13 16:38:34,554 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 790 transitions. [2021-08-13 16:38:34,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 790 transitions. [2021-08-13 16:38:34,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:34,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 790 transitions. [2021-08-13 16:38:34,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 71.81818181818181) internal successors, (790), 11 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,556 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,557 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 28 predicate places. [2021-08-13 16:38:34,557 INFO L482 AbstractCegarLoop]: Abstraction has has 116 places, 207 transitions, 1224 flow [2021-08-13 16:38:34,557 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 68.22222222222223) internal successors, (614), 9 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,557 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:34,557 INFO L266 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, 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] [2021-08-13 16:38:34,557 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 16:38:34,557 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:34,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1162551630, now seen corresponding path program 1 times [2021-08-13 16:38:34,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:34,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263251307] [2021-08-13 16:38:34,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:34,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:34,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:34,621 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 16:38:34,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 16:38:34,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:34,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:34,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:34,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:34,644 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:34,644 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263251307] [2021-08-13 16:38:34,644 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263251307] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:34,644 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:34,645 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 16:38:34,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550457569] [2021-08-13 16:38:34,645 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 16:38:34,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:34,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 16:38:34,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 16:38:34,646 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 16:38:34,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 207 transitions, 1224 flow. Second operand has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:34,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 16:38:34,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:34,973 INFO L129 PetriNetUnfolder]: 503/1975 cut-off events. [2021-08-13 16:38:34,974 INFO L130 PetriNetUnfolder]: For 1128/1678 co-relation queries the response was YES. [2021-08-13 16:38:34,978 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 1975 events. 503/1975 cut-off events. For 1128/1678 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18391 event pairs, 15 based on Foata normal form. 9/1961 useless extension candidates. Maximal degree in co-relation 5293. Up to 590 conditions per place. [2021-08-13 16:38:34,981 INFO L132 encePairwiseOnDemand]: 79/85 looper letters, 17 selfloop transitions, 3 changer transitions 204/298 dead transitions. [2021-08-13 16:38:34,981 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 298 transitions, 2272 flow [2021-08-13 16:38:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 16:38:34,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 16:38:34,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 678 transitions. [2021-08-13 16:38:34,983 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8862745098039215 [2021-08-13 16:38:34,983 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 678 transitions. [2021-08-13 16:38:34,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 678 transitions. [2021-08-13 16:38:34,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:34,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 678 transitions. [2021-08-13 16:38:34,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 75.33333333333333) internal successors, (678), 9 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,986 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 85.0) internal successors, (850), 10 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,986 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 36 predicate places. [2021-08-13 16:38:34,986 INFO L482 AbstractCegarLoop]: Abstraction has has 124 places, 298 transitions, 2272 flow [2021-08-13 16:38:34,986 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.33333333333333) internal successors, (440), 6 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:34,986 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:34,986 INFO L266 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, 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] [2021-08-13 16:38:34,986 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 16:38:34,987 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:34,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1411057481, now seen corresponding path program 1 times [2021-08-13 16:38:34,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:34,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649473854] [2021-08-13 16:38:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:35,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:35,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:35,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 16:38:35,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 16:38:35,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 16:38:35,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 16:38:35,102 INFO L142 QuantifierPusher]: treesize reduction 21, result has 68.7 percent of original size [2021-08-13 16:38:35,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-08-13 16:38:35,133 INFO L142 QuantifierPusher]: treesize reduction 21, result has 70.0 percent of original size [2021-08-13 16:38:35,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-08-13 16:38:35,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 16:38:35,190 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 16:38:35,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 16:38:35,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:35,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:35,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:35,225 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:35,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649473854] [2021-08-13 16:38:35,226 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649473854] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:35,226 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:35,226 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 16:38:35,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105477582] [2021-08-13 16:38:35,226 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 16:38:35,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:35,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 16:38:35,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-08-13 16:38:35,228 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-08-13 16:38:35,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 298 transitions, 2272 flow. Second operand has 13 states, 13 states have (on average 64.15384615384616) internal successors, (834), 13 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:35,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:35,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-08-13 16:38:35,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:35,747 INFO L129 PetriNetUnfolder]: 528/2084 cut-off events. [2021-08-13 16:38:35,747 INFO L130 PetriNetUnfolder]: For 1476/2632 co-relation queries the response was YES. [2021-08-13 16:38:35,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6655 conditions, 2084 events. 528/2084 cut-off events. For 1476/2632 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19477 event pairs, 15 based on Foata normal form. 14/2077 useless extension candidates. Maximal degree in co-relation 6589. Up to 842 conditions per place. [2021-08-13 16:38:35,755 INFO L132 encePairwiseOnDemand]: 74/85 looper letters, 29 selfloop transitions, 9 changer transitions 290/384 dead transitions. [2021-08-13 16:38:35,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 384 transitions, 3692 flow [2021-08-13 16:38:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 16:38:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 16:38:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 937 transitions. [2021-08-13 16:38:35,758 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7873949579831933 [2021-08-13 16:38:35,758 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 937 transitions. [2021-08-13 16:38:35,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 937 transitions. [2021-08-13 16:38:35,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:35,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 937 transitions. [2021-08-13 16:38:35,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 66.92857142857143) internal successors, (937), 14 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:35,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:35,762 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 85.0) internal successors, (1275), 15 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:35,763 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 49 predicate places. [2021-08-13 16:38:35,763 INFO L482 AbstractCegarLoop]: Abstraction has has 137 places, 384 transitions, 3692 flow [2021-08-13 16:38:35,763 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 64.15384615384616) internal successors, (834), 13 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:35,763 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:35,763 INFO L266 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, 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, 1, 1] [2021-08-13 16:38:35,763 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 16:38:35,763 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:35,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1281109163, now seen corresponding path program 1 times [2021-08-13 16:38:35,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:35,764 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417704015] [2021-08-13 16:38:35,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:35,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:35,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:35,834 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 16:38:35,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 16:38:35,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 16:38:35,849 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 16:38:35,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:35,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:35,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:35,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:35,855 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:35,856 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417704015] [2021-08-13 16:38:35,856 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417704015] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:35,856 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:35,856 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 16:38:35,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698473519] [2021-08-13 16:38:35,856 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 16:38:35,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:35,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 16:38:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 16:38:35,857 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 16:38:35,857 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 384 transitions, 3692 flow. Second operand has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:35,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:35,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 16:38:35,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:36,036 INFO L129 PetriNetUnfolder]: 181/805 cut-off events. [2021-08-13 16:38:36,037 INFO L130 PetriNetUnfolder]: For 399/443 co-relation queries the response was YES. [2021-08-13 16:38:36,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 805 events. 181/805 cut-off events. For 399/443 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5682 event pairs, 27 based on Foata normal form. 0/758 useless extension candidates. Maximal degree in co-relation 2195. Up to 258 conditions per place. [2021-08-13 16:38:36,040 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 13 selfloop transitions, 14 changer transitions 68/184 dead transitions. [2021-08-13 16:38:36,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 184 transitions, 1344 flow [2021-08-13 16:38:36,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 16:38:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 16:38:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2021-08-13 16:38:36,042 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.888235294117647 [2021-08-13 16:38:36,042 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 755 transitions. [2021-08-13 16:38:36,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 755 transitions. [2021-08-13 16:38:36,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:36,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 755 transitions. [2021-08-13 16:38:36,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 75.5) internal successors, (755), 10 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,045 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 85.0) internal successors, (935), 11 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,045 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 46 predicate places. [2021-08-13 16:38:36,045 INFO L482 AbstractCegarLoop]: Abstraction has has 134 places, 184 transitions, 1344 flow [2021-08-13 16:38:36,045 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,045 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:36,045 INFO L266 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, 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, 1, 1, 1] [2021-08-13 16:38:36,045 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 16:38:36,045 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:36,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1933539938, now seen corresponding path program 1 times [2021-08-13 16:38:36,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:36,046 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040179581] [2021-08-13 16:38:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:36,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:36,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:36,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:36,115 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 16:38:36,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 16:38:36,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 16:38:36,132 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 16:38:36,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:36,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:36,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:36,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040179581] [2021-08-13 16:38:36,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040179581] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:36,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:36,142 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 16:38:36,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458805539] [2021-08-13 16:38:36,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 16:38:36,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 16:38:36,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 16:38:36,144 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 85 [2021-08-13 16:38:36,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 184 transitions, 1344 flow. Second operand has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:36,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 85 [2021-08-13 16:38:36,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:36,301 INFO L129 PetriNetUnfolder]: 80/395 cut-off events. [2021-08-13 16:38:36,302 INFO L130 PetriNetUnfolder]: For 116/328 co-relation queries the response was YES. [2021-08-13 16:38:36,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 395 events. 80/395 cut-off events. For 116/328 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2514 event pairs, 0 based on Foata normal form. 51/418 useless extension candidates. Maximal degree in co-relation 938. Up to 69 conditions per place. [2021-08-13 16:38:36,303 INFO L132 encePairwiseOnDemand]: 76/85 looper letters, 12 selfloop transitions, 17 changer transitions 40/134 dead transitions. [2021-08-13 16:38:36,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 134 transitions, 742 flow [2021-08-13 16:38:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 16:38:36,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 16:38:36,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 972 transitions. [2021-08-13 16:38:36,306 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8796380090497737 [2021-08-13 16:38:36,306 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 972 transitions. [2021-08-13 16:38:36,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 972 transitions. [2021-08-13 16:38:36,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:36,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 972 transitions. [2021-08-13 16:38:36,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 74.76923076923077) internal successors, (972), 13 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,309 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 85.0) internal successors, (1190), 14 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,309 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 43 predicate places. [2021-08-13 16:38:36,309 INFO L482 AbstractCegarLoop]: Abstraction has has 131 places, 134 transitions, 742 flow [2021-08-13 16:38:36,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,310 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:36,310 INFO L266 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, 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, 1, 1, 1, 1, 1, 1] [2021-08-13 16:38:36,310 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 16:38:36,310 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash 682839989, now seen corresponding path program 1 times [2021-08-13 16:38:36,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:36,311 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121461538] [2021-08-13 16:38:36,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 16:38:36,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:36,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 16:38:36,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 16:38:36,421 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-08-13 16:38:36,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-13 16:38:36,434 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-08-13 16:38:36,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-08-13 16:38:36,455 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-08-13 16:38:36,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-08-13 16:38:36,482 INFO L142 QuantifierPusher]: treesize reduction 63, result has 47.5 percent of original size [2021-08-13 16:38:36,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-08-13 16:38:36,508 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size [2021-08-13 16:38:36,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-08-13 16:38:36,526 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 16:38:36,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 16:38:36,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:36,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 16:38:36,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 16:38:36,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 16:38:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 16:38:36,561 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 16:38:36,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121461538] [2021-08-13 16:38:36,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121461538] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 16:38:36,562 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 16:38:36,562 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 16:38:36,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939043065] [2021-08-13 16:38:36,562 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 16:38:36,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 16:38:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 16:38:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-08-13 16:38:36,564 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 85 [2021-08-13 16:38:36,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 134 transitions, 742 flow. Second operand has 12 states, 12 states have (on average 64.41666666666667) internal successors, (773), 12 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 16:38:36,564 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 85 [2021-08-13 16:38:36,564 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 16:38:36,776 INFO L129 PetriNetUnfolder]: 124/559 cut-off events. [2021-08-13 16:38:36,776 INFO L130 PetriNetUnfolder]: For 197/265 co-relation queries the response was YES. [2021-08-13 16:38:36,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 559 events. 124/559 cut-off events. For 197/265 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4030 event pairs, 0 based on Foata normal form. 4/527 useless extension candidates. Maximal degree in co-relation 1412. Up to 109 conditions per place. [2021-08-13 16:38:36,778 INFO L132 encePairwiseOnDemand]: 75/85 looper letters, 14 selfloop transitions, 5 changer transitions 56/146 dead transitions. [2021-08-13 16:38:36,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 146 transitions, 972 flow [2021-08-13 16:38:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 16:38:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 16:38:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 724 transitions. [2021-08-13 16:38:36,781 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.774331550802139 [2021-08-13 16:38:36,781 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 724 transitions. [2021-08-13 16:38:36,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 724 transitions. [2021-08-13 16:38:36,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 16:38:36,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 724 transitions. [2021-08-13 16:38:36,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 65.81818181818181) internal successors, (724), 11 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,784 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 85.0) internal successors, (1020), 12 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,784 INFO L348 CegarLoopForPetriNet]: 88 programPoint places, 53 predicate places. [2021-08-13 16:38:36,784 INFO L482 AbstractCegarLoop]: Abstraction has has 141 places, 146 transitions, 972 flow [2021-08-13 16:38:36,785 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 64.41666666666667) internal successors, (773), 12 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 16:38:36,785 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 16:38:36,785 INFO L266 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, 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, 1, 1, 1, 1, 1, 1] [2021-08-13 16:38:36,785 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 16:38:36,785 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 16:38:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 16:38:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash -5007021, now seen corresponding path program 2 times [2021-08-13 16:38:36,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 16:38:36,785 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846569253] [2021-08-13 16:38:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 16:38:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 16:38:36,828 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 16:38:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 16:38:36,864 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 16:38:36,896 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 16:38:36,896 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 16:38:36,896 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 16:38:36,899 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 16:38:36,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 04:38:36 BasicIcfg [2021-08-13 16:38:36,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 16:38:36,978 INFO L168 Benchmark]: Toolchain (without parser) took 6076.04 ms. Allocated memory was 177.2 MB in the beginning and 275.8 MB in the end (delta: 98.6 MB). Free memory was 139.9 MB in the beginning and 151.7 MB in the end (delta: -11.8 MB). Peak memory consumption was 86.9 MB. Max. memory is 8.0 GB. [2021-08-13 16:38:36,978 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 177.2 MB. Free memory is still 158.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 16:38:36,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.15 ms. Allocated memory is still 177.2 MB. Free memory was 139.7 MB in the beginning and 135.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 8.0 GB. [2021-08-13 16:38:36,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.12 ms. Allocated memory is still 177.2 MB. Free memory was 135.6 MB in the beginning and 132.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 16:38:36,979 INFO L168 Benchmark]: Boogie Preprocessor took 26.07 ms. Allocated memory is still 177.2 MB. Free memory was 132.5 MB in the beginning and 130.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-08-13 16:38:36,979 INFO L168 Benchmark]: RCFGBuilder took 1267.52 ms. Allocated memory is still 177.2 MB. Free memory was 130.4 MB in the beginning and 127.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 8.0 GB. [2021-08-13 16:38:36,979 INFO L168 Benchmark]: TraceAbstraction took 4256.60 ms. Allocated memory was 177.2 MB in the beginning and 275.8 MB in the end (delta: 98.6 MB). Free memory was 126.9 MB in the beginning and 151.7 MB in the end (delta: -24.7 MB). Peak memory consumption was 73.9 MB. Max. memory is 8.0 GB. [2021-08-13 16:38:36,985 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.10 ms. Allocated memory is still 177.2 MB. Free memory is still 158.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 453.15 ms. Allocated memory is still 177.2 MB. Free memory was 139.7 MB in the beginning and 135.6 MB in the end (delta: 4.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.12 ms. Allocated memory is still 177.2 MB. Free memory was 135.6 MB in the beginning and 132.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 26.07 ms. Allocated memory is still 177.2 MB. Free memory was 132.5 MB in the beginning and 130.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1267.52 ms. Allocated memory is still 177.2 MB. Free memory was 130.4 MB in the beginning and 127.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 80.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4256.60 ms. Allocated memory was 177.2 MB in the beginning and 275.8 MB in the end (delta: 98.6 MB). Free memory was 126.9 MB in the beginning and 151.7 MB in the end (delta: -24.7 MB). Peak memory consumption was 73.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L716] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L717] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L718] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L719] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L790] 0 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L791] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2482; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L811] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L812] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 11.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 4103.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2361.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 65.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 98 SDtfs, 326 SDslu, 352 SDs, 0 SdLazy, 540 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 460.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1034.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3692occurred in iteration=6, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 32.1ms SsaConstructionTime, 403.1ms SatisfiabilityAnalysisTime, 1017.4ms InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 2874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! Received shutdown request...