/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/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 18:45:01,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 18:45:01,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 18:45:01,329 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 18:45:01,329 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 18:45:01,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 18:45:01,332 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 18:45:01,333 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 18:45:01,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 18:45:01,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 18:45:01,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 18:45:01,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 18:45:01,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 18:45:01,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 18:45:01,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 18:45:01,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 18:45:01,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 18:45:01,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 18:45:01,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 18:45:01,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 18:45:01,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 18:45:01,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 18:45:01,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 18:45:01,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 18:45:01,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 18:45:01,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 18:45:01,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 18:45:01,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 18:45:01,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 18:45:01,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 18:45:01,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 18:45:01,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 18:45:01,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 18:45:01,361 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 18:45:01,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 18:45:01,362 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 18:45:01,365 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 18:45:01,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 18:45:01,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 18:45:01,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 18:45:01,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 18:45:01,376 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:45:01,419 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 18:45:01,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 18:45:01,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 18:45:01,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 18:45:01,422 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 18:45:01,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 18:45:01,423 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 18:45:01,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 18:45:01,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 18:45:01,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 18:45:01,423 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 18:45:01,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 18:45:01,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 18:45:01,424 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 18:45:01,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 18:45:01,424 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 18:45:01,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 18:45:01,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 18:45:01,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 18:45:01,427 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 18:45:01,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 18:45:01,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 18:45:01,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 18:45:01,428 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 18:45:01,428 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 18:45:01,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 18:45:01,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 18:45:01,428 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-11 18:45:01,429 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-11 18:45:01,429 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 18:45:01,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 18:45:01,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 18:45:01,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 18:45:01,737 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 18:45:01,738 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 18:45:01,738 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-11 18:45:01,803 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc75a62d4/4285deee0ab148fb957e2e89d16f2c27/FLAGa9c010624 [2020-10-11 18:45:02,286 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 18:45:02,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2020-10-11 18:45:02,307 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc75a62d4/4285deee0ab148fb957e2e89d16f2c27/FLAGa9c010624 [2020-10-11 18:45:02,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc75a62d4/4285deee0ab148fb957e2e89d16f2c27 [2020-10-11 18:45:02,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 18:45:02,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 18:45:02,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:02,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 18:45:02,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 18:45:02,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:02" (1/1) ... [2020-10-11 18:45:02,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a97c254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:02, skipping insertion in model container [2020-10-11 18:45:02,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:45:02" (1/1) ... [2020-10-11 18:45:02,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 18:45:02,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 18:45:03,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:03,286 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 18:45:03,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 18:45:03,416 INFO L208 MainTranslator]: Completed translation [2020-10-11 18:45:03,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03 WrapperNode [2020-10-11 18:45:03,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 18:45:03,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:03,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 18:45:03,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 18:45:03,427 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:45:03" (1/1) ... [2020-10-11 18:45:03,447 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:45:03" (1/1) ... [2020-10-11 18:45:03,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 18:45:03,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 18:45:03,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 18:45:03,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 18:45:03,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (1/1) ... [2020-10-11 18:45:03,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (1/1) ... [2020-10-11 18:45:03,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (1/1) ... [2020-10-11 18:45:03,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (1/1) ... [2020-10-11 18:45:03,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (1/1) ... [2020-10-11 18:45:03,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (1/1) ... [2020-10-11 18:45:03,533 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (1/1) ... [2020-10-11 18:45:03,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 18:45:03,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 18:45:03,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 18:45:03,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 18:45:03,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (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:45:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 18:45:03,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 18:45:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 18:45:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 18:45:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 18:45:03,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 18:45:03,610 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 18:45:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 18:45:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 18:45:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 18:45:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 18:45:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 18:45:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 18:45:03,615 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:45:05,488 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 18:45:05,488 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 18:45:05,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:05 BoogieIcfgContainer [2020-10-11 18:45:05,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 18:45:05,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 18:45:05,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 18:45:05,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 18:45:05,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:45:02" (1/3) ... [2020-10-11 18:45:05,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c05a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:05, skipping insertion in model container [2020-10-11 18:45:05,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:45:03" (2/3) ... [2020-10-11 18:45:05,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c05a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:45:05, skipping insertion in model container [2020-10-11 18:45:05,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:45:05" (3/3) ... [2020-10-11 18:45:05,499 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2020-10-11 18:45:05,511 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 18:45:05,519 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 18:45:05,520 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 18:45:05,548 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,549 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,551 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,551 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,551 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,554 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,554 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,555 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,555 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,561 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,562 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,562 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,562 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,562 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,563 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,571 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,571 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,574 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,574 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 18:45:05,592 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 18:45:05,613 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 18:45:05,614 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-11 18:45:05,614 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 18:45:05,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 18:45:05,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 18:45:05,614 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 18:45:05,614 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 18:45:05,615 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 18:45:05,629 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 197 flow [2020-10-11 18:45:05,673 INFO L129 PetriNetUnfolder]: 2/88 cut-off events. [2020-10-11 18:45:05,673 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:05,678 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-11 18:45:05,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 91 transitions, 197 flow [2020-10-11 18:45:05,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 88 transitions, 185 flow [2020-10-11 18:45:05,702 INFO L129 PetriNetUnfolder]: 0/56 cut-off events. [2020-10-11 18:45:05,703 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:05,703 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:05,704 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] [2020-10-11 18:45:05,705 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:05,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:05,712 INFO L82 PathProgramCache]: Analyzing trace with hash 2032561330, now seen corresponding path program 1 times [2020-10-11 18:45:05,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:05,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277239589] [2020-10-11 18:45:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:06,126 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:45:06,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277239589] [2020-10-11 18:45:06,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:06,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 18:45:06,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584242772] [2020-10-11 18:45:06,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 18:45:06,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:06,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 18:45:06,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 18:45:06,284 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 91 [2020-10-11 18:45:06,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 88 transitions, 185 flow. Second operand 3 states. [2020-10-11 18:45:06,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:06,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 91 [2020-10-11 18:45:06,288 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:06,316 INFO L129 PetriNetUnfolder]: 0/85 cut-off events. [2020-10-11 18:45:06,317 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 18:45:06,317 INFO L80 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 85 events. 0/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 4/87 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-11 18:45:06,319 INFO L132 encePairwiseOnDemand]: 86/91 looper letters, 0 selfloop transitions, 2 changer transitions 11/85 dead transitions. [2020-10-11 18:45:06,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 85 transitions, 183 flow [2020-10-11 18:45:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 18:45:06,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-11 18:45:06,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2020-10-11 18:45:06,335 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9706959706959707 [2020-10-11 18:45:06,336 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 265 transitions. [2020-10-11 18:45:06,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 265 transitions. [2020-10-11 18:45:06,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:06,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 265 transitions. [2020-10-11 18:45:06,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-11 18:45:06,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-11 18:45:06,352 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-11 18:45:06,354 INFO L185 Difference]: Start difference. First operand has 96 places, 88 transitions, 185 flow. Second operand 3 states and 265 transitions. [2020-10-11 18:45:06,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 85 transitions, 183 flow [2020-10-11 18:45:06,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 85 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-11 18:45:06,363 INFO L241 Difference]: Finished difference. Result has 94 places, 74 transitions, 158 flow [2020-10-11 18:45:06,366 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=94, PETRI_TRANSITIONS=74} [2020-10-11 18:45:06,368 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, -2 predicate places. [2020-10-11 18:45:06,368 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 74 transitions, 158 flow [2020-10-11 18:45:06,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 18:45:06,368 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:06,368 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] [2020-10-11 18:45:06,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 18:45:06,369 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:06,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1833211573, now seen corresponding path program 1 times [2020-10-11 18:45:06,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:06,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222383887] [2020-10-11 18:45:06,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:06,700 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:45:06,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222383887] [2020-10-11 18:45:06,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:06,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:45:06,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941009339] [2020-10-11 18:45:06,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:45:06,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:06,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:45:06,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:45:07,142 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2020-10-11 18:45:07,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 74 transitions, 158 flow. Second operand 9 states. [2020-10-11 18:45:07,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:07,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2020-10-11 18:45:07,143 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:07,563 INFO L129 PetriNetUnfolder]: 97/300 cut-off events. [2020-10-11 18:45:07,563 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2020-10-11 18:45:07,565 INFO L80 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 300 events. 97/300 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1322 event pairs, 44 based on Foata normal form. 9/303 useless extension candidates. Maximal degree in co-relation 484. Up to 106 conditions per place. [2020-10-11 18:45:07,567 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 13 selfloop transitions, 8 changer transitions 35/115 dead transitions. [2020-10-11 18:45:07,567 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 115 transitions, 366 flow [2020-10-11 18:45:07,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:45:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:45:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1154 transitions. [2020-10-11 18:45:07,575 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8454212454212454 [2020-10-11 18:45:07,575 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1154 transitions. [2020-10-11 18:45:07,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1154 transitions. [2020-10-11 18:45:07,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:07,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1154 transitions. [2020-10-11 18:45:07,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:45:07,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:45:07,584 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:45:07,585 INFO L185 Difference]: Start difference. First operand has 94 places, 74 transitions, 158 flow. Second operand 15 states and 1154 transitions. [2020-10-11 18:45:07,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 115 transitions, 366 flow [2020-10-11 18:45:07,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 115 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-11 18:45:07,590 INFO L241 Difference]: Finished difference. Result has 106 places, 78 transitions, 226 flow [2020-10-11 18:45:07,590 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=226, PETRI_PLACES=106, PETRI_TRANSITIONS=78} [2020-10-11 18:45:07,591 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2020-10-11 18:45:07,591 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 78 transitions, 226 flow [2020-10-11 18:45:07,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:45:07,591 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:07,591 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] [2020-10-11 18:45:07,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 18:45:07,592 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:07,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:07,592 INFO L82 PathProgramCache]: Analyzing trace with hash -324873320, now seen corresponding path program 1 times [2020-10-11 18:45:07,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:07,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491487384] [2020-10-11 18:45:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:07,769 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:45:07,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491487384] [2020-10-11 18:45:07,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:07,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:07,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929271912] [2020-10-11 18:45:07,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:07,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:07,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:07,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:07,903 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2020-10-11 18:45:07,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 78 transitions, 226 flow. Second operand 6 states. [2020-10-11 18:45:07,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:07,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2020-10-11 18:45:07,905 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:08,122 INFO L129 PetriNetUnfolder]: 62/254 cut-off events. [2020-10-11 18:45:08,122 INFO L130 PetriNetUnfolder]: For 400/435 co-relation queries the response was YES. [2020-10-11 18:45:08,125 INFO L80 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 254 events. 62/254 cut-off events. For 400/435 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1060 event pairs, 24 based on Foata normal form. 8/255 useless extension candidates. Maximal degree in co-relation 599. Up to 68 conditions per place. [2020-10-11 18:45:08,127 INFO L132 encePairwiseOnDemand]: 84/91 looper letters, 8 selfloop transitions, 3 changer transitions 19/99 dead transitions. [2020-10-11 18:45:08,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 99 transitions, 356 flow [2020-10-11 18:45:08,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 752 transitions. [2020-10-11 18:45:08,130 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9181929181929182 [2020-10-11 18:45:08,130 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 752 transitions. [2020-10-11 18:45:08,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 752 transitions. [2020-10-11 18:45:08,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:08,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 752 transitions. [2020-10-11 18:45:08,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:08,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:08,135 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:08,135 INFO L185 Difference]: Start difference. First operand has 106 places, 78 transitions, 226 flow. Second operand 9 states and 752 transitions. [2020-10-11 18:45:08,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 99 transitions, 356 flow [2020-10-11 18:45:08,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 99 transitions, 338 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-11 18:45:08,142 INFO L241 Difference]: Finished difference. Result has 107 places, 80 transitions, 259 flow [2020-10-11 18:45:08,142 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=259, PETRI_PLACES=107, PETRI_TRANSITIONS=80} [2020-10-11 18:45:08,143 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 11 predicate places. [2020-10-11 18:45:08,143 INFO L481 AbstractCegarLoop]: Abstraction has has 107 places, 80 transitions, 259 flow [2020-10-11 18:45:08,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:08,143 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:08,143 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] [2020-10-11 18:45:08,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 18:45:08,144 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:08,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 443322158, now seen corresponding path program 1 times [2020-10-11 18:45:08,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:08,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131420616] [2020-10-11 18:45:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:08,351 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:45:08,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131420616] [2020-10-11 18:45:08,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:08,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:08,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403711726] [2020-10-11 18:45:08,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:08,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:08,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:08,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:08,533 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 91 [2020-10-11 18:45:08,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 80 transitions, 259 flow. Second operand 6 states. [2020-10-11 18:45:08,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:08,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 91 [2020-10-11 18:45:08,534 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:08,673 INFO L129 PetriNetUnfolder]: 34/259 cut-off events. [2020-10-11 18:45:08,674 INFO L130 PetriNetUnfolder]: For 688/769 co-relation queries the response was YES. [2020-10-11 18:45:08,676 INFO L80 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 259 events. 34/259 cut-off events. For 688/769 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1272 event pairs, 15 based on Foata normal form. 9/261 useless extension candidates. Maximal degree in co-relation 697. Up to 37 conditions per place. [2020-10-11 18:45:08,677 INFO L132 encePairwiseOnDemand]: 85/91 looper letters, 14 selfloop transitions, 11 changer transitions 0/94 dead transitions. [2020-10-11 18:45:08,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 94 transitions, 423 flow [2020-10-11 18:45:08,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:08,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 746 transitions. [2020-10-11 18:45:08,681 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9108669108669109 [2020-10-11 18:45:08,681 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 746 transitions. [2020-10-11 18:45:08,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 746 transitions. [2020-10-11 18:45:08,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:08,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 746 transitions. [2020-10-11 18:45:08,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:08,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:08,685 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:08,685 INFO L185 Difference]: Start difference. First operand has 107 places, 80 transitions, 259 flow. Second operand 9 states and 746 transitions. [2020-10-11 18:45:08,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 94 transitions, 423 flow [2020-10-11 18:45:08,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 94 transitions, 392 flow, removed 14 selfloop flow, removed 4 redundant places. [2020-10-11 18:45:08,693 INFO L241 Difference]: Finished difference. Result has 112 places, 88 transitions, 367 flow [2020-10-11 18:45:08,693 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=367, PETRI_PLACES=112, PETRI_TRANSITIONS=88} [2020-10-11 18:45:08,693 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 16 predicate places. [2020-10-11 18:45:08,694 INFO L481 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 367 flow [2020-10-11 18:45:08,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:08,694 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:08,694 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] [2020-10-11 18:45:08,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 18:45:08,695 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:08,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1535723339, now seen corresponding path program 1 times [2020-10-11 18:45:08,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:08,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123090601] [2020-10-11 18:45:08,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:08,975 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:45:08,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123090601] [2020-10-11 18:45:08,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:08,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-11 18:45:08,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108119294] [2020-10-11 18:45:08,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 18:45:08,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:08,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 18:45:08,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 18:45:09,691 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2020-10-11 18:45:09,692 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 367 flow. Second operand 9 states. [2020-10-11 18:45:09,692 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:09,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2020-10-11 18:45:09,692 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:10,284 INFO L129 PetriNetUnfolder]: 184/570 cut-off events. [2020-10-11 18:45:10,284 INFO L130 PetriNetUnfolder]: For 2191/2212 co-relation queries the response was YES. [2020-10-11 18:45:10,289 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2023 conditions, 570 events. 184/570 cut-off events. For 2191/2212 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3335 event pairs, 54 based on Foata normal form. 9/566 useless extension candidates. Maximal degree in co-relation 1957. Up to 257 conditions per place. [2020-10-11 18:45:10,292 INFO L132 encePairwiseOnDemand]: 81/91 looper letters, 20 selfloop transitions, 8 changer transitions 33/123 dead transitions. [2020-10-11 18:45:10,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 123 transitions, 739 flow [2020-10-11 18:45:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:45:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:45:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1089 transitions. [2020-10-11 18:45:10,296 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8547880690737834 [2020-10-11 18:45:10,296 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1089 transitions. [2020-10-11 18:45:10,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1089 transitions. [2020-10-11 18:45:10,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:10,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1089 transitions. [2020-10-11 18:45:10,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:45:10,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:45:10,303 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:45:10,303 INFO L185 Difference]: Start difference. First operand has 112 places, 88 transitions, 367 flow. Second operand 14 states and 1089 transitions. [2020-10-11 18:45:10,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 123 transitions, 739 flow [2020-10-11 18:45:10,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 123 transitions, 696 flow, removed 20 selfloop flow, removed 1 redundant places. [2020-10-11 18:45:10,316 INFO L241 Difference]: Finished difference. Result has 134 places, 83 transitions, 330 flow [2020-10-11 18:45:10,316 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=330, PETRI_PLACES=134, PETRI_TRANSITIONS=83} [2020-10-11 18:45:10,316 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 38 predicate places. [2020-10-11 18:45:10,316 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 83 transitions, 330 flow [2020-10-11 18:45:10,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 18:45:10,317 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:10,317 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] [2020-10-11 18:45:10,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 18:45:10,317 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -558753283, now seen corresponding path program 2 times [2020-10-11 18:45:10,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:10,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481640641] [2020-10-11 18:45:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:10,683 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:45:10,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481640641] [2020-10-11 18:45:10,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:10,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-11 18:45:10,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743545033] [2020-10-11 18:45:10,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-11 18:45:10,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-11 18:45:10,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-11 18:45:11,864 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2020-10-11 18:45:11,864 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 83 transitions, 330 flow. Second operand 11 states. [2020-10-11 18:45:11,865 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:11,865 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2020-10-11 18:45:11,865 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:12,381 INFO L129 PetriNetUnfolder]: 126/474 cut-off events. [2020-10-11 18:45:12,382 INFO L130 PetriNetUnfolder]: For 3663/3712 co-relation queries the response was YES. [2020-10-11 18:45:12,386 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2019 conditions, 474 events. 126/474 cut-off events. For 3663/3712 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2636 event pairs, 21 based on Foata normal form. 21/487 useless extension candidates. Maximal degree in co-relation 1939. Up to 129 conditions per place. [2020-10-11 18:45:12,390 INFO L132 encePairwiseOnDemand]: 79/91 looper letters, 14 selfloop transitions, 10 changer transitions 29/115 dead transitions. [2020-10-11 18:45:12,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 115 transitions, 790 flow [2020-10-11 18:45:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-11 18:45:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-11 18:45:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1293 transitions. [2020-10-11 18:45:12,395 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8358112475759535 [2020-10-11 18:45:12,395 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1293 transitions. [2020-10-11 18:45:12,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1293 transitions. [2020-10-11 18:45:12,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:12,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1293 transitions. [2020-10-11 18:45:12,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 18 states. [2020-10-11 18:45:12,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 18 states. [2020-10-11 18:45:12,402 INFO L81 ComplementDD]: Finished complementDD. Result 18 states. [2020-10-11 18:45:12,403 INFO L185 Difference]: Start difference. First operand has 134 places, 83 transitions, 330 flow. Second operand 17 states and 1293 transitions. [2020-10-11 18:45:12,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 115 transitions, 790 flow [2020-10-11 18:45:12,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 115 transitions, 689 flow, removed 46 selfloop flow, removed 14 redundant places. [2020-10-11 18:45:12,412 INFO L241 Difference]: Finished difference. Result has 132 places, 85 transitions, 371 flow [2020-10-11 18:45:12,413 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=371, PETRI_PLACES=132, PETRI_TRANSITIONS=85} [2020-10-11 18:45:12,413 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 36 predicate places. [2020-10-11 18:45:12,413 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 85 transitions, 371 flow [2020-10-11 18:45:12,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-11 18:45:12,413 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:12,414 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] [2020-10-11 18:45:12,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 18:45:12,414 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:12,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:12,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1462651979, now seen corresponding path program 1 times [2020-10-11 18:45:12,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:12,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476791161] [2020-10-11 18:45:12,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:12,539 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:45:12,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476791161] [2020-10-11 18:45:12,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:12,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 18:45:12,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839754760] [2020-10-11 18:45:12,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 18:45:12,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:12,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 18:45:12,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 18:45:12,671 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:45:12,672 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 85 transitions, 371 flow. Second operand 6 states. [2020-10-11 18:45:12,672 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:12,672 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:45:12,672 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:12,979 INFO L129 PetriNetUnfolder]: 408/1125 cut-off events. [2020-10-11 18:45:12,979 INFO L130 PetriNetUnfolder]: For 4291/4323 co-relation queries the response was YES. [2020-10-11 18:45:12,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1125 events. 408/1125 cut-off events. For 4291/4323 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 8448 event pairs, 64 based on Foata normal form. 28/1076 useless extension candidates. Maximal degree in co-relation 3297. Up to 294 conditions per place. [2020-10-11 18:45:12,996 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 19 selfloop transitions, 16 changer transitions 0/110 dead transitions. [2020-10-11 18:45:12,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 110 transitions, 491 flow [2020-10-11 18:45:12,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-11 18:45:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-11 18:45:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 739 transitions. [2020-10-11 18:45:13,000 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9023199023199023 [2020-10-11 18:45:13,000 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 739 transitions. [2020-10-11 18:45:13,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 739 transitions. [2020-10-11 18:45:13,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:13,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 739 transitions. [2020-10-11 18:45:13,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-11 18:45:13,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-11 18:45:13,004 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-11 18:45:13,004 INFO L185 Difference]: Start difference. First operand has 132 places, 85 transitions, 371 flow. Second operand 9 states and 739 transitions. [2020-10-11 18:45:13,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 110 transitions, 491 flow [2020-10-11 18:45:13,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 110 transitions, 440 flow, removed 19 selfloop flow, removed 14 redundant places. [2020-10-11 18:45:13,016 INFO L241 Difference]: Finished difference. Result has 122 places, 99 transitions, 431 flow [2020-10-11 18:45:13,016 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=431, PETRI_PLACES=122, PETRI_TRANSITIONS=99} [2020-10-11 18:45:13,017 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2020-10-11 18:45:13,017 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 99 transitions, 431 flow [2020-10-11 18:45:13,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 18:45:13,017 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:13,017 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] [2020-10-11 18:45:13,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 18:45:13,018 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1282427417, now seen corresponding path program 1 times [2020-10-11 18:45:13,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:13,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479506200] [2020-10-11 18:45:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:13,133 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:45:13,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479506200] [2020-10-11 18:45:13,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:13,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 18:45:13,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494806969] [2020-10-11 18:45:13,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 18:45:13,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:13,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 18:45:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-11 18:45:13,307 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:45:13,308 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 99 transitions, 431 flow. Second operand 7 states. [2020-10-11 18:45:13,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:13,309 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:45:13,309 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:13,712 INFO L129 PetriNetUnfolder]: 319/997 cut-off events. [2020-10-11 18:45:13,712 INFO L130 PetriNetUnfolder]: For 2682/3325 co-relation queries the response was YES. [2020-10-11 18:45:13,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 997 events. 319/997 cut-off events. For 2682/3325 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7820 event pairs, 6 based on Foata normal form. 158/1085 useless extension candidates. Maximal degree in co-relation 3267. Up to 328 conditions per place. [2020-10-11 18:45:13,726 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 15 selfloop transitions, 31 changer transitions 6/126 dead transitions. [2020-10-11 18:45:13,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 126 transitions, 711 flow [2020-10-11 18:45:13,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-11 18:45:13,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-11 18:45:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 986 transitions. [2020-10-11 18:45:13,731 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2020-10-11 18:45:13,731 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 986 transitions. [2020-10-11 18:45:13,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 986 transitions. [2020-10-11 18:45:13,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:13,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 986 transitions. [2020-10-11 18:45:13,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-11 18:45:13,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-11 18:45:13,739 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-11 18:45:13,739 INFO L185 Difference]: Start difference. First operand has 122 places, 99 transitions, 431 flow. Second operand 12 states and 986 transitions. [2020-10-11 18:45:13,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 126 transitions, 711 flow [2020-10-11 18:45:13,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 126 transitions, 680 flow, removed 13 selfloop flow, removed 8 redundant places. [2020-10-11 18:45:13,752 INFO L241 Difference]: Finished difference. Result has 128 places, 117 transitions, 625 flow [2020-10-11 18:45:13,753 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=625, PETRI_PLACES=128, PETRI_TRANSITIONS=117} [2020-10-11 18:45:13,753 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 32 predicate places. [2020-10-11 18:45:13,754 INFO L481 AbstractCegarLoop]: Abstraction has has 128 places, 117 transitions, 625 flow [2020-10-11 18:45:13,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 18:45:13,754 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:13,754 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:45:13,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 18:45:13,755 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:13,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1929517030, now seen corresponding path program 1 times [2020-10-11 18:45:13,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:13,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102930009] [2020-10-11 18:45:13,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:13,977 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:45:13,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102930009] [2020-10-11 18:45:13,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:13,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-11 18:45:13,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050996382] [2020-10-11 18:45:13,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 18:45:13,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:13,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 18:45:13,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-11 18:45:14,164 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2020-10-11 18:45:14,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 117 transitions, 625 flow. Second operand 8 states. [2020-10-11 18:45:14,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:14,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2020-10-11 18:45:14,166 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:14,580 INFO L129 PetriNetUnfolder]: 259/876 cut-off events. [2020-10-11 18:45:14,581 INFO L130 PetriNetUnfolder]: For 3231/4374 co-relation queries the response was YES. [2020-10-11 18:45:14,588 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 876 events. 259/876 cut-off events. For 3231/4374 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7190 event pairs, 0 based on Foata normal form. 178/984 useless extension candidates. Maximal degree in co-relation 3193. Up to 284 conditions per place. [2020-10-11 18:45:14,593 INFO L132 encePairwiseOnDemand]: 82/91 looper letters, 10 selfloop transitions, 36 changer transitions 16/136 dead transitions. [2020-10-11 18:45:14,593 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 136 transitions, 879 flow [2020-10-11 18:45:14,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-11 18:45:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-11 18:45:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1221 transitions. [2020-10-11 18:45:14,599 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8945054945054945 [2020-10-11 18:45:14,599 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1221 transitions. [2020-10-11 18:45:14,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1221 transitions. [2020-10-11 18:45:14,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:14,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1221 transitions. [2020-10-11 18:45:14,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-11 18:45:14,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-11 18:45:14,608 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-11 18:45:14,608 INFO L185 Difference]: Start difference. First operand has 128 places, 117 transitions, 625 flow. Second operand 15 states and 1221 transitions. [2020-10-11 18:45:14,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 136 transitions, 879 flow [2020-10-11 18:45:14,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 136 transitions, 698 flow, removed 76 selfloop flow, removed 10 redundant places. [2020-10-11 18:45:14,627 INFO L241 Difference]: Finished difference. Result has 138 places, 117 transitions, 588 flow [2020-10-11 18:45:14,627 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=588, PETRI_PLACES=138, PETRI_TRANSITIONS=117} [2020-10-11 18:45:14,627 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 42 predicate places. [2020-10-11 18:45:14,628 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 117 transitions, 588 flow [2020-10-11 18:45:14,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 18:45:14,628 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:14,628 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] [2020-10-11 18:45:14,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 18:45:14,628 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1590858180, now seen corresponding path program 1 times [2020-10-11 18:45:14,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:14,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751862915] [2020-10-11 18:45:14,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:14,831 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:45:14,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751862915] [2020-10-11 18:45:14,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:14,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-11 18:45:14,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778851621] [2020-10-11 18:45:14,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-11 18:45:14,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:14,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-11 18:45:14,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-10-11 18:45:15,932 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 91 [2020-10-11 18:45:15,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 117 transitions, 588 flow. Second operand 12 states. [2020-10-11 18:45:15,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:15,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 91 [2020-10-11 18:45:15,933 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:16,391 INFO L129 PetriNetUnfolder]: 412/1573 cut-off events. [2020-10-11 18:45:16,392 INFO L130 PetriNetUnfolder]: For 3345/3573 co-relation queries the response was YES. [2020-10-11 18:45:16,406 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4661 conditions, 1573 events. 412/1573 cut-off events. For 3345/3573 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 15962 event pairs, 1 based on Foata normal form. 8/1461 useless extension candidates. Maximal degree in co-relation 4585. Up to 192 conditions per place. [2020-10-11 18:45:16,410 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 16 selfloop transitions, 5 changer transitions 30/138 dead transitions. [2020-10-11 18:45:16,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 138 transitions, 768 flow [2020-10-11 18:45:16,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-11 18:45:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-11 18:45:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1018 transitions. [2020-10-11 18:45:16,413 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.7990580847723705 [2020-10-11 18:45:16,413 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1018 transitions. [2020-10-11 18:45:16,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1018 transitions. [2020-10-11 18:45:16,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:16,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1018 transitions. [2020-10-11 18:45:16,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-11 18:45:16,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-11 18:45:16,420 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-11 18:45:16,420 INFO L185 Difference]: Start difference. First operand has 138 places, 117 transitions, 588 flow. Second operand 14 states and 1018 transitions. [2020-10-11 18:45:16,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 138 transitions, 768 flow [2020-10-11 18:45:16,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 138 transitions, 693 flow, removed 13 selfloop flow, removed 14 redundant places. [2020-10-11 18:45:16,455 INFO L241 Difference]: Finished difference. Result has 142 places, 107 transitions, 487 flow [2020-10-11 18:45:16,456 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=487, PETRI_PLACES=142, PETRI_TRANSITIONS=107} [2020-10-11 18:45:16,456 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 46 predicate places. [2020-10-11 18:45:16,457 INFO L481 AbstractCegarLoop]: Abstraction has has 142 places, 107 transitions, 487 flow [2020-10-11 18:45:16,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-11 18:45:16,457 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:16,457 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] [2020-10-11 18:45:16,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 18:45:16,457 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:16,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:16,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1822589034, now seen corresponding path program 2 times [2020-10-11 18:45:16,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:16,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783087879] [2020-10-11 18:45:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 18:45:17,029 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:45:17,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783087879] [2020-10-11 18:45:17,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 18:45:17,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-11 18:45:17,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565459866] [2020-10-11 18:45:17,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-11 18:45:17,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 18:45:17,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-11 18:45:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-10-11 18:45:19,928 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2020-10-11 18:45:19,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 107 transitions, 487 flow. Second operand 14 states. [2020-10-11 18:45:19,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-11 18:45:19,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2020-10-11 18:45:19,929 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-11 18:45:20,358 INFO L129 PetriNetUnfolder]: 105/567 cut-off events. [2020-10-11 18:45:20,358 INFO L130 PetriNetUnfolder]: For 604/622 co-relation queries the response was YES. [2020-10-11 18:45:20,365 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 567 events. 105/567 cut-off events. For 604/622 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4424 event pairs, 0 based on Foata normal form. 3/541 useless extension candidates. Maximal degree in co-relation 1438. Up to 72 conditions per place. [2020-10-11 18:45:20,366 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 11 selfloop transitions, 9 changer transitions 8/113 dead transitions. [2020-10-11 18:45:20,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 113 transitions, 563 flow [2020-10-11 18:45:20,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-11 18:45:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-11 18:45:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 961 transitions. [2020-10-11 18:45:20,376 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.812341504649197 [2020-10-11 18:45:20,376 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 961 transitions. [2020-10-11 18:45:20,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 961 transitions. [2020-10-11 18:45:20,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-11 18:45:20,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 961 transitions. [2020-10-11 18:45:20,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-11 18:45:20,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-11 18:45:20,386 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-11 18:45:20,386 INFO L185 Difference]: Start difference. First operand has 142 places, 107 transitions, 487 flow. Second operand 13 states and 961 transitions. [2020-10-11 18:45:20,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 113 transitions, 563 flow [2020-10-11 18:45:20,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 113 transitions, 520 flow, removed 14 selfloop flow, removed 15 redundant places. [2020-10-11 18:45:20,395 INFO L241 Difference]: Finished difference. Result has 132 places, 103 transitions, 457 flow [2020-10-11 18:45:20,395 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=457, PETRI_PLACES=132, PETRI_TRANSITIONS=103} [2020-10-11 18:45:20,395 INFO L341 CegarLoopForPetriNet]: 96 programPoint places, 36 predicate places. [2020-10-11 18:45:20,396 INFO L481 AbstractCegarLoop]: Abstraction has has 132 places, 103 transitions, 457 flow [2020-10-11 18:45:20,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-11 18:45:20,396 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-11 18:45:20,396 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] [2020-10-11 18:45:20,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 18:45:20,396 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 18:45:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 18:45:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1584517458, now seen corresponding path program 3 times [2020-10-11 18:45:20,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 18:45:20,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952918623] [2020-10-11 18:45:20,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 18:45:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:45:20,441 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:45:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 18:45:20,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 18:45:20,530 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 18:45:20,531 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 18:45:20,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 18:45:20,556 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:45:20,557 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,558 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:45:20,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,558 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:45:20,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,559 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:45:20,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,559 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:45:20,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,559 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:45:20,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,560 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:45:20,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,560 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:45:20,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,561 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:45:20,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,561 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:45:20,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,561 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:45:20,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,562 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:45:20,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,563 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:45:20,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,563 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:45:20,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,564 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:45:20,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,564 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:45:20,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,564 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:45:20,564 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,565 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:45:20,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,565 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:45:20,565 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,565 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:45:20,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,566 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:45:20,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,566 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:45:20,566 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,567 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:45:20,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,567 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:45:20,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,567 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:45:20,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,568 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:45:20,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,568 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:45:20,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,568 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:45:20,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 18:45:20,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 06:45:20 BasicIcfg [2020-10-11 18:45:20,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 18:45:20,658 INFO L168 Benchmark]: Toolchain (without parser) took 18060.36 ms. Allocated memory was 252.2 MB in the beginning and 566.8 MB in the end (delta: 314.6 MB). Free memory was 208.4 MB in the beginning and 389.8 MB in the end (delta: -181.4 MB). Peak memory consumption was 133.1 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:20,659 INFO L168 Benchmark]: CDTParser took 0.20 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:45:20,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 819.70 ms. Allocated memory was 252.2 MB in the beginning and 321.9 MB in the end (delta: 69.7 MB). Free memory was 208.4 MB in the beginning and 271.7 MB in the end (delta: -63.3 MB). Peak memory consumption was 34.0 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:20,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.78 ms. Allocated memory is still 321.9 MB. Free memory was 271.7 MB in the beginning and 269.2 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:45:20,664 INFO L168 Benchmark]: Boogie Preprocessor took 56.63 ms. Allocated memory is still 321.9 MB. Free memory was 269.2 MB in the beginning and 266.7 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:45:20,666 INFO L168 Benchmark]: RCFGBuilder took 1947.87 ms. Allocated memory was 321.9 MB in the beginning and 360.2 MB in the end (delta: 38.3 MB). Free memory was 266.7 MB in the beginning and 208.0 MB in the end (delta: 58.6 MB). Peak memory consumption was 98.9 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:20,667 INFO L168 Benchmark]: TraceAbstraction took 15163.52 ms. Allocated memory was 360.2 MB in the beginning and 566.8 MB in the end (delta: 206.6 MB). Free memory was 208.0 MB in the beginning and 389.8 MB in the end (delta: -181.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 14.2 GB. [2020-10-11 18:45:20,674 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.20 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 819.70 ms. Allocated memory was 252.2 MB in the beginning and 321.9 MB in the end (delta: 69.7 MB). Free memory was 208.4 MB in the beginning and 271.7 MB in the end (delta: -63.3 MB). Peak memory consumption was 34.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 67.78 ms. Allocated memory is still 321.9 MB. Free memory was 271.7 MB in the beginning and 269.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 56.63 ms. Allocated memory is still 321.9 MB. Free memory was 269.2 MB in the beginning and 266.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1947.87 ms. Allocated memory was 321.9 MB in the beginning and 360.2 MB in the end (delta: 38.3 MB). Free memory was 266.7 MB in the beginning and 208.0 MB in the end (delta: 58.6 MB). Peak memory consumption was 98.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 15163.52 ms. Allocated memory was 360.2 MB in the beginning and 566.8 MB in the end (delta: 206.6 MB). Free memory was 208.0 MB in the beginning and 389.8 MB in the end (delta: -181.8 MB). Peak memory consumption was 24.8 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: [L698] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L700] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L707] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L708] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L709] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L710] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L711] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L712] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L717] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L718] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L719] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L720] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L721] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L722] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t2528; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 0 pthread_t t2529; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L807] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 0 pthread_t t2530; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L809] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$w_buff1 = y$w_buff0 [L768] 3 y$w_buff0 = 2 [L769] 3 y$w_buff1_used = y$w_buff0_used [L770] 3 y$w_buff0_used = (_Bool)1 [L7] COND FALSE 3 !(!expression) [L772] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L773] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L774] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L775] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L776] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L735] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L753] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L754] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L756] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L757] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L782] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L783] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L784] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L785] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L786] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L740] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L811] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L815] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L816] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L817] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L818] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L818] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L819] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L819] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 y$flush_delayed = weak$$choice2 [L825] 0 y$mem_tmp = y [L826] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L826] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L827] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L827] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L828] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L828] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L829] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L829] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L830] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L831] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L832] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L834] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L834] 0 y = y$flush_delayed ? y$mem_tmp : y [L835] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 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: 14.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 11.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 313 SDtfs, 607 SDslu, 1823 SDs, 0 SdLazy, 1459 SolverSat, 254 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 206501 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...