/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-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 11:35:55,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 11:35:55,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 11:35:55,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 11:35:55,041 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 11:35:55,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 11:35:55,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 11:35:55,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 11:35:55,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 11:35:55,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 11:35:55,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 11:35:55,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 11:35:55,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 11:35:55,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 11:35:55,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 11:35:55,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 11:35:55,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 11:35:55,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 11:35:55,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 11:35:55,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 11:35:55,058 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 11:35:55,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 11:35:55,060 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 11:35:55,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 11:35:55,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 11:35:55,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 11:35:55,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 11:35:55,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 11:35:55,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 11:35:55,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 11:35:55,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 11:35:55,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 11:35:55,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 11:35:55,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 11:35:55,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 11:35:55,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 11:35:55,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 11:35:55,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 11:35:55,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 11:35:55,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 11:35:55,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 11:35:55,073 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-Hitting.epf [2021-08-13 11:35:55,092 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 11:35:55,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 11:35:55,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 11:35:55,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 11:35:55,094 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 11:35:55,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 11:35:55,095 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 11:35:55,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 11:35:55,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 11:35:55,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 11:35:55,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 11:35:55,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 11:35:55,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 11:35:55,096 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 11:35:55,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 11:35:55,096 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 11:35:55,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 11:35:55,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 11:35:55,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 11:35:55,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 11:35:55,097 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 11:35:55,097 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 11:35:55,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 11:35:55,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 11:35:55,098 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 11:35:55,098 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 11:35:55,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 11:35:55,099 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 11:35:55,099 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 11:35:55,099 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 11:35:55,099 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 11:35:55,099 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 11:35:55,099 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 11:35:55,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 11:35:55,411 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 11:35:55,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 11:35:55,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 11:35:55,415 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 11:35:55,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2021-08-13 11:35:55,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d35c598/c31daf307bf3408c9f8a52f5289b60b1/FLAG24983dfe7 [2021-08-13 11:35:55,962 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 11:35:55,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2021-08-13 11:35:55,988 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d35c598/c31daf307bf3408c9f8a52f5289b60b1/FLAG24983dfe7 [2021-08-13 11:35:56,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d35c598/c31daf307bf3408c9f8a52f5289b60b1 [2021-08-13 11:35:56,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 11:35:56,498 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 11:35:56,500 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 11:35:56,500 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 11:35:56,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 11:35:56,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 11:35:56" (1/1) ... [2021-08-13 11:35:56,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ea46fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:56, skipping insertion in model container [2021-08-13 11:35:56,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 11:35:56" (1/1) ... [2021-08-13 11:35:56,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 11:35:56,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 11:35:56,687 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/safe030_rmo.opt.i[949,962] [2021-08-13 11:35:56,933 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 11:35:56,942 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 11:35:56,956 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/safe030_rmo.opt.i[949,962] [2021-08-13 11:35:57,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 11:35:57,102 INFO L208 MainTranslator]: Completed translation [2021-08-13 11:35:57,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57 WrapperNode [2021-08-13 11:35:57,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 11:35:57,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 11:35:57,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 11:35:57,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 11:35:57,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 11:35:57,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 11:35:57,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 11:35:57,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 11:35:57,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,206 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (1/1) ... [2021-08-13 11:35:57,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 11:35:57,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 11:35:57,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 11:35:57,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 11:35:57,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (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 11:35:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 11:35:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 11:35:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 11:35:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 11:35:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 11:35:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 11:35:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 11:35:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 11:35:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 11:35:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 11:35:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 11:35:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 11:35:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 11:35:57,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 11:35:57,303 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 11:35:59,121 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 11:35:59,121 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 11:35:59,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 11:35:59 BoogieIcfgContainer [2021-08-13 11:35:59,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 11:35:59,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 11:35:59,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 11:35:59,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 11:35:59,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 11:35:56" (1/3) ... [2021-08-13 11:35:59,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f375e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 11:35:59, skipping insertion in model container [2021-08-13 11:35:59,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 11:35:57" (2/3) ... [2021-08-13 11:35:59,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f375e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 11:35:59, skipping insertion in model container [2021-08-13 11:35:59,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 11:35:59" (3/3) ... [2021-08-13 11:35:59,133 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2021-08-13 11:35:59,142 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 11:35:59,143 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 11:35:59,143 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 11:35:59,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,180 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,180 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,183 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,188 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,192 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,193 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,199 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 11:35:59,203 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 11:35:59,223 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 11:35:59,246 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 11:35:59,246 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 11:35:59,246 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 11:35:59,246 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 11:35:59,246 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 11:35:59,247 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 11:35:59,247 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 11:35:59,247 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 11:35:59,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-08-13 11:35:59,292 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-08-13 11:35:59,292 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:35:59,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-08-13 11:35:59,296 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-08-13 11:35:59,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-08-13 11:35:59,313 INFO L129 PetriNetUnfolder]: 0/67 cut-off events. [2021-08-13 11:35:59,313 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:35:59,313 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:35:59,314 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] [2021-08-13 11:35:59,314 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:35:59,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:35:59,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1699461236, now seen corresponding path program 1 times [2021-08-13 11:35:59,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:35:59,326 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884724352] [2021-08-13 11:35:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:35:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:35:59,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:35:59,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:35:59,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:35:59,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:35:59,580 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 11:35:59,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:35:59,581 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884724352] [2021-08-13 11:35:59,582 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884724352] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:35:59,582 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:35:59,582 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 11:35:59,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034661366] [2021-08-13 11:35:59,591 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 11:35:59,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:35:59,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 11:35:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 11:35:59,606 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 104 [2021-08-13 11:35:59,611 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 11:35:59,611 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:35:59,611 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 104 [2021-08-13 11:35:59,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:35:59,744 INFO L129 PetriNetUnfolder]: 16/213 cut-off events. [2021-08-13 11:35:59,745 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 11:35:59,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 213 events. 16/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 660 event pairs, 6 based on Foata normal form. 9/211 useless extension candidates. Maximal degree in co-relation 212. Up to 27 conditions per place. [2021-08-13 11:35:59,749 INFO L132 encePairwiseOnDemand]: 99/104 looper letters, 7 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2021-08-13 11:35:59,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 100 transitions, 227 flow [2021-08-13 11:35:59,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 11:35:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 11:35:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2021-08-13 11:35:59,765 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2021-08-13 11:35:59,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2021-08-13 11:35:59,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2021-08-13 11:35:59,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:35:59,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2021-08-13 11:35:59,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 11:35:59,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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 11:35:59,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 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 11:35:59,783 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 0 predicate places. [2021-08-13 11:35:59,784 INFO L482 AbstractCegarLoop]: Abstraction has has 109 places, 100 transitions, 227 flow [2021-08-13 11:35:59,784 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 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 11:35:59,784 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:35:59,784 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 11:35:59,784 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 11:35:59,784 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:35:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:35:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1498850709, now seen corresponding path program 1 times [2021-08-13 11:35:59,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:35:59,786 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408683717] [2021-08-13 11:35:59,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:35:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:35:59,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:35:59,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:35:59,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:35:59,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:00,003 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:00,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:00,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:00,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:00,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:00,041 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 11:36:00,041 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:00,042 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408683717] [2021-08-13 11:36:00,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408683717] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:00,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:00,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:36:00,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880844789] [2021-08-13 11:36:00,044 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:36:00,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:36:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:36:00,047 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-08-13 11:36:00,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 100 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:36:00,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:00,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-08-13 11:36:00,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:00,269 INFO L129 PetriNetUnfolder]: 104/557 cut-off events. [2021-08-13 11:36:00,269 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-08-13 11:36:00,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 557 events. 104/557 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3452 event pairs, 23 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 779. Up to 111 conditions per place. [2021-08-13 11:36:00,274 INFO L132 encePairwiseOnDemand]: 97/104 looper letters, 10 selfloop transitions, 3 changer transitions 22/124 dead transitions. [2021-08-13 11:36:00,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 124 transitions, 349 flow [2021-08-13 11:36:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:36:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:36:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 854 transitions. [2021-08-13 11:36:00,277 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9123931623931624 [2021-08-13 11:36:00,277 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 854 transitions. [2021-08-13 11:36:00,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 854 transitions. [2021-08-13 11:36:00,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:00,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 854 transitions. [2021-08-13 11:36:00,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 0 states have call successors, (0), 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 11:36:00,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:00,283 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:00,283 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2021-08-13 11:36:00,283 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 349 flow [2021-08-13 11:36:00,284 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:36:00,284 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:00,284 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, 1, 1] [2021-08-13 11:36:00,284 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 11:36:00,285 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:00,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:00,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2143243498, now seen corresponding path program 1 times [2021-08-13 11:36:00,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:00,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242913200] [2021-08-13 11:36:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:00,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:00,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:00,389 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:00,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:00,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:00,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:00,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:00,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:00,430 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 11:36:00,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:00,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242913200] [2021-08-13 11:36:00,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242913200] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:00,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:00,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:36:00,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627778968] [2021-08-13 11:36:00,432 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:36:00,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:36:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:36:00,435 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-08-13 11:36:00,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:36:00,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:00,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-08-13 11:36:00,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:00,809 INFO L129 PetriNetUnfolder]: 431/1706 cut-off events. [2021-08-13 11:36:00,809 INFO L130 PetriNetUnfolder]: For 184/188 co-relation queries the response was YES. [2021-08-13 11:36:00,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2905 conditions, 1706 events. 431/1706 cut-off events. For 184/188 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 15097 event pairs, 110 based on Foata normal form. 0/1628 useless extension candidates. Maximal degree in co-relation 2853. Up to 312 conditions per place. [2021-08-13 11:36:00,823 INFO L132 encePairwiseOnDemand]: 97/104 looper letters, 10 selfloop transitions, 3 changer transitions 62/166 dead transitions. [2021-08-13 11:36:00,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 166 transitions, 623 flow [2021-08-13 11:36:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:36:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:36:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 854 transitions. [2021-08-13 11:36:00,826 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9123931623931624 [2021-08-13 11:36:00,826 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 854 transitions. [2021-08-13 11:36:00,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 854 transitions. [2021-08-13 11:36:00,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:00,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 854 transitions. [2021-08-13 11:36:00,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.88888888888889) internal successors, (854), 9 states have internal predecessors, (854), 0 states have call successors, (0), 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 11:36:00,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:00,864 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:00,864 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 16 predicate places. [2021-08-13 11:36:00,864 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 166 transitions, 623 flow [2021-08-13 11:36:00,865 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:36:00,865 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:00,865 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, 1, 1, 1] [2021-08-13 11:36:00,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 11:36:00,865 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:00,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1530956094, now seen corresponding path program 1 times [2021-08-13 11:36:00,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:00,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207389431] [2021-08-13 11:36:00,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:01,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:01,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:01,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:01,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:36:01,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:36:01,100 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-08-13 11:36:01,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-08-13 11:36:01,121 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:01,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:01,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:01,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:01,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:01,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:01,167 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 11:36:01,168 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:01,168 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207389431] [2021-08-13 11:36:01,168 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207389431] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:01,168 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:01,168 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:36:01,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955939349] [2021-08-13 11:36:01,169 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:36:01,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:01,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:36:01,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:36:01,172 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 104 [2021-08-13 11:36:01,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 166 transitions, 623 flow. Second operand has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 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 11:36:01,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:01,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 104 [2021-08-13 11:36:01,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:02,086 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_2 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_2, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][220], [113#true, 179#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 115#true, 116#true, 7#L18-1true, 135#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 152#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 41#L787true, 27#L765true, 30#L743true, 111#true]) [2021-08-13 11:36:02,087 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2021-08-13 11:36:02,087 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:02,087 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:02,087 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:02,296 INFO L129 PetriNetUnfolder]: 2440/6823 cut-off events. [2021-08-13 11:36:02,297 INFO L130 PetriNetUnfolder]: For 2243/2369 co-relation queries the response was YES. [2021-08-13 11:36:02,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14218 conditions, 6823 events. 2440/6823 cut-off events. For 2243/2369 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 69522 event pairs, 559 based on Foata normal form. 2/6641 useless extension candidates. Maximal degree in co-relation 14160. Up to 1291 conditions per place. [2021-08-13 11:36:02,394 INFO L132 encePairwiseOnDemand]: 92/104 looper letters, 15 selfloop transitions, 10 changer transitions 208/309 dead transitions. [2021-08-13 11:36:02,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 309 transitions, 1805 flow [2021-08-13 11:36:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-13 11:36:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-08-13 11:36:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1323 transitions. [2021-08-13 11:36:02,398 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8480769230769231 [2021-08-13 11:36:02,398 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1323 transitions. [2021-08-13 11:36:02,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1323 transitions. [2021-08-13 11:36:02,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:02,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1323 transitions. [2021-08-13 11:36:02,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 88.2) internal successors, (1323), 15 states have internal predecessors, (1323), 0 states have call successors, (0), 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 11:36:02,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 104.0) internal successors, (1664), 16 states have internal predecessors, (1664), 0 states have call successors, (0), 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 11:36:02,404 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 104.0) internal successors, (1664), 16 states have internal predecessors, (1664), 0 states have call successors, (0), 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 11:36:02,404 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 30 predicate places. [2021-08-13 11:36:02,404 INFO L482 AbstractCegarLoop]: Abstraction has has 139 places, 309 transitions, 1805 flow [2021-08-13 11:36:02,404 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 85.1) internal successors, (851), 10 states have internal predecessors, (851), 0 states have call successors, (0), 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 11:36:02,405 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:02,405 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, 1, 1, 1, 1, 1] [2021-08-13 11:36:02,406 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 11:36:02,406 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:02,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash -2128251684, now seen corresponding path program 1 times [2021-08-13 11:36:02,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:02,408 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160942119] [2021-08-13 11:36:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:02,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:02,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:02,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:02,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:02,509 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:02,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:02,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:02,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:02,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:02,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:02,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:02,548 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 11:36:02,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:02,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160942119] [2021-08-13 11:36:02,549 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160942119] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:02,549 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:02,549 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:36:02,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735703104] [2021-08-13 11:36:02,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:36:02,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:02,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:36:02,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:36:02,551 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-08-13 11:36:02,553 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 309 transitions, 1805 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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 11:36:02,553 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:02,553 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-08-13 11:36:02,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:03,708 INFO L129 PetriNetUnfolder]: 2780/8818 cut-off events. [2021-08-13 11:36:03,708 INFO L130 PetriNetUnfolder]: For 4320/4858 co-relation queries the response was YES. [2021-08-13 11:36:03,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20422 conditions, 8818 events. 2780/8818 cut-off events. For 4320/4858 co-relation queries the response was YES. Maximal size of possible extension queue 607. Compared 101277 event pairs, 589 based on Foata normal form. 32/8684 useless extension candidates. Maximal degree in co-relation 20361. Up to 1642 conditions per place. [2021-08-13 11:36:03,768 INFO L132 encePairwiseOnDemand]: 98/104 looper letters, 14 selfloop transitions, 3 changer transitions 308/413 dead transitions. [2021-08-13 11:36:03,768 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 413 transitions, 3187 flow [2021-08-13 11:36:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:36:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:36:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 849 transitions. [2021-08-13 11:36:03,771 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.907051282051282 [2021-08-13 11:36:03,771 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 849 transitions. [2021-08-13 11:36:03,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 849 transitions. [2021-08-13 11:36:03,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:03,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 849 transitions. [2021-08-13 11:36:03,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.33333333333333) internal successors, (849), 9 states have internal predecessors, (849), 0 states have call successors, (0), 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 11:36:03,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:03,775 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:03,775 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 38 predicate places. [2021-08-13 11:36:03,775 INFO L482 AbstractCegarLoop]: Abstraction has has 147 places, 413 transitions, 3187 flow [2021-08-13 11:36:03,776 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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 11:36:03,776 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:03,776 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, 1, 1, 1, 1, 1] [2021-08-13 11:36:03,776 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 11:36:03,776 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1097942961, now seen corresponding path program 1 times [2021-08-13 11:36:03,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:03,777 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692428423] [2021-08-13 11:36:03,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:03,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:03,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:03,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:03,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:03,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:03,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:03,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:03,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:36:03,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:03,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:36:03,979 INFO L142 QuantifierPusher]: treesize reduction 26, result has 62.3 percent of original size [2021-08-13 11:36:03,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-08-13 11:36:04,017 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:04,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:04,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:04,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:04,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:04,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:04,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:04,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:04,065 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 11:36:04,065 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:04,066 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692428423] [2021-08-13 11:36:04,067 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692428423] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:04,067 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:04,067 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:36:04,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132301352] [2021-08-13 11:36:04,068 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:36:04,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:36:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:36:04,070 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 104 [2021-08-13 11:36:04,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 413 transitions, 3187 flow. Second operand has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 states have internal predecessors, (852), 0 states have call successors, (0), 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 11:36:04,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:04,071 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 104 [2021-08-13 11:36:04,071 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:05,458 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_2 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_2, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][454], [198#true, 7#L18-1true, 135#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 41#L787true, 111#true, 113#true, 179#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 115#true, 116#true, 183#(= ~x~0 1), 152#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 27#L765true, 30#L743true]) [2021-08-13 11:36:05,458 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2021-08-13 11:36:05,458 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:05,458 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:05,458 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:05,802 INFO L129 PetriNetUnfolder]: 3074/9919 cut-off events. [2021-08-13 11:36:05,803 INFO L130 PetriNetUnfolder]: For 7213/8132 co-relation queries the response was YES. [2021-08-13 11:36:05,849 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26825 conditions, 9919 events. 3074/9919 cut-off events. For 7213/8132 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 117631 event pairs, 594 based on Foata normal form. 76/9814 useless extension candidates. Maximal degree in co-relation 26758. Up to 2938 conditions per place. [2021-08-13 11:36:05,864 INFO L132 encePairwiseOnDemand]: 93/104 looper letters, 22 selfloop transitions, 9 changer transitions 501/608 dead transitions. [2021-08-13 11:36:05,864 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 608 transitions, 6039 flow [2021-08-13 11:36:05,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 11:36:05,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 11:36:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1416 transitions. [2021-08-13 11:36:05,869 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8509615384615384 [2021-08-13 11:36:05,869 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1416 transitions. [2021-08-13 11:36:05,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1416 transitions. [2021-08-13 11:36:05,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:05,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1416 transitions. [2021-08-13 11:36:05,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 88.5) internal successors, (1416), 16 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:36:05,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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 11:36:05,876 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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 11:36:05,876 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 53 predicate places. [2021-08-13 11:36:05,876 INFO L482 AbstractCegarLoop]: Abstraction has has 162 places, 608 transitions, 6039 flow [2021-08-13 11:36:05,877 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 85.2) internal successors, (852), 10 states have internal predecessors, (852), 0 states have call successors, (0), 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 11:36:05,877 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:05,877 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 11:36:05,877 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:05,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -394073366, now seen corresponding path program 1 times [2021-08-13 11:36:05,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:05,878 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332951195] [2021-08-13 11:36:05,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:05,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:05,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:05,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:05,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:05,932 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:05,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:05,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:05,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:05,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:05,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:05,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:05,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:05,963 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 11:36:05,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:05,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332951195] [2021-08-13 11:36:05,963 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332951195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:05,963 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:05,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:36:05,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853797305] [2021-08-13 11:36:05,964 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:36:05,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:05,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:36:05,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:36:05,965 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 104 [2021-08-13 11:36:05,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 608 transitions, 6039 flow. Second operand has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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 11:36:05,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:05,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 104 [2021-08-13 11:36:05,966 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:08,063 INFO L129 PetriNetUnfolder]: 4122/14021 cut-off events. [2021-08-13 11:36:08,063 INFO L130 PetriNetUnfolder]: For 16606/18204 co-relation queries the response was YES. [2021-08-13 11:36:08,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42008 conditions, 14021 events. 4122/14021 cut-off events. For 16606/18204 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 180103 event pairs, 676 based on Foata normal form. 17/13875 useless extension candidates. Maximal degree in co-relation 41938. Up to 4630 conditions per place. [2021-08-13 11:36:08,122 INFO L132 encePairwiseOnDemand]: 98/104 looper letters, 21 selfloop transitions, 3 changer transitions 712/827 dead transitions. [2021-08-13 11:36:08,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 827 transitions, 9983 flow [2021-08-13 11:36:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 11:36:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 11:36:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 849 transitions. [2021-08-13 11:36:08,125 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.907051282051282 [2021-08-13 11:36:08,125 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 849 transitions. [2021-08-13 11:36:08,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 849 transitions. [2021-08-13 11:36:08,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:08,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 849 transitions. [2021-08-13 11:36:08,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.33333333333333) internal successors, (849), 9 states have internal predecessors, (849), 0 states have call successors, (0), 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 11:36:08,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:08,132 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 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 11:36:08,132 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 61 predicate places. [2021-08-13 11:36:08,132 INFO L482 AbstractCegarLoop]: Abstraction has has 170 places, 827 transitions, 9983 flow [2021-08-13 11:36:08,132 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 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 11:36:08,132 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:08,132 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, 1, 1, 1, 1, 1, 1] [2021-08-13 11:36:08,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 11:36:08,133 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1841504301, now seen corresponding path program 1 times [2021-08-13 11:36:08,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:08,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663118770] [2021-08-13 11:36:08,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:08,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:08,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:08,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:08,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:36:08,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:36:08,224 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-08-13 11:36:08,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-08-13 11:36:08,249 INFO L142 QuantifierPusher]: treesize reduction 21, result has 74.1 percent of original size [2021-08-13 11:36:08,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-08-13 11:36:08,278 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:08,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:08,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:08,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:08,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:08,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:08,319 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 11:36:08,319 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:08,319 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663118770] [2021-08-13 11:36:08,319 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663118770] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:08,319 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:08,319 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 11:36:08,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890308311] [2021-08-13 11:36:08,320 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 11:36:08,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:08,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 11:36:08,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-08-13 11:36:08,321 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2021-08-13 11:36:08,322 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 827 transitions, 9983 flow. Second operand has 11 states, 11 states have (on average 83.27272727272727) internal successors, (916), 11 states have internal predecessors, (916), 0 states have call successors, (0), 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 11:36:08,322 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:08,322 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2021-08-13 11:36:08,322 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:10,491 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L18-->L18-1: Formula: (= v_ULTIMATE.start___VERIFIER_assert_~expression_2 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_2, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression][641], [229#(= ~z~0 1), 198#true, 7#L18-1true, 135#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 41#L787true, 111#true, 113#true, 274#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 179#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 115#true, 116#true, 183#(= ~x~0 1), 152#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression|)) (or (<= 1 ULTIMATE.start___VERIFIER_assert_~expression) (<= (+ ULTIMATE.start___VERIFIER_assert_~expression 255) 0))), 27#L765true, 30#L743true]) [2021-08-13 11:36:10,491 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2021-08-13 11:36:10,491 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:10,491 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:10,491 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2021-08-13 11:36:11,024 INFO L129 PetriNetUnfolder]: 4919/17028 cut-off events. [2021-08-13 11:36:11,024 INFO L130 PetriNetUnfolder]: For 26084/29118 co-relation queries the response was YES. [2021-08-13 11:36:11,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57750 conditions, 17028 events. 4919/17028 cut-off events. For 26084/29118 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 227278 event pairs, 251 based on Foata normal form. 168/17022 useless extension candidates. Maximal degree in co-relation 57672. Up to 5769 conditions per place. [2021-08-13 11:36:11,120 INFO L132 encePairwiseOnDemand]: 91/104 looper letters, 30 selfloop transitions, 12 changer transitions 995/1111 dead transitions. [2021-08-13 11:36:11,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1111 transitions, 15853 flow [2021-08-13 11:36:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 11:36:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 11:36:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1540 transitions. [2021-08-13 11:36:11,124 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8226495726495726 [2021-08-13 11:36:11,124 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1540 transitions. [2021-08-13 11:36:11,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1540 transitions. [2021-08-13 11:36:11,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:11,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1540 transitions. [2021-08-13 11:36:11,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.55555555555556) internal successors, (1540), 18 states have internal predecessors, (1540), 0 states have call successors, (0), 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 11:36:11,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 104.0) internal successors, (1976), 19 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:36:11,132 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 104.0) internal successors, (1976), 19 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 11:36:11,133 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 78 predicate places. [2021-08-13 11:36:11,133 INFO L482 AbstractCegarLoop]: Abstraction has has 187 places, 1111 transitions, 15853 flow [2021-08-13 11:36:11,133 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 83.27272727272727) internal successors, (916), 11 states have internal predecessors, (916), 0 states have call successors, (0), 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 11:36:11,133 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:11,133 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:36:11,133 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 11:36:11,134 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1044814445, now seen corresponding path program 1 times [2021-08-13 11:36:11,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:11,134 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508589489] [2021-08-13 11:36:11,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:11,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:11,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:11,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:11,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:36:11,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:36:11,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:36:11,400 INFO L142 QuantifierPusher]: treesize reduction 33, result has 50.7 percent of original size [2021-08-13 11:36:11,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-13 11:36:11,424 INFO L142 QuantifierPusher]: treesize reduction 33, result has 50.7 percent of original size [2021-08-13 11:36:11,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-08-13 11:36:11,448 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:11,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:11,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:11,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:11,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:11,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:11,495 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 11:36:11,495 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:11,495 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508589489] [2021-08-13 11:36:11,495 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508589489] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:11,495 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:11,495 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 11:36:11,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95267899] [2021-08-13 11:36:11,496 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 11:36:11,496 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:11,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 11:36:11,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-13 11:36:11,498 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 104 [2021-08-13 11:36:11,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1111 transitions, 15853 flow. Second operand has 12 states, 12 states have (on average 84.16666666666667) internal successors, (1010), 12 states have internal predecessors, (1010), 0 states have call successors, (0), 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 11:36:11,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:11,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 104 [2021-08-13 11:36:11,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:15,284 INFO L129 PetriNetUnfolder]: 5772/20014 cut-off events. [2021-08-13 11:36:15,284 INFO L130 PetriNetUnfolder]: For 36280/39886 co-relation queries the response was YES. [2021-08-13 11:36:15,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75598 conditions, 20014 events. 5772/20014 cut-off events. For 36280/39886 co-relation queries the response was YES. Maximal size of possible extension queue 1455. Compared 274649 event pairs, 216 based on Foata normal form. 86/19930 useless extension candidates. Maximal degree in co-relation 75513. Up to 6704 conditions per place. [2021-08-13 11:36:15,396 INFO L132 encePairwiseOnDemand]: 92/104 looper letters, 32 selfloop transitions, 13 changer transitions 1388/1508 dead transitions. [2021-08-13 11:36:15,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 1508 transitions, 24787 flow [2021-08-13 11:36:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-13 11:36:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-08-13 11:36:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1739 transitions. [2021-08-13 11:36:15,413 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8360576923076923 [2021-08-13 11:36:15,413 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1739 transitions. [2021-08-13 11:36:15,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1739 transitions. [2021-08-13 11:36:15,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:15,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1739 transitions. [2021-08-13 11:36:15,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 86.95) internal successors, (1739), 20 states have internal predecessors, (1739), 0 states have call successors, (0), 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 11:36:15,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 104.0) internal successors, (2184), 21 states have internal predecessors, (2184), 0 states have call successors, (0), 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 11:36:15,422 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 104.0) internal successors, (2184), 21 states have internal predecessors, (2184), 0 states have call successors, (0), 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 11:36:15,422 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 97 predicate places. [2021-08-13 11:36:15,422 INFO L482 AbstractCegarLoop]: Abstraction has has 206 places, 1508 transitions, 24787 flow [2021-08-13 11:36:15,422 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 84.16666666666667) internal successors, (1010), 12 states have internal predecessors, (1010), 0 states have call successors, (0), 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 11:36:15,422 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:15,422 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, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:36:15,423 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 11:36:15,423 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:15,423 INFO L82 PathProgramCache]: Analyzing trace with hash 309562417, now seen corresponding path program 2 times [2021-08-13 11:36:15,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:15,423 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998751596] [2021-08-13 11:36:15,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:15,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:15,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:15,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:15,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:15,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:15,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:15,498 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-08-13 11:36:15,498 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 11:36:15,512 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-08-13 11:36:15,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 11:36:15,531 INFO L142 QuantifierPusher]: treesize reduction 47, result has 59.1 percent of original size [2021-08-13 11:36:15,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-13 11:36:15,555 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:15,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:15,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:15,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:15,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:15,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:15,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:15,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:15,596 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 11:36:15,596 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:15,596 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998751596] [2021-08-13 11:36:15,596 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998751596] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:15,596 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:15,597 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 11:36:15,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690060997] [2021-08-13 11:36:15,597 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 11:36:15,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:15,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 11:36:15,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-08-13 11:36:15,598 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 104 [2021-08-13 11:36:15,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 1508 transitions, 24787 flow. Second operand has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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 11:36:15,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:15,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 104 [2021-08-13 11:36:15,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:22,125 INFO L129 PetriNetUnfolder]: 6592/23877 cut-off events. [2021-08-13 11:36:22,125 INFO L130 PetriNetUnfolder]: For 58140/63325 co-relation queries the response was YES. [2021-08-13 11:36:22,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99611 conditions, 23877 events. 6592/23877 cut-off events. For 58140/63325 co-relation queries the response was YES. Maximal size of possible extension queue 1827. Compared 343118 event pairs, 73 based on Foata normal form. 147/23889 useless extension candidates. Maximal degree in co-relation 99520. Up to 8069 conditions per place. [2021-08-13 11:36:22,239 INFO L132 encePairwiseOnDemand]: 93/104 looper letters, 40 selfloop transitions, 15 changer transitions 1894/2025 dead transitions. [2021-08-13 11:36:22,239 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 2025 transitions, 37743 flow [2021-08-13 11:36:22,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 11:36:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 11:36:22,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1500 transitions. [2021-08-13 11:36:22,242 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8484162895927602 [2021-08-13 11:36:22,242 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1500 transitions. [2021-08-13 11:36:22,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1500 transitions. [2021-08-13 11:36:22,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:22,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1500 transitions. [2021-08-13 11:36:22,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 88.23529411764706) internal successors, (1500), 17 states have internal predecessors, (1500), 0 states have call successors, (0), 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 11:36:22,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 104.0) internal successors, (1872), 18 states have internal predecessors, (1872), 0 states have call successors, (0), 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 11:36:22,248 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 104.0) internal successors, (1872), 18 states have internal predecessors, (1872), 0 states have call successors, (0), 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 11:36:22,249 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 113 predicate places. [2021-08-13 11:36:22,249 INFO L482 AbstractCegarLoop]: Abstraction has has 222 places, 2025 transitions, 37743 flow [2021-08-13 11:36:22,249 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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 11:36:22,249 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:22,249 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:36:22,249 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 11:36:22,249 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2057679716, now seen corresponding path program 1 times [2021-08-13 11:36:22,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:22,250 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327337455] [2021-08-13 11:36:22,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:22,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:22,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:22,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:22,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:36:22,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:36:22,346 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-08-13 11:36:22,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-08-13 11:36:22,372 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.9 percent of original size [2021-08-13 11:36:22,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-08-13 11:36:22,404 INFO L142 QuantifierPusher]: treesize reduction 21, result has 74.1 percent of original size [2021-08-13 11:36:22,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-08-13 11:36:22,428 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:22,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:22,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:22,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:22,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:22,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:22,464 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 11:36:22,464 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:22,464 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327337455] [2021-08-13 11:36:22,464 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327337455] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:22,464 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:22,464 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 11:36:22,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599268637] [2021-08-13 11:36:22,465 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 11:36:22,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:22,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 11:36:22,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-08-13 11:36:22,466 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2021-08-13 11:36:22,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 2025 transitions, 37743 flow. Second operand has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 0 states have call successors, (0), 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 11:36:22,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:22,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2021-08-13 11:36:22,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:31,823 INFO L129 PetriNetUnfolder]: 7712/28621 cut-off events. [2021-08-13 11:36:31,823 INFO L130 PetriNetUnfolder]: For 92107/99608 co-relation queries the response was YES. [2021-08-13 11:36:31,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129931 conditions, 28621 events. 7712/28621 cut-off events. For 92107/99608 co-relation queries the response was YES. Maximal size of possible extension queue 2267. Compared 427058 event pairs, 75 based on Foata normal form. 155/28627 useless extension candidates. Maximal degree in co-relation 129831. Up to 9270 conditions per place. [2021-08-13 11:36:31,964 INFO L132 encePairwiseOnDemand]: 92/104 looper letters, 50 selfloop transitions, 12 changer transitions 2524/2659 dead transitions. [2021-08-13 11:36:31,964 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2659 transitions, 55297 flow [2021-08-13 11:36:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 11:36:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 11:36:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1621 transitions. [2021-08-13 11:36:31,967 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8203441295546559 [2021-08-13 11:36:31,968 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1621 transitions. [2021-08-13 11:36:31,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1621 transitions. [2021-08-13 11:36:31,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:31,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1621 transitions. [2021-08-13 11:36:31,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 85.3157894736842) internal successors, (1621), 19 states have internal predecessors, (1621), 0 states have call successors, (0), 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 11:36:31,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 104.0) internal successors, (2080), 20 states have internal predecessors, (2080), 0 states have call successors, (0), 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 11:36:31,974 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 104.0) internal successors, (2080), 20 states have internal predecessors, (2080), 0 states have call successors, (0), 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 11:36:31,974 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 131 predicate places. [2021-08-13 11:36:31,974 INFO L482 AbstractCegarLoop]: Abstraction has has 240 places, 2659 transitions, 55297 flow [2021-08-13 11:36:31,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 82.41666666666667) internal successors, (989), 12 states have internal predecessors, (989), 0 states have call successors, (0), 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 11:36:31,975 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:31,975 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:36:31,975 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 11:36:31,975 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:31,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:31,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1948431500, now seen corresponding path program 2 times [2021-08-13 11:36:31,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:31,976 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104534351] [2021-08-13 11:36:31,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:32,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:32,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:32,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:32,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 11:36:32,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 11:36:32,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 11:36:32,160 INFO L142 QuantifierPusher]: treesize reduction 37, result has 51.9 percent of original size [2021-08-13 11:36:32,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-08-13 11:36:32,188 INFO L142 QuantifierPusher]: treesize reduction 37, result has 53.8 percent of original size [2021-08-13 11:36:32,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-08-13 11:36:32,226 INFO L142 QuantifierPusher]: treesize reduction 173, result has 25.1 percent of original size [2021-08-13 11:36:32,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-08-13 11:36:32,262 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:32,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:32,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:32,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:32,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:32,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:32,313 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 11:36:32,313 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:32,313 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104534351] [2021-08-13 11:36:32,313 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104534351] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:32,313 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:32,313 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 11:36:32,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771273297] [2021-08-13 11:36:32,314 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 11:36:32,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 11:36:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-08-13 11:36:32,315 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2021-08-13 11:36:32,316 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 2659 transitions, 55297 flow. Second operand has 13 states, 13 states have (on average 82.3076923076923) internal successors, (1070), 13 states have internal predecessors, (1070), 0 states have call successors, (0), 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 11:36:32,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:32,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2021-08-13 11:36:32,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:36:46,253 INFO L129 PetriNetUnfolder]: 7931/29603 cut-off events. [2021-08-13 11:36:46,253 INFO L130 PetriNetUnfolder]: For 113672/123162 co-relation queries the response was YES. [2021-08-13 11:36:46,388 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145019 conditions, 29603 events. 7931/29603 cut-off events. For 113672/123162 co-relation queries the response was YES. Maximal size of possible extension queue 2333. Compared 444557 event pairs, 73 based on Foata normal form. 169/29625 useless extension candidates. Maximal degree in co-relation 144910. Up to 9543 conditions per place. [2021-08-13 11:36:46,416 INFO L132 encePairwiseOnDemand]: 92/104 looper letters, 48 selfloop transitions, 15 changer transitions 2744/2880 dead transitions. [2021-08-13 11:36:46,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 2880 transitions, 65681 flow [2021-08-13 11:36:46,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-13 11:36:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-08-13 11:36:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1701 transitions. [2021-08-13 11:36:46,418 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8177884615384615 [2021-08-13 11:36:46,419 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1701 transitions. [2021-08-13 11:36:46,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1701 transitions. [2021-08-13 11:36:46,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:36:46,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1701 transitions. [2021-08-13 11:36:46,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 85.05) internal successors, (1701), 20 states have internal predecessors, (1701), 0 states have call successors, (0), 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 11:36:46,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 104.0) internal successors, (2184), 21 states have internal predecessors, (2184), 0 states have call successors, (0), 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 11:36:46,425 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 104.0) internal successors, (2184), 21 states have internal predecessors, (2184), 0 states have call successors, (0), 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 11:36:46,425 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 150 predicate places. [2021-08-13 11:36:46,425 INFO L482 AbstractCegarLoop]: Abstraction has has 259 places, 2880 transitions, 65681 flow [2021-08-13 11:36:46,426 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 82.3076923076923) internal successors, (1070), 13 states have internal predecessors, (1070), 0 states have call successors, (0), 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 11:36:46,426 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:36:46,426 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:36:46,426 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 11:36:46,426 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:36:46,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:36:46,427 INFO L82 PathProgramCache]: Analyzing trace with hash -272246474, now seen corresponding path program 3 times [2021-08-13 11:36:46,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:36:46,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688956650] [2021-08-13 11:36:46,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:36:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:36:46,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:46,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:36:46,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:36:46,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-08-13 11:36:46,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-13 11:36:46,538 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-08-13 11:36:46,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-08-13 11:36:46,561 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.5 percent of original size [2021-08-13 11:36:46,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-08-13 11:36:46,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-13 11:36:46,619 INFO L142 QuantifierPusher]: treesize reduction 162, result has 27.7 percent of original size [2021-08-13 11:36:46,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-08-13 11:36:46,654 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 11:36:46,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 11:36:46,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:46,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:36:46,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:36:46,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:36:46,697 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 11:36:46,697 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:36:46,698 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688956650] [2021-08-13 11:36:46,698 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688956650] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:36:46,698 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:36:46,698 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 11:36:46,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637859350] [2021-08-13 11:36:46,698 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 11:36:46,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:36:46,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 11:36:46,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-08-13 11:36:46,700 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2021-08-13 11:36:46,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 2880 transitions, 65681 flow. Second operand has 13 states, 13 states have (on average 82.3076923076923) internal successors, (1070), 13 states have internal predecessors, (1070), 0 states have call successors, (0), 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 11:36:46,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:36:46,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2021-08-13 11:36:46,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:37:01,661 INFO L129 PetriNetUnfolder]: 7880/31552 cut-off events. [2021-08-13 11:37:01,662 INFO L130 PetriNetUnfolder]: For 152038/163169 co-relation queries the response was YES. [2021-08-13 11:37:01,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 164030 conditions, 31552 events. 7880/31552 cut-off events. For 152038/163169 co-relation queries the response was YES. Maximal size of possible extension queue 2564. Compared 491594 event pairs, 6 based on Foata normal form. 163/31612 useless extension candidates. Maximal degree in co-relation 163912. Up to 10007 conditions per place. [2021-08-13 11:37:01,846 INFO L132 encePairwiseOnDemand]: 93/104 looper letters, 53 selfloop transitions, 13 changer transitions 3366/3505 dead transitions. [2021-08-13 11:37:01,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 3505 transitions, 87413 flow [2021-08-13 11:37:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 11:37:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 11:37:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1189 transitions. [2021-08-13 11:37:01,848 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8166208791208791 [2021-08-13 11:37:01,848 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1189 transitions. [2021-08-13 11:37:01,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1189 transitions. [2021-08-13 11:37:01,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:37:01,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1189 transitions. [2021-08-13 11:37:01,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 84.92857142857143) internal successors, (1189), 14 states have internal predecessors, (1189), 0 states have call successors, (0), 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 11:37:01,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 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 11:37:01,852 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 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 11:37:01,852 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 163 predicate places. [2021-08-13 11:37:01,852 INFO L482 AbstractCegarLoop]: Abstraction has has 272 places, 3505 transitions, 87413 flow [2021-08-13 11:37:01,853 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 82.3076923076923) internal successors, (1070), 13 states have internal predecessors, (1070), 0 states have call successors, (0), 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 11:37:01,853 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:37:01,853 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:37:01,853 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 11:37:01,853 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:37:01,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:37:01,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1541912570, now seen corresponding path program 1 times [2021-08-13 11:37:01,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:37:01,854 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630311855] [2021-08-13 11:37:01,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:37:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:37:01,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:01,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:37:01,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:01,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:37:01,899 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:37:01,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:37:01,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:01,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:37:01,919 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:37:01,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:37:01,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:01,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:37:01,928 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 11:37:01,928 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:37:01,928 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630311855] [2021-08-13 11:37:01,928 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630311855] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:37:01,928 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:37:01,929 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 11:37:01,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435500960] [2021-08-13 11:37:01,929 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 11:37:01,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:37:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 11:37:01,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 11:37:01,930 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-08-13 11:37:01,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 3505 transitions, 87413 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 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 11:37:01,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:37:01,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-08-13 11:37:01,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:37:24,330 INFO L129 PetriNetUnfolder]: 4449/18500 cut-off events. [2021-08-13 11:37:24,331 INFO L130 PetriNetUnfolder]: For 69530/74780 co-relation queries the response was YES. [2021-08-13 11:37:24,419 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88814 conditions, 18500 events. 4449/18500 cut-off events. For 69530/74780 co-relation queries the response was YES. Maximal size of possible extension queue 1483. Compared 268480 event pairs, 288 based on Foata normal form. 26/17811 useless extension candidates. Maximal degree in co-relation 88693. Up to 5431 conditions per place. [2021-08-13 11:37:24,448 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 24 selfloop transitions, 17 changer transitions 1542/1842 dead transitions. [2021-08-13 11:37:24,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1842 transitions, 43503 flow [2021-08-13 11:37:24,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 11:37:24,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 11:37:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 943 transitions. [2021-08-13 11:37:24,450 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9067307692307692 [2021-08-13 11:37:24,450 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 943 transitions. [2021-08-13 11:37:24,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 943 transitions. [2021-08-13 11:37:24,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:37:24,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 943 transitions. [2021-08-13 11:37:24,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.3) internal successors, (943), 10 states have internal predecessors, (943), 0 states have call successors, (0), 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 11:37:24,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 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 11:37:24,453 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 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 11:37:24,453 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 172 predicate places. [2021-08-13 11:37:24,453 INFO L482 AbstractCegarLoop]: Abstraction has has 281 places, 1842 transitions, 43503 flow [2021-08-13 11:37:24,453 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 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 11:37:24,454 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:37:24,454 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:37:24,454 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-13 11:37:24,454 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:37:24,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:37:24,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1506906444, now seen corresponding path program 1 times [2021-08-13 11:37:24,454 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:37:24,454 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606271207] [2021-08-13 11:37:24,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:37:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:37:24,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:24,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:37:24,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:24,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:37:24,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:24,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:37:24,500 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:37:24,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:37:24,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:24,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:37:24,533 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:37:24,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:37:24,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:24,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:37:24,542 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 11:37:24,542 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:37:24,542 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606271207] [2021-08-13 11:37:24,542 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606271207] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:37:24,542 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:37:24,542 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 11:37:24,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340829448] [2021-08-13 11:37:24,542 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 11:37:24,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:37:24,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 11:37:24,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 11:37:24,543 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-08-13 11:37:24,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 1842 transitions, 43503 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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 11:37:24,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:37:24,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-08-13 11:37:24,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:37:27,075 INFO L129 PetriNetUnfolder]: 1422/4917 cut-off events. [2021-08-13 11:37:27,075 INFO L130 PetriNetUnfolder]: For 10051/13556 co-relation queries the response was YES. [2021-08-13 11:37:27,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19702 conditions, 4917 events. 1422/4917 cut-off events. For 10051/13556 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 52599 event pairs, 7 based on Foata normal form. 435/5012 useless extension candidates. Maximal degree in co-relation 19578. Up to 1054 conditions per place. [2021-08-13 11:37:27,097 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 22 selfloop transitions, 44 changer transitions 361/542 dead transitions. [2021-08-13 11:37:27,098 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 542 transitions, 10297 flow [2021-08-13 11:37:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 11:37:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 11:37:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1227 transitions. [2021-08-13 11:37:27,100 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9075443786982249 [2021-08-13 11:37:27,100 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1227 transitions. [2021-08-13 11:37:27,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1227 transitions. [2021-08-13 11:37:27,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:37:27,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1227 transitions. [2021-08-13 11:37:27,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.38461538461539) internal successors, (1227), 13 states have internal predecessors, (1227), 0 states have call successors, (0), 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 11:37:27,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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 11:37:27,103 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 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 11:37:27,104 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 127 predicate places. [2021-08-13 11:37:27,104 INFO L482 AbstractCegarLoop]: Abstraction has has 236 places, 542 transitions, 10297 flow [2021-08-13 11:37:27,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 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 11:37:27,104 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:37:27,104 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:37:27,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-13 11:37:27,104 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:37:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:37:27,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1700487985, now seen corresponding path program 1 times [2021-08-13 11:37:27,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:37:27,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216482709] [2021-08-13 11:37:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:37:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 11:37:27,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:27,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:37:27,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:27,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:37:27,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:27,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:37:27,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:27,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 11:37:27,157 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 11:37:27,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 11:37:27,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:27,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 11:37:27,179 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 11:37:27,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 11:37:27,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 11:37:27,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 11:37:27,188 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 11:37:27,188 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 11:37:27,189 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216482709] [2021-08-13 11:37:27,189 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216482709] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 11:37:27,189 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 11:37:27,189 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 11:37:27,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631344095] [2021-08-13 11:37:27,189 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 11:37:27,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 11:37:27,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 11:37:27,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 11:37:27,190 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-08-13 11:37:27,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 542 transitions, 10297 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 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 11:37:27,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 11:37:27,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-08-13 11:37:27,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 11:37:27,913 INFO L129 PetriNetUnfolder]: 1119/2956 cut-off events. [2021-08-13 11:37:27,913 INFO L130 PetriNetUnfolder]: For 2035/7677 co-relation queries the response was YES. [2021-08-13 11:37:27,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10470 conditions, 2956 events. 1119/2956 cut-off events. For 2035/7677 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 28964 event pairs, 0 based on Foata normal form. 559/3219 useless extension candidates. Maximal degree in co-relation 10343. Up to 899 conditions per place. [2021-08-13 11:37:27,928 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 19 selfloop transitions, 40 changer transitions 109/248 dead transitions. [2021-08-13 11:37:27,928 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 248 transitions, 2637 flow [2021-08-13 11:37:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 11:37:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 11:37:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1496 transitions. [2021-08-13 11:37:27,936 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8990384615384616 [2021-08-13 11:37:27,936 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1496 transitions. [2021-08-13 11:37:27,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1496 transitions. [2021-08-13 11:37:27,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 11:37:27,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1496 transitions. [2021-08-13 11:37:27,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.5) internal successors, (1496), 16 states have internal predecessors, (1496), 0 states have call successors, (0), 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 11:37:27,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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 11:37:27,940 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 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 11:37:27,940 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 106 predicate places. [2021-08-13 11:37:27,940 INFO L482 AbstractCegarLoop]: Abstraction has has 215 places, 248 transitions, 2637 flow [2021-08-13 11:37:27,941 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 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 11:37:27,941 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 11:37:27,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 11:37:27,941 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-13 11:37:27,941 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 11:37:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 11:37:27,941 INFO L82 PathProgramCache]: Analyzing trace with hash 607688704, now seen corresponding path program 1 times [2021-08-13 11:37:27,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 11:37:27,942 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162751230] [2021-08-13 11:37:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 11:37:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 11:37:27,967 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 11:37:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 11:37:27,997 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 11:37:28,045 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 11:37:28,046 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 11:37:28,046 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-13 11:37:28,049 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 11:37:28,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 11:37:28 BasicIcfg [2021-08-13 11:37:28,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 11:37:28,188 INFO L168 Benchmark]: Toolchain (without parser) took 91690.30 ms. Allocated memory was 209.7 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 173.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.5 GB. Max. memory is 8.0 GB. [2021-08-13 11:37:28,188 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 209.7 MB. Free memory is still 191.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 11:37:28,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.10 ms. Allocated memory is still 209.7 MB. Free memory was 173.2 MB in the beginning and 169.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-13 11:37:28,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.22 ms. Allocated memory is still 209.7 MB. Free memory was 169.1 MB in the beginning and 166.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 11:37:28,193 INFO L168 Benchmark]: Boogie Preprocessor took 25.24 ms. Allocated memory is still 209.7 MB. Free memory was 166.0 MB in the beginning and 163.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 11:37:28,193 INFO L168 Benchmark]: RCFGBuilder took 1913.46 ms. Allocated memory was 209.7 MB in the beginning and 254.8 MB in the end (delta: 45.1 MB). Free memory was 163.9 MB in the beginning and 208.7 MB in the end (delta: -44.8 MB). Peak memory consumption was 97.2 MB. Max. memory is 8.0 GB. [2021-08-13 11:37:28,193 INFO L168 Benchmark]: TraceAbstraction took 89060.94 ms. Allocated memory was 254.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 208.2 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 8.0 GB. [2021-08-13 11:37:28,194 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.13 ms. Allocated memory is still 209.7 MB. Free memory is still 191.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 604.10 ms. Allocated memory is still 209.7 MB. Free memory was 173.2 MB in the beginning and 169.1 MB in the end (delta: 4.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 79.22 ms. Allocated memory is still 209.7 MB. Free memory was 169.1 MB in the beginning and 166.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 25.24 ms. Allocated memory is still 209.7 MB. Free memory was 166.0 MB in the beginning and 163.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1913.46 ms. Allocated memory was 209.7 MB in the beginning and 254.8 MB in the end (delta: 45.1 MB). Free memory was 163.9 MB in the beginning and 208.7 MB in the end (delta: -44.8 MB). Peak memory consumption was 97.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 89060.94 ms. Allocated memory was 254.8 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 208.2 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. 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: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 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] [L717] 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] [L718] 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] [L719] 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] [L720] 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] [L721] 0 _Bool y$r_buff0_thd3; 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_buff0_thd3=0] [L722] 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_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2504; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2505; VAL [__unbuffered_cnt=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2506; 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) 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=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)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=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 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=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 12.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 88803.5ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 85285.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 53.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 208 SDtfs, 845 SDslu, 820 SDs, 0 SdLazy, 1495 SolverSat, 361 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1574.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 3286.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=87413occurred in iteration=13, InterpolantAutomatonStates: 217, 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: 62.1ms SsaConstructionTime, 615.9ms SatisfiabilityAnalysisTime, 2464.3ms InterpolantComputationTime, 1216 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1120 ConstructedInterpolants, 0 QuantifiedInterpolants, 6427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...