/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:22:45,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:22:45,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:22:45,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:22:45,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:22:45,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:22:45,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:22:45,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:22:45,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:22:45,258 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:22:45,259 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:22:45,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:22:45,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:22:45,261 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:22:45,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:22:45,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:22:45,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:22:45,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:22:45,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:22:45,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:22:45,269 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:22:45,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:22:45,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:22:45,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:22:45,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:22:45,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:22:45,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:22:45,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:22:45,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:22:45,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:22:45,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:22:45,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:22:45,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:22:45,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:22:45,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:22:45,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:22:45,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:22:45,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:22:45,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:22:45,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:22:45,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:22:45,283 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-11 18:22:45,307 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:22:45,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:22:45,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:22:45,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:22:45,309 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:22:45,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:22:45,309 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:22:45,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:22:45,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:22:45,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:22:45,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:22:45,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:22:45,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:22:45,311 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:22:45,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:22:45,311 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:22:45,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:22:45,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:22:45,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:22:45,312 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:22:45,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:22:45,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:22:45,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:22:45,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:22:45,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:22:45,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:22:45,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:22:45,313 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:22:45,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:22:45,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:22:45,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:22:45,625 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:22:45,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:22:45,631 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:22:45,632 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:22:45,632 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2020-10-11 18:22:45,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb43560f/5f8e5d211a33460d809e25545969cc11/FLAG9efc371e8 [2020-10-11 18:22:46,261 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:22:46,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2020-10-11 18:22:46,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb43560f/5f8e5d211a33460d809e25545969cc11/FLAG9efc371e8 [2020-10-11 18:22:46,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb43560f/5f8e5d211a33460d809e25545969cc11 [2020-10-11 18:22:46,561 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:22:46,563 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:22:46,564 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:22:46,564 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:22:46,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:22:46,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:46" (1/1) ... [2020-10-11 18:22:46,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc0d6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:46, skipping insertion in model container [2020-10-11 18:22:46,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:22:46" (1/1) ... [2020-10-11 18:22:46,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:22:46,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:22:47,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:22:47,087 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:22:47,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:22:47,256 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:22:47,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47 WrapperNode [2020-10-11 18:22:47,257 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:22:47,258 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:22:47,258 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:22:47,258 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:22:47,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,292 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:22:47,329 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:22:47,329 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:22:47,329 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:22:47,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,344 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,357 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (1/1) ... [2020-10-11 18:22:47,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:22:47,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:22:47,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:22:47,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:22:47,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (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 [2020-10-11 18:22:47,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:22:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:22:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:22:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:22:47,441 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:22:47,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:22:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:22:47,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:22:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:22:47,442 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:22:47,442 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 18:22:47,443 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 18:22:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:22:47,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:22:47,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:22:47,445 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 18:22:49,241 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:22:49,242 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:22:49,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:49 BoogieIcfgContainer [2020-10-11 18:22:49,244 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:22:49,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:22:49,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:22:49,249 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:22:49,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:22:46" (1/3) ... [2020-10-11 18:22:49,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1aff36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:49, skipping insertion in model container [2020-10-11 18:22:49,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:22:47" (2/3) ... [2020-10-11 18:22:49,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b1aff36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:22:49, skipping insertion in model container [2020-10-11 18:22:49,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:22:49" (3/3) ... [2020-10-11 18:22:49,252 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_pso.opt.i [2020-10-11 18:22:49,263 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:22:49,271 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:22:49,272 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:22:49,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,300 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,301 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,303 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,303 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,303 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,304 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,305 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,306 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,307 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,307 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,307 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,307 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,308 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,308 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,309 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,314 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,314 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,317 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,318 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,318 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,319 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,319 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,320 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,321 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,321 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,322 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,322 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,323 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:22:49,340 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 18:22:49,360 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:22:49,361 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:22:49,361 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:22:49,361 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:22:49,361 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:22:49,361 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:22:49,362 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:22:49,362 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:22:49,375 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-11 18:22:49,427 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-11 18:22:49,428 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:49,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-11 18:22:49,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow [2020-10-11 18:22:49,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow [2020-10-11 18:22:49,470 INFO L129 PetriNetUnfolder]: 0/70 cut-off events. [2020-10-11 18:22:49,470 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:49,470 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:49,472 INFO L255 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] [2020-10-11 18:22:49,472 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash 680024380, now seen corresponding path program 1 times [2020-10-11 18:22:49,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:49,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489079683] [2020-10-11 18:22:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:49,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:49,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489079683] [2020-10-11 18:22:49,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:49,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:22:49,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667647793] [2020-10-11 18:22:49,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:22:49,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:22:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:22:50,073 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 111 [2020-10-11 18:22:50,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 107 transitions, 226 flow. Second operand 3 states. [2020-10-11 18:22:50,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:50,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 111 [2020-10-11 18:22:50,078 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:50,111 INFO L129 PetriNetUnfolder]: 0/104 cut-off events. [2020-10-11 18:22:50,111 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:50,111 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 104 events. 0/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 4/106 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:22:50,113 INFO L132 encePairwiseOnDemand]: 106/111 looper letters, 0 selfloop transitions, 2 changer transitions 13/104 dead transitions. [2020-10-11 18:22:50,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 104 transitions, 224 flow [2020-10-11 18:22:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:22:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:22:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2020-10-11 18:22:50,130 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.975975975975976 [2020-10-11 18:22:50,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2020-10-11 18:22:50,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2020-10-11 18:22:50,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:50,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2020-10-11 18:22:50,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:22:50,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:22:50,146 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:22:50,148 INFO L185 Difference]: Start difference. First operand has 118 places, 107 transitions, 226 flow. Second operand 3 states and 325 transitions. [2020-10-11 18:22:50,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 104 transitions, 224 flow [2020-10-11 18:22:50,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 104 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-11 18:22:50,158 INFO L241 Difference]: Finished difference. Result has 115 places, 91 transitions, 194 flow [2020-10-11 18:22:50,160 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=115, PETRI_TRANSITIONS=91} [2020-10-11 18:22:50,161 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2020-10-11 18:22:50,162 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 91 transitions, 194 flow [2020-10-11 18:22:50,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:22:50,162 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:50,162 INFO L255 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] [2020-10-11 18:22:50,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:22:50,163 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1652369391, now seen corresponding path program 1 times [2020-10-11 18:22:50,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:50,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20365510] [2020-10-11 18:22:50,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:50,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20365510] [2020-10-11 18:22:50,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:50,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:50,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933593069] [2020-10-11 18:22:50,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:50,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:50,678 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 111 [2020-10-11 18:22:50,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 91 transitions, 194 flow. Second operand 6 states. [2020-10-11 18:22:50,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:50,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 111 [2020-10-11 18:22:50,678 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:50,809 INFO L129 PetriNetUnfolder]: 3/117 cut-off events. [2020-10-11 18:22:50,809 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:22:50,810 INFO L80 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 117 events. 3/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 160 event pairs, 0 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 103. Up to 7 conditions per place. [2020-10-11 18:22:50,810 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 6 selfloop transitions, 2 changer transitions 10/101 dead transitions. [2020-10-11 18:22:50,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 250 flow [2020-10-11 18:22:50,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:50,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 929 transitions. [2020-10-11 18:22:50,820 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.92992992992993 [2020-10-11 18:22:50,820 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 929 transitions. [2020-10-11 18:22:50,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 929 transitions. [2020-10-11 18:22:50,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:50,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 929 transitions. [2020-10-11 18:22:50,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:50,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:50,836 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:50,836 INFO L185 Difference]: Start difference. First operand has 115 places, 91 transitions, 194 flow. Second operand 9 states and 929 transitions. [2020-10-11 18:22:50,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 250 flow [2020-10-11 18:22:50,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 101 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:22:50,847 INFO L241 Difference]: Finished difference. Result has 115 places, 91 transitions, 210 flow [2020-10-11 18:22:50,847 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=210, PETRI_PLACES=115, PETRI_TRANSITIONS=91} [2020-10-11 18:22:50,848 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2020-10-11 18:22:50,851 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 91 transitions, 210 flow [2020-10-11 18:22:50,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:50,851 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:50,852 INFO L255 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] [2020-10-11 18:22:50,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:22:50,852 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2010146676, now seen corresponding path program 1 times [2020-10-11 18:22:50,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:50,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082476957] [2020-10-11 18:22:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:51,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082476957] [2020-10-11 18:22:51,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:51,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:51,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861492754] [2020-10-11 18:22:51,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:51,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:51,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:51,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:51,268 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:22:51,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 91 transitions, 210 flow. Second operand 6 states. [2020-10-11 18:22:51,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:51,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:22:51,269 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:51,471 INFO L129 PetriNetUnfolder]: 24/177 cut-off events. [2020-10-11 18:22:51,471 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2020-10-11 18:22:51,473 INFO L80 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 177 events. 24/177 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 525 event pairs, 5 based on Foata normal form. 4/179 useless extension candidates. Maximal degree in co-relation 267. Up to 31 conditions per place. [2020-10-11 18:22:51,474 INFO L132 encePairwiseOnDemand]: 104/111 looper letters, 8 selfloop transitions, 3 changer transitions 19/112 dead transitions. [2020-10-11 18:22:51,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 112 transitions, 330 flow [2020-10-11 18:22:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 932 transitions. [2020-10-11 18:22:51,477 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9329329329329329 [2020-10-11 18:22:51,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 932 transitions. [2020-10-11 18:22:51,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 932 transitions. [2020-10-11 18:22:51,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:51,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 932 transitions. [2020-10-11 18:22:51,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:51,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:51,482 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:51,482 INFO L185 Difference]: Start difference. First operand has 115 places, 91 transitions, 210 flow. Second operand 9 states and 932 transitions. [2020-10-11 18:22:51,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 112 transitions, 330 flow [2020-10-11 18:22:51,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 298 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-11 18:22:51,487 INFO L241 Difference]: Finished difference. Result has 116 places, 93 transitions, 237 flow [2020-10-11 18:22:51,488 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=116, PETRI_TRANSITIONS=93} [2020-10-11 18:22:51,488 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, -2 predicate places. [2020-10-11 18:22:51,488 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 93 transitions, 237 flow [2020-10-11 18:22:51,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:51,488 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:51,489 INFO L255 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] [2020-10-11 18:22:51,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:22:51,489 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1921258797, now seen corresponding path program 1 times [2020-10-11 18:22:51,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:51,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263572161] [2020-10-11 18:22:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:51,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263572161] [2020-10-11 18:22:51,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:51,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:51,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887483873] [2020-10-11 18:22:51,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:51,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:51,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:51,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:51,776 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:22:51,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 93 transitions, 237 flow. Second operand 6 states. [2020-10-11 18:22:51,777 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:51,777 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:22:51,777 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:51,945 INFO L129 PetriNetUnfolder]: 56/263 cut-off events. [2020-10-11 18:22:51,945 INFO L130 PetriNetUnfolder]: For 243/255 co-relation queries the response was YES. [2020-10-11 18:22:51,949 INFO L80 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 263 events. 56/263 cut-off events. For 243/255 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1066 event pairs, 15 based on Foata normal form. 6/260 useless extension candidates. Maximal degree in co-relation 516. Up to 60 conditions per place. [2020-10-11 18:22:51,951 INFO L132 encePairwiseOnDemand]: 104/111 looper letters, 8 selfloop transitions, 3 changer transitions 19/114 dead transitions. [2020-10-11 18:22:51,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 114 transitions, 359 flow [2020-10-11 18:22:51,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 932 transitions. [2020-10-11 18:22:51,954 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9329329329329329 [2020-10-11 18:22:51,955 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 932 transitions. [2020-10-11 18:22:51,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 932 transitions. [2020-10-11 18:22:51,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:51,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 932 transitions. [2020-10-11 18:22:51,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:51,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:51,960 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:51,960 INFO L185 Difference]: Start difference. First operand has 116 places, 93 transitions, 237 flow. Second operand 9 states and 932 transitions. [2020-10-11 18:22:51,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 114 transitions, 359 flow [2020-10-11 18:22:51,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 342 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-11 18:22:51,966 INFO L241 Difference]: Finished difference. Result has 121 places, 95 transitions, 271 flow [2020-10-11 18:22:51,966 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=271, PETRI_PLACES=121, PETRI_TRANSITIONS=95} [2020-10-11 18:22:51,966 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 3 predicate places. [2020-10-11 18:22:51,967 INFO L481 AbstractCegarLoop]: Abstraction has has 121 places, 95 transitions, 271 flow [2020-10-11 18:22:51,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:51,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:51,967 INFO L255 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] [2020-10-11 18:22:51,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:22:51,968 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:51,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:51,968 INFO L82 PathProgramCache]: Analyzing trace with hash 587715385, now seen corresponding path program 1 times [2020-10-11 18:22:51,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:51,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652815715] [2020-10-11 18:22:51,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:52,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652815715] [2020-10-11 18:22:52,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:52,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:22:52,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531710904] [2020-10-11 18:22:52,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:22:52,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:52,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:22:52,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:22:52,250 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:22:52,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 95 transitions, 271 flow. Second operand 6 states. [2020-10-11 18:22:52,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:52,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:22:52,251 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:52,418 INFO L129 PetriNetUnfolder]: 35/249 cut-off events. [2020-10-11 18:22:52,419 INFO L130 PetriNetUnfolder]: For 465/528 co-relation queries the response was YES. [2020-10-11 18:22:52,421 INFO L80 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 249 events. 35/249 cut-off events. For 465/528 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1061 event pairs, 4 based on Foata normal form. 8/249 useless extension candidates. Maximal degree in co-relation 607. Up to 36 conditions per place. [2020-10-11 18:22:52,423 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 12 selfloop transitions, 3 changer transitions 10/109 dead transitions. [2020-10-11 18:22:52,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 421 flow [2020-10-11 18:22:52,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:22:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:22:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2020-10-11 18:22:52,427 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9269269269269269 [2020-10-11 18:22:52,428 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2020-10-11 18:22:52,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2020-10-11 18:22:52,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:52,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2020-10-11 18:22:52,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:22:52,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:22:52,434 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:22:52,434 INFO L185 Difference]: Start difference. First operand has 121 places, 95 transitions, 271 flow. Second operand 9 states and 926 transitions. [2020-10-11 18:22:52,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 109 transitions, 421 flow [2020-10-11 18:22:52,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 109 transitions, 390 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:22:52,440 INFO L241 Difference]: Finished difference. Result has 126 places, 95 transitions, 283 flow [2020-10-11 18:22:52,441 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=283, PETRI_PLACES=126, PETRI_TRANSITIONS=95} [2020-10-11 18:22:52,441 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2020-10-11 18:22:52,441 INFO L481 AbstractCegarLoop]: Abstraction has has 126 places, 95 transitions, 283 flow [2020-10-11 18:22:52,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:22:52,441 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:52,442 INFO L255 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] [2020-10-11 18:22:52,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:22:52,442 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:52,443 INFO L82 PathProgramCache]: Analyzing trace with hash -916974828, now seen corresponding path program 1 times [2020-10-11 18:22:52,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:52,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72830083] [2020-10-11 18:22:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:52,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72830083] [2020-10-11 18:22:52,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:52,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:22:52,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520762966] [2020-10-11 18:22:52,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:22:52,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:52,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:22:52,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:22:53,660 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:22:53,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 95 transitions, 283 flow. Second operand 12 states. [2020-10-11 18:22:53,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:53,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:22:53,661 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:54,268 INFO L129 PetriNetUnfolder]: 510/1297 cut-off events. [2020-10-11 18:22:54,269 INFO L130 PetriNetUnfolder]: For 3487/3541 co-relation queries the response was YES. [2020-10-11 18:22:54,283 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3674 conditions, 1297 events. 510/1297 cut-off events. For 3487/3541 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9243 event pairs, 227 based on Foata normal form. 42/1288 useless extension candidates. Maximal degree in co-relation 3607. Up to 408 conditions per place. [2020-10-11 18:22:54,291 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 13 selfloop transitions, 9 changer transitions 22/123 dead transitions. [2020-10-11 18:22:54,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 123 transitions, 467 flow [2020-10-11 18:22:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:22:54,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:22:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1334 transitions. [2020-10-11 18:22:54,298 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8584298584298584 [2020-10-11 18:22:54,298 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1334 transitions. [2020-10-11 18:22:54,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1334 transitions. [2020-10-11 18:22:54,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:54,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1334 transitions. [2020-10-11 18:22:54,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:22:54,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:22:54,316 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:22:54,316 INFO L185 Difference]: Start difference. First operand has 126 places, 95 transitions, 283 flow. Second operand 14 states and 1334 transitions. [2020-10-11 18:22:54,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 123 transitions, 467 flow [2020-10-11 18:22:54,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 430 flow, removed 17 selfloop flow, removed 7 redundant places. [2020-10-11 18:22:54,330 INFO L241 Difference]: Finished difference. Result has 134 places, 99 transitions, 320 flow [2020-10-11 18:22:54,330 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=320, PETRI_PLACES=134, PETRI_TRANSITIONS=99} [2020-10-11 18:22:54,330 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2020-10-11 18:22:54,330 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 99 transitions, 320 flow [2020-10-11 18:22:54,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:22:54,331 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:54,331 INFO L255 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] [2020-10-11 18:22:54,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:22:54,331 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1988292256, now seen corresponding path program 1 times [2020-10-11 18:22:54,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:54,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642709599] [2020-10-11 18:22:54,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:54,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642709599] [2020-10-11 18:22:54,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:54,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:22:54,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138246908] [2020-10-11 18:22:54,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:22:54,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:22:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:22:56,093 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2020-10-11 18:22:56,097 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 99 transitions, 320 flow. Second operand 12 states. [2020-10-11 18:22:56,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:56,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2020-10-11 18:22:56,097 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:56,511 INFO L129 PetriNetUnfolder]: 458/1129 cut-off events. [2020-10-11 18:22:56,512 INFO L130 PetriNetUnfolder]: For 4028/4071 co-relation queries the response was YES. [2020-10-11 18:22:56,522 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 1129 events. 458/1129 cut-off events. For 4028/4071 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 7364 event pairs, 141 based on Foata normal form. 32/1117 useless extension candidates. Maximal degree in co-relation 3972. Up to 404 conditions per place. [2020-10-11 18:22:56,530 INFO L132 encePairwiseOnDemand]: 98/111 looper letters, 17 selfloop transitions, 10 changer transitions 10/115 dead transitions. [2020-10-11 18:22:56,530 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 115 transitions, 484 flow [2020-10-11 18:22:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:22:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:22:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1037 transitions. [2020-10-11 18:22:56,534 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8493038493038493 [2020-10-11 18:22:56,534 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1037 transitions. [2020-10-11 18:22:56,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1037 transitions. [2020-10-11 18:22:56,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:56,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1037 transitions. [2020-10-11 18:22:56,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:22:56,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:22:56,540 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:22:56,540 INFO L185 Difference]: Start difference. First operand has 134 places, 99 transitions, 320 flow. Second operand 11 states and 1037 transitions. [2020-10-11 18:22:56,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 115 transitions, 484 flow [2020-10-11 18:22:56,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 115 transitions, 466 flow, removed 5 selfloop flow, removed 7 redundant places. [2020-10-11 18:22:56,548 INFO L241 Difference]: Finished difference. Result has 135 places, 102 transitions, 358 flow [2020-10-11 18:22:56,548 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=358, PETRI_PLACES=135, PETRI_TRANSITIONS=102} [2020-10-11 18:22:56,548 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2020-10-11 18:22:56,549 INFO L481 AbstractCegarLoop]: Abstraction has has 135 places, 102 transitions, 358 flow [2020-10-11 18:22:56,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:22:56,549 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:56,549 INFO L255 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] [2020-10-11 18:22:56,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:22:56,549 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:56,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1447057068, now seen corresponding path program 2 times [2020-10-11 18:22:56,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:56,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980663950] [2020-10-11 18:22:56,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:56,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980663950] [2020-10-11 18:22:56,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:56,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-11 18:22:56,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503040163] [2020-10-11 18:22:56,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-11 18:22:56,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-11 18:22:56,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-11 18:22:57,295 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2020-10-11 18:22:57,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 102 transitions, 358 flow. Second operand 10 states. [2020-10-11 18:22:57,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:57,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2020-10-11 18:22:57,297 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:57,788 INFO L129 PetriNetUnfolder]: 454/1188 cut-off events. [2020-10-11 18:22:57,788 INFO L130 PetriNetUnfolder]: For 4712/4839 co-relation queries the response was YES. [2020-10-11 18:22:57,805 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 1188 events. 454/1188 cut-off events. For 4712/4839 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 8209 event pairs, 111 based on Foata normal form. 40/1187 useless extension candidates. Maximal degree in co-relation 4396. Up to 422 conditions per place. [2020-10-11 18:22:57,819 INFO L132 encePairwiseOnDemand]: 100/111 looper letters, 20 selfloop transitions, 12 changer transitions 19/131 dead transitions. [2020-10-11 18:22:57,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 131 transitions, 676 flow [2020-10-11 18:22:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:22:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:22:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1161 transitions. [2020-10-11 18:22:57,826 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8716216216216216 [2020-10-11 18:22:57,826 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1161 transitions. [2020-10-11 18:22:57,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1161 transitions. [2020-10-11 18:22:57,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:57,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1161 transitions. [2020-10-11 18:22:57,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:22:57,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:22:57,836 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:22:57,836 INFO L185 Difference]: Start difference. First operand has 135 places, 102 transitions, 358 flow. Second operand 12 states and 1161 transitions. [2020-10-11 18:22:57,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 131 transitions, 676 flow [2020-10-11 18:22:57,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 131 transitions, 622 flow, removed 17 selfloop flow, removed 9 redundant places. [2020-10-11 18:22:57,854 INFO L241 Difference]: Finished difference. Result has 142 places, 109 transitions, 433 flow [2020-10-11 18:22:57,855 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=433, PETRI_PLACES=142, PETRI_TRANSITIONS=109} [2020-10-11 18:22:57,855 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2020-10-11 18:22:57,855 INFO L481 AbstractCegarLoop]: Abstraction has has 142 places, 109 transitions, 433 flow [2020-10-11 18:22:57,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-11 18:22:57,856 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:57,856 INFO L255 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] [2020-10-11 18:22:57,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:22:57,857 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:57,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:57,858 INFO L82 PathProgramCache]: Analyzing trace with hash 290004646, now seen corresponding path program 3 times [2020-10-11 18:22:57,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:57,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177430472] [2020-10-11 18:22:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:58,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:58,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177430472] [2020-10-11 18:22:58,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:58,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:22:58,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905688756] [2020-10-11 18:22:58,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:22:58,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:22:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:22:58,560 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 111 [2020-10-11 18:22:58,561 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 109 transitions, 433 flow. Second operand 9 states. [2020-10-11 18:22:58,561 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:22:58,561 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 111 [2020-10-11 18:22:58,561 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:22:59,087 INFO L129 PetriNetUnfolder]: 432/1179 cut-off events. [2020-10-11 18:22:59,087 INFO L130 PetriNetUnfolder]: For 9517/9728 co-relation queries the response was YES. [2020-10-11 18:22:59,100 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5663 conditions, 1179 events. 432/1179 cut-off events. For 9517/9728 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 8432 event pairs, 78 based on Foata normal form. 61/1196 useless extension candidates. Maximal degree in co-relation 5587. Up to 337 conditions per place. [2020-10-11 18:22:59,109 INFO L132 encePairwiseOnDemand]: 102/111 looper letters, 19 selfloop transitions, 14 changer transitions 19/136 dead transitions. [2020-10-11 18:22:59,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 136 transitions, 894 flow [2020-10-11 18:22:59,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-11 18:22:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-11 18:22:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1097 transitions. [2020-10-11 18:22:59,113 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8984438984438985 [2020-10-11 18:22:59,113 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1097 transitions. [2020-10-11 18:22:59,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1097 transitions. [2020-10-11 18:22:59,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:22:59,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1097 transitions. [2020-10-11 18:22:59,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-11 18:22:59,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-11 18:22:59,119 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-11 18:22:59,119 INFO L185 Difference]: Start difference. First operand has 142 places, 109 transitions, 433 flow. Second operand 11 states and 1097 transitions. [2020-10-11 18:22:59,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 136 transitions, 894 flow [2020-10-11 18:22:59,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 136 transitions, 852 flow, removed 16 selfloop flow, removed 5 redundant places. [2020-10-11 18:22:59,134 INFO L241 Difference]: Finished difference. Result has 148 places, 112 transitions, 518 flow [2020-10-11 18:22:59,134 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=518, PETRI_PLACES=148, PETRI_TRANSITIONS=112} [2020-10-11 18:22:59,135 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 30 predicate places. [2020-10-11 18:22:59,135 INFO L481 AbstractCegarLoop]: Abstraction has has 148 places, 112 transitions, 518 flow [2020-10-11 18:22:59,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:22:59,135 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:22:59,135 INFO L255 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] [2020-10-11 18:22:59,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:22:59,135 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:22:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:22:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash 849884847, now seen corresponding path program 1 times [2020-10-11 18:22:59,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:22:59,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43566799] [2020-10-11 18:22:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:22:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:22:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:22:59,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43566799] [2020-10-11 18:22:59,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:22:59,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:22:59,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897471441] [2020-10-11 18:22:59,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:22:59,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:22:59,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:22:59,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:23:00,126 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:23:00,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 112 transitions, 518 flow. Second operand 12 states. [2020-10-11 18:23:00,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:00,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:23:00,128 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:00,610 INFO L129 PetriNetUnfolder]: 326/919 cut-off events. [2020-10-11 18:23:00,611 INFO L130 PetriNetUnfolder]: For 11586/11788 co-relation queries the response was YES. [2020-10-11 18:23:00,621 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5180 conditions, 919 events. 326/919 cut-off events. For 11586/11788 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5960 event pairs, 54 based on Foata normal form. 62/948 useless extension candidates. Maximal degree in co-relation 5097. Up to 332 conditions per place. [2020-10-11 18:23:00,633 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 25 selfloop transitions, 21 changer transitions 10/135 dead transitions. [2020-10-11 18:23:00,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 135 transitions, 953 flow [2020-10-11 18:23:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:23:00,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:23:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1332 transitions. [2020-10-11 18:23:00,638 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2020-10-11 18:23:00,638 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1332 transitions. [2020-10-11 18:23:00,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1332 transitions. [2020-10-11 18:23:00,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:00,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1332 transitions. [2020-10-11 18:23:00,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:23:00,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:23:00,645 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:23:00,645 INFO L185 Difference]: Start difference. First operand has 148 places, 112 transitions, 518 flow. Second operand 14 states and 1332 transitions. [2020-10-11 18:23:00,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 135 transitions, 953 flow [2020-10-11 18:23:00,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 135 transitions, 772 flow, removed 81 selfloop flow, removed 12 redundant places. [2020-10-11 18:23:00,659 INFO L241 Difference]: Finished difference. Result has 152 places, 119 transitions, 610 flow [2020-10-11 18:23:00,659 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=610, PETRI_PLACES=152, PETRI_TRANSITIONS=119} [2020-10-11 18:23:00,659 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 34 predicate places. [2020-10-11 18:23:00,660 INFO L481 AbstractCegarLoop]: Abstraction has has 152 places, 119 transitions, 610 flow [2020-10-11 18:23:00,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:23:00,660 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:00,660 INFO L255 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] [2020-10-11 18:23:00,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:23:00,660 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1609004353, now seen corresponding path program 2 times [2020-10-11 18:23:00,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:00,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913889730] [2020-10-11 18:23:00,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:00,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:00,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913889730] [2020-10-11 18:23:00,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:00,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:23:00,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189788526] [2020-10-11 18:23:00,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:23:00,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:00,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:23:00,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:23:01,701 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 111 [2020-10-11 18:23:01,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 119 transitions, 610 flow. Second operand 12 states. [2020-10-11 18:23:01,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:01,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 111 [2020-10-11 18:23:01,703 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:02,190 INFO L129 PetriNetUnfolder]: 341/986 cut-off events. [2020-10-11 18:23:02,190 INFO L130 PetriNetUnfolder]: For 9057/9447 co-relation queries the response was YES. [2020-10-11 18:23:02,201 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5029 conditions, 986 events. 341/986 cut-off events. For 9057/9447 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6631 event pairs, 87 based on Foata normal form. 59/1012 useless extension candidates. Maximal degree in co-relation 4945. Up to 410 conditions per place. [2020-10-11 18:23:02,211 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 32 selfloop transitions, 13 changer transitions 10/134 dead transitions. [2020-10-11 18:23:02,211 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 134 transitions, 920 flow [2020-10-11 18:23:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:23:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:23:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1233 transitions. [2020-10-11 18:23:02,217 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8544698544698545 [2020-10-11 18:23:02,217 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1233 transitions. [2020-10-11 18:23:02,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1233 transitions. [2020-10-11 18:23:02,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:02,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1233 transitions. [2020-10-11 18:23:02,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:23:02,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:23:02,225 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:23:02,225 INFO L185 Difference]: Start difference. First operand has 152 places, 119 transitions, 610 flow. Second operand 13 states and 1233 transitions. [2020-10-11 18:23:02,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 134 transitions, 920 flow [2020-10-11 18:23:02,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 134 transitions, 835 flow, removed 41 selfloop flow, removed 8 redundant places. [2020-10-11 18:23:02,245 INFO L241 Difference]: Finished difference. Result has 157 places, 120 transitions, 633 flow [2020-10-11 18:23:02,246 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=633, PETRI_PLACES=157, PETRI_TRANSITIONS=120} [2020-10-11 18:23:02,246 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 39 predicate places. [2020-10-11 18:23:02,247 INFO L481 AbstractCegarLoop]: Abstraction has has 157 places, 120 transitions, 633 flow [2020-10-11 18:23:02,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:23:02,247 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:02,248 INFO L255 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] [2020-10-11 18:23:02,248 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:23:02,248 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:02,248 INFO L82 PathProgramCache]: Analyzing trace with hash -910070155, now seen corresponding path program 3 times [2020-10-11 18:23:02,249 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:02,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707451295] [2020-10-11 18:23:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:02,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707451295] [2020-10-11 18:23:02,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:02,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-11 18:23:02,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11407478] [2020-10-11 18:23:02,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-11 18:23:02,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-11 18:23:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-10-11 18:23:03,730 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 111 [2020-10-11 18:23:03,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 120 transitions, 633 flow. Second operand 13 states. [2020-10-11 18:23:03,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:03,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 111 [2020-10-11 18:23:03,731 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:04,339 INFO L129 PetriNetUnfolder]: 329/988 cut-off events. [2020-10-11 18:23:04,339 INFO L130 PetriNetUnfolder]: For 9114/9523 co-relation queries the response was YES. [2020-10-11 18:23:04,348 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5000 conditions, 988 events. 329/988 cut-off events. For 9114/9523 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6811 event pairs, 53 based on Foata normal form. 92/1048 useless extension candidates. Maximal degree in co-relation 4912. Up to 328 conditions per place. [2020-10-11 18:23:04,355 INFO L132 encePairwiseOnDemand]: 99/111 looper letters, 29 selfloop transitions, 23 changer transitions 10/140 dead transitions. [2020-10-11 18:23:04,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 140 transitions, 1015 flow [2020-10-11 18:23:04,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:23:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:23:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1409 transitions. [2020-10-11 18:23:04,359 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8462462462462462 [2020-10-11 18:23:04,359 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1409 transitions. [2020-10-11 18:23:04,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1409 transitions. [2020-10-11 18:23:04,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:04,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1409 transitions. [2020-10-11 18:23:04,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:23:04,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:23:04,365 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:23:04,365 INFO L185 Difference]: Start difference. First operand has 157 places, 120 transitions, 633 flow. Second operand 15 states and 1409 transitions. [2020-10-11 18:23:04,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 140 transitions, 1015 flow [2020-10-11 18:23:04,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 140 transitions, 913 flow, removed 39 selfloop flow, removed 11 redundant places. [2020-10-11 18:23:04,380 INFO L241 Difference]: Finished difference. Result has 161 places, 123 transitions, 704 flow [2020-10-11 18:23:04,381 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=704, PETRI_PLACES=161, PETRI_TRANSITIONS=123} [2020-10-11 18:23:04,381 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 43 predicate places. [2020-10-11 18:23:04,381 INFO L481 AbstractCegarLoop]: Abstraction has has 161 places, 123 transitions, 704 flow [2020-10-11 18:23:04,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-11 18:23:04,381 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:04,381 INFO L255 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] [2020-10-11 18:23:04,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:23:04,382 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1314441207, now seen corresponding path program 4 times [2020-10-11 18:23:04,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:04,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559908562] [2020-10-11 18:23:04,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:04,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559908562] [2020-10-11 18:23:04,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:04,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:23:04,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56653318] [2020-10-11 18:23:04,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:23:04,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:23:04,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:23:06,484 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 111 [2020-10-11 18:23:06,485 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 123 transitions, 704 flow. Second operand 12 states. [2020-10-11 18:23:06,485 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:06,485 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 111 [2020-10-11 18:23:06,485 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:07,162 INFO L129 PetriNetUnfolder]: 282/1062 cut-off events. [2020-10-11 18:23:07,162 INFO L130 PetriNetUnfolder]: For 8799/9054 co-relation queries the response was YES. [2020-10-11 18:23:07,171 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4878 conditions, 1062 events. 282/1062 cut-off events. For 8799/9054 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8089 event pairs, 65 based on Foata normal form. 75/1101 useless extension candidates. Maximal degree in co-relation 4789. Up to 208 conditions per place. [2020-10-11 18:23:07,179 INFO L132 encePairwiseOnDemand]: 100/111 looper letters, 20 selfloop transitions, 23 changer transitions 10/137 dead transitions. [2020-10-11 18:23:07,180 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 137 transitions, 1000 flow [2020-10-11 18:23:07,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:23:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:23:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1431 transitions. [2020-10-11 18:23:07,184 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8594594594594595 [2020-10-11 18:23:07,184 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1431 transitions. [2020-10-11 18:23:07,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1431 transitions. [2020-10-11 18:23:07,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:07,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1431 transitions. [2020-10-11 18:23:07,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:23:07,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:23:07,189 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:23:07,189 INFO L185 Difference]: Start difference. First operand has 161 places, 123 transitions, 704 flow. Second operand 15 states and 1431 transitions. [2020-10-11 18:23:07,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 137 transitions, 1000 flow [2020-10-11 18:23:07,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 137 transitions, 881 flow, removed 53 selfloop flow, removed 10 redundant places. [2020-10-11 18:23:07,210 INFO L241 Difference]: Finished difference. Result has 166 places, 123 transitions, 716 flow [2020-10-11 18:23:07,211 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=716, PETRI_PLACES=166, PETRI_TRANSITIONS=123} [2020-10-11 18:23:07,211 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 48 predicate places. [2020-10-11 18:23:07,211 INFO L481 AbstractCegarLoop]: Abstraction has has 166 places, 123 transitions, 716 flow [2020-10-11 18:23:07,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:23:07,211 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:07,211 INFO L255 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] [2020-10-11 18:23:07,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 18:23:07,212 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:07,212 INFO L82 PathProgramCache]: Analyzing trace with hash -992886741, now seen corresponding path program 1 times [2020-10-11 18:23:07,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:07,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607839354] [2020-10-11 18:23:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:07,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607839354] [2020-10-11 18:23:07,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:07,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:23:07,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903045451] [2020-10-11 18:23:07,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:23:07,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:07,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:23:07,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:23:07,488 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:07,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 123 transitions, 716 flow. Second operand 6 states. [2020-10-11 18:23:07,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:07,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:07,490 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:08,184 INFO L129 PetriNetUnfolder]: 2513/5499 cut-off events. [2020-10-11 18:23:08,184 INFO L130 PetriNetUnfolder]: For 14774/15203 co-relation queries the response was YES. [2020-10-11 18:23:08,229 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15733 conditions, 5499 events. 2513/5499 cut-off events. For 14774/15203 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 52294 event pairs, 493 based on Foata normal form. 297/5037 useless extension candidates. Maximal degree in co-relation 15646. Up to 1670 conditions per place. [2020-10-11 18:23:08,257 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 23 selfloop transitions, 19 changer transitions 0/154 dead transitions. [2020-10-11 18:23:08,257 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 154 transitions, 862 flow [2020-10-11 18:23:08,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:23:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:23:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 917 transitions. [2020-10-11 18:23:08,260 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9179179179179179 [2020-10-11 18:23:08,260 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 917 transitions. [2020-10-11 18:23:08,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 917 transitions. [2020-10-11 18:23:08,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:08,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 917 transitions. [2020-10-11 18:23:08,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:23:08,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:23:08,263 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:23:08,263 INFO L185 Difference]: Start difference. First operand has 166 places, 123 transitions, 716 flow. Second operand 9 states and 917 transitions. [2020-10-11 18:23:08,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 154 transitions, 862 flow [2020-10-11 18:23:08,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 154 transitions, 797 flow, removed 9 selfloop flow, removed 14 redundant places. [2020-10-11 18:23:08,305 INFO L241 Difference]: Finished difference. Result has 159 places, 140 transitions, 785 flow [2020-10-11 18:23:08,305 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=785, PETRI_PLACES=159, PETRI_TRANSITIONS=140} [2020-10-11 18:23:08,305 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 41 predicate places. [2020-10-11 18:23:08,305 INFO L481 AbstractCegarLoop]: Abstraction has has 159 places, 140 transitions, 785 flow [2020-10-11 18:23:08,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:23:08,306 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:08,306 INFO L255 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] [2020-10-11 18:23:08,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 18:23:08,306 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:08,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:08,306 INFO L82 PathProgramCache]: Analyzing trace with hash -22182893, now seen corresponding path program 1 times [2020-10-11 18:23:08,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:08,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452845784] [2020-10-11 18:23:08,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:08,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:08,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452845784] [2020-10-11 18:23:08,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:08,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:23:08,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827754841] [2020-10-11 18:23:08,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:23:08,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:08,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:23:08,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:23:08,526 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:08,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 140 transitions, 785 flow. Second operand 7 states. [2020-10-11 18:23:08,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:08,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:08,527 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:09,274 INFO L129 PetriNetUnfolder]: 2306/5151 cut-off events. [2020-10-11 18:23:09,274 INFO L130 PetriNetUnfolder]: For 17073/29648 co-relation queries the response was YES. [2020-10-11 18:23:09,315 INFO L80 FinitePrefix]: Finished finitePrefix Result has 19632 conditions, 5151 events. 2306/5151 cut-off events. For 17073/29648 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 48923 event pairs, 108 based on Foata normal form. 569/5028 useless extension candidates. Maximal degree in co-relation 19550. Up to 2351 conditions per place. [2020-10-11 18:23:09,346 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 25 selfloop transitions, 37 changer transitions 0/174 dead transitions. [2020-10-11 18:23:09,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 174 transitions, 1138 flow [2020-10-11 18:23:09,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:23:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:23:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1224 transitions. [2020-10-11 18:23:09,349 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2020-10-11 18:23:09,349 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1224 transitions. [2020-10-11 18:23:09,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1224 transitions. [2020-10-11 18:23:09,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:09,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1224 transitions. [2020-10-11 18:23:09,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:23:09,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:23:09,353 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:23:09,353 INFO L185 Difference]: Start difference. First operand has 159 places, 140 transitions, 785 flow. Second operand 12 states and 1224 transitions. [2020-10-11 18:23:09,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 174 transitions, 1138 flow [2020-10-11 18:23:09,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 174 transitions, 1136 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-11 18:23:09,394 INFO L241 Difference]: Finished difference. Result has 174 places, 159 transitions, 1063 flow [2020-10-11 18:23:09,394 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1063, PETRI_PLACES=174, PETRI_TRANSITIONS=159} [2020-10-11 18:23:09,395 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 56 predicate places. [2020-10-11 18:23:09,395 INFO L481 AbstractCegarLoop]: Abstraction has has 174 places, 159 transitions, 1063 flow [2020-10-11 18:23:09,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:23:09,395 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:09,395 INFO L255 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] [2020-10-11 18:23:09,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-11 18:23:09,395 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash 2058697812, now seen corresponding path program 1 times [2020-10-11 18:23:09,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:09,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455859849] [2020-10-11 18:23:09,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:09,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455859849] [2020-10-11 18:23:09,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:09,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:23:09,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559135589] [2020-10-11 18:23:09,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:23:09,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:23:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:23:09,719 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 111 [2020-10-11 18:23:09,720 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 159 transitions, 1063 flow. Second operand 7 states. [2020-10-11 18:23:09,720 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:09,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 111 [2020-10-11 18:23:09,720 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:10,653 INFO L129 PetriNetUnfolder]: 2357/7077 cut-off events. [2020-10-11 18:23:10,654 INFO L130 PetriNetUnfolder]: For 33150/54887 co-relation queries the response was YES. [2020-10-11 18:23:10,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 29476 conditions, 7077 events. 2357/7077 cut-off events. For 33150/54887 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 82644 event pairs, 290 based on Foata normal form. 310/6551 useless extension candidates. Maximal degree in co-relation 29386. Up to 2640 conditions per place. [2020-10-11 18:23:10,745 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 15 selfloop transitions, 5 changer transitions 6/169 dead transitions. [2020-10-11 18:23:10,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 169 transitions, 1185 flow [2020-10-11 18:23:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 18:23:10,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-11 18:23:10,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 714 transitions. [2020-10-11 18:23:10,747 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.918918918918919 [2020-10-11 18:23:10,747 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 714 transitions. [2020-10-11 18:23:10,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 714 transitions. [2020-10-11 18:23:10,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:10,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 714 transitions. [2020-10-11 18:23:10,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-11 18:23:10,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-11 18:23:10,750 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-11 18:23:10,750 INFO L185 Difference]: Start difference. First operand has 174 places, 159 transitions, 1063 flow. Second operand 7 states and 714 transitions. [2020-10-11 18:23:10,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 169 transitions, 1185 flow [2020-10-11 18:23:11,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 169 transitions, 1090 flow, removed 38 selfloop flow, removed 4 redundant places. [2020-10-11 18:23:11,049 INFO L241 Difference]: Finished difference. Result has 181 places, 157 transitions, 971 flow [2020-10-11 18:23:11,050 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=971, PETRI_PLACES=181, PETRI_TRANSITIONS=157} [2020-10-11 18:23:11,050 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 63 predicate places. [2020-10-11 18:23:11,050 INFO L481 AbstractCegarLoop]: Abstraction has has 181 places, 157 transitions, 971 flow [2020-10-11 18:23:11,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:23:11,050 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:11,050 INFO L255 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] [2020-10-11 18:23:11,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-11 18:23:11,051 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:11,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash -2025495920, now seen corresponding path program 2 times [2020-10-11 18:23:11,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:11,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197593647] [2020-10-11 18:23:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:11,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:11,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197593647] [2020-10-11 18:23:11,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:11,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:23:11,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637923695] [2020-10-11 18:23:11,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:23:11,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:11,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:23:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:23:11,304 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 111 [2020-10-11 18:23:11,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 157 transitions, 971 flow. Second operand 6 states. [2020-10-11 18:23:11,305 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:11,305 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 111 [2020-10-11 18:23:11,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:13,699 INFO L129 PetriNetUnfolder]: 3270/10311 cut-off events. [2020-10-11 18:23:13,699 INFO L130 PetriNetUnfolder]: For 46659/55660 co-relation queries the response was YES. [2020-10-11 18:23:13,766 INFO L80 FinitePrefix]: Finished finitePrefix Result has 38935 conditions, 10311 events. 3270/10311 cut-off events. For 46659/55660 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 129485 event pairs, 479 based on Foata normal form. 421/9460 useless extension candidates. Maximal degree in co-relation 38842. Up to 2773 conditions per place. [2020-10-11 18:23:13,794 INFO L132 encePairwiseOnDemand]: 105/111 looper letters, 17 selfloop transitions, 14 changer transitions 5/178 dead transitions. [2020-10-11 18:23:13,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 178 transitions, 1261 flow [2020-10-11 18:23:13,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:23:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:23:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 926 transitions. [2020-10-11 18:23:13,796 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9269269269269269 [2020-10-11 18:23:13,796 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 926 transitions. [2020-10-11 18:23:13,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 926 transitions. [2020-10-11 18:23:13,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:13,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 926 transitions. [2020-10-11 18:23:13,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:23:13,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:23:13,800 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:23:13,800 INFO L185 Difference]: Start difference. First operand has 181 places, 157 transitions, 971 flow. Second operand 9 states and 926 transitions. [2020-10-11 18:23:13,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 178 transitions, 1261 flow [2020-10-11 18:23:14,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 178 transitions, 1220 flow, removed 6 selfloop flow, removed 6 redundant places. [2020-10-11 18:23:14,033 INFO L241 Difference]: Finished difference. Result has 190 places, 167 transitions, 1135 flow [2020-10-11 18:23:14,034 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1135, PETRI_PLACES=190, PETRI_TRANSITIONS=167} [2020-10-11 18:23:14,034 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 72 predicate places. [2020-10-11 18:23:14,034 INFO L481 AbstractCegarLoop]: Abstraction has has 190 places, 167 transitions, 1135 flow [2020-10-11 18:23:14,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:23:14,034 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:14,034 INFO L255 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] [2020-10-11 18:23:14,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-11 18:23:14,035 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:14,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:14,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2102998548, now seen corresponding path program 1 times [2020-10-11 18:23:14,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:14,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851246714] [2020-10-11 18:23:14,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:14,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851246714] [2020-10-11 18:23:14,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:14,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:23:14,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005110076] [2020-10-11 18:23:14,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:23:14,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:23:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:23:14,459 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:14,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 167 transitions, 1135 flow. Second operand 8 states. [2020-10-11 18:23:14,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:14,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:14,460 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:16,434 INFO L129 PetriNetUnfolder]: 6222/12881 cut-off events. [2020-10-11 18:23:16,434 INFO L130 PetriNetUnfolder]: For 103531/158237 co-relation queries the response was YES. [2020-10-11 18:23:16,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 63265 conditions, 12881 events. 6222/12881 cut-off events. For 103531/158237 co-relation queries the response was YES. Maximal size of possible extension queue 2014. Compared 139081 event pairs, 33 based on Foata normal form. 1960/13029 useless extension candidates. Maximal degree in co-relation 63167. Up to 5619 conditions per place. [2020-10-11 18:23:16,604 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 19 selfloop transitions, 57 changer transitions 29/202 dead transitions. [2020-10-11 18:23:16,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 202 transitions, 1673 flow [2020-10-11 18:23:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:23:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:23:16,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1531 transitions. [2020-10-11 18:23:16,607 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9195195195195195 [2020-10-11 18:23:16,607 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1531 transitions. [2020-10-11 18:23:16,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1531 transitions. [2020-10-11 18:23:16,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:16,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1531 transitions. [2020-10-11 18:23:16,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:23:16,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:23:16,612 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:23:16,612 INFO L185 Difference]: Start difference. First operand has 190 places, 167 transitions, 1135 flow. Second operand 15 states and 1531 transitions. [2020-10-11 18:23:16,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 202 transitions, 1673 flow [2020-10-11 18:23:17,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 202 transitions, 1619 flow, removed 24 selfloop flow, removed 2 redundant places. [2020-10-11 18:23:17,078 INFO L241 Difference]: Finished difference. Result has 205 places, 169 transitions, 1257 flow [2020-10-11 18:23:17,078 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=1053, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1257, PETRI_PLACES=205, PETRI_TRANSITIONS=169} [2020-10-11 18:23:17,078 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 87 predicate places. [2020-10-11 18:23:17,078 INFO L481 AbstractCegarLoop]: Abstraction has has 205 places, 169 transitions, 1257 flow [2020-10-11 18:23:17,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:23:17,079 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:17,079 INFO L255 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] [2020-10-11 18:23:17,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-11 18:23:17,079 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:17,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1061433217, now seen corresponding path program 1 times [2020-10-11 18:23:17,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:17,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834911829] [2020-10-11 18:23:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:23:17,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 18:23:17,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834911829] [2020-10-11 18:23:17,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:23:17,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:23:17,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582240134] [2020-10-11 18:23:17,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:23:17,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:23:17,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:23:17,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:23:17,475 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 111 [2020-10-11 18:23:17,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 169 transitions, 1257 flow. Second operand 9 states. [2020-10-11 18:23:17,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:23:17,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 111 [2020-10-11 18:23:17,476 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:23:19,807 INFO L129 PetriNetUnfolder]: 5467/11799 cut-off events. [2020-10-11 18:23:19,807 INFO L130 PetriNetUnfolder]: For 124018/215892 co-relation queries the response was YES. [2020-10-11 18:23:19,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 64619 conditions, 11799 events. 5467/11799 cut-off events. For 124018/215892 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 132076 event pairs, 0 based on Foata normal form. 2020/12019 useless extension candidates. Maximal degree in co-relation 64559. Up to 4955 conditions per place. [2020-10-11 18:23:19,952 INFO L132 encePairwiseOnDemand]: 101/111 looper letters, 12 selfloop transitions, 57 changer transitions 38/193 dead transitions. [2020-10-11 18:23:19,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 193 transitions, 1678 flow [2020-10-11 18:23:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-11 18:23:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-11 18:23:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1822 transitions. [2020-10-11 18:23:19,956 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9119119119119119 [2020-10-11 18:23:19,956 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1822 transitions. [2020-10-11 18:23:19,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1822 transitions. [2020-10-11 18:23:19,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:23:19,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1822 transitions. [2020-10-11 18:23:19,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-11 18:23:19,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-11 18:23:19,965 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-11 18:23:19,965 INFO L185 Difference]: Start difference. First operand has 205 places, 169 transitions, 1257 flow. Second operand 18 states and 1822 transitions. [2020-10-11 18:23:19,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 193 transitions, 1678 flow [2020-10-11 18:23:23,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 193 transitions, 1178 flow, removed 193 selfloop flow, removed 34 redundant places. [2020-10-11 18:23:23,493 INFO L241 Difference]: Finished difference. Result has 185 places, 151 transitions, 855 flow [2020-10-11 18:23:23,493 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=111, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=855, PETRI_PLACES=185, PETRI_TRANSITIONS=151} [2020-10-11 18:23:23,493 INFO L341 CegarLoopForPetriNet]: 118 programPoint places, 67 predicate places. [2020-10-11 18:23:23,494 INFO L481 AbstractCegarLoop]: Abstraction has has 185 places, 151 transitions, 855 flow [2020-10-11 18:23:23,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:23:23,494 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:23:23,494 INFO L255 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, 1, 1, 1] [2020-10-11 18:23:23,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-11 18:23:23,494 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:23:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:23:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash 2136421273, now seen corresponding path program 1 times [2020-10-11 18:23:23,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:23:23,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445856352] [2020-10-11 18:23:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:23:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:23:23,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:23:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:23:23,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:23:23,894 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:23:23,895 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:23:23,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-11 18:23:23,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,946 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,946 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,957 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,957 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,958 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,958 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,959 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,959 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:23,960 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-11 18:23:23,960 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:23:24,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:23:24 BasicIcfg [2020-10-11 18:23:24,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:23:24,104 INFO L168 Benchmark]: Toolchain (without parser) took 37540.53 ms. Allocated memory was 252.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 207.3 MB in the beginning and 977.4 MB in the end (delta: -770.0 MB). Peak memory consumption was 441.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:24,104 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 18:23:24,111 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.87 ms. Allocated memory was 252.2 MB in the beginning and 316.1 MB in the end (delta: 64.0 MB). Free memory was 207.3 MB in the beginning and 264.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:24,112 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.83 ms. Allocated memory is still 316.1 MB. Free memory was 264.4 MB in the beginning and 261.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:24,114 INFO L168 Benchmark]: Boogie Preprocessor took 50.33 ms. Allocated memory is still 316.1 MB. Free memory was 261.9 MB in the beginning and 259.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:24,115 INFO L168 Benchmark]: RCFGBuilder took 1864.29 ms. Allocated memory was 316.1 MB in the beginning and 359.7 MB in the end (delta: 43.5 MB). Free memory was 259.3 MB in the beginning and 199.9 MB in the end (delta: 59.4 MB). Peak memory consumption was 102.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:24,117 INFO L168 Benchmark]: TraceAbstraction took 34855.98 ms. Allocated memory was 359.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 199.9 MB in the beginning and 977.4 MB in the end (delta: -777.4 MB). Peak memory consumption was 326.2 MB. Max. memory is 14.2 GB. [2020-10-11 18:23:24,128 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 693.87 ms. Allocated memory was 252.2 MB in the beginning and 316.1 MB in the end (delta: 64.0 MB). Free memory was 207.3 MB in the beginning and 264.4 MB in the end (delta: -57.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.83 ms. Allocated memory is still 316.1 MB. Free memory was 264.4 MB in the beginning and 261.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 50.33 ms. Allocated memory is still 316.1 MB. Free memory was 261.9 MB in the beginning and 259.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1864.29 ms. Allocated memory was 316.1 MB in the beginning and 359.7 MB in the end (delta: 43.5 MB). Free memory was 259.3 MB in the beginning and 199.9 MB in the end (delta: 59.4 MB). Peak memory consumption was 102.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 34855.98 ms. Allocated memory was 359.7 MB in the beginning and 1.5 GB in the end (delta: 1.1 GB). Free memory was 199.9 MB in the beginning and 977.4 MB in the end (delta: -777.4 MB). Peak memory consumption was 326.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L701] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0] [L703] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L705] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L707] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L708] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L709] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L711] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L713] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L716] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L717] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L718] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L719] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L720] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L721] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L722] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L723] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L724] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L725] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L726] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L727] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L728] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L729] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L730] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L731] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L732] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L733] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] 0 pthread_t t1261; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] FCALL, FORK 0 pthread_create(&t1261, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1262; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] FCALL, FORK 0 pthread_create(&t1262, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1263; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] FCALL, FORK 0 pthread_create(&t1263, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1264; VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t1264, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$w_buff1 = z$w_buff0 [L790] 4 z$w_buff0 = 2 [L791] 4 z$w_buff1_used = z$w_buff0_used [L792] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L794] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L795] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L796] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L797] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L798] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L799] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L775] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L778] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L779] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L846] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 z$flush_delayed = weak$$choice2 [L856] 0 z$mem_tmp = z [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L857] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L858] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L862] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L865] 0 z = z$flush_delayed ? z$mem_tmp : z [L866] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 34.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 29.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 479 SDtfs, 891 SDslu, 2617 SDs, 0 SdLazy, 2535 SolverSat, 457 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1257occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1335 ConstructedInterpolants, 0 QuantifiedInterpolants, 474696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...