/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/safe017_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-09 17:47:59,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-09 17:47:59,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-09 17:47:59,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-09 17:47:59,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-09 17:47:59,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-09 17:47:59,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-09 17:47:59,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-09 17:47:59,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-09 17:47:59,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-09 17:47:59,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-09 17:47:59,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-09 17:47:59,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-09 17:47:59,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-09 17:47:59,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-09 17:47:59,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-09 17:47:59,477 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-09 17:47:59,478 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-09 17:47:59,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-09 17:47:59,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-09 17:47:59,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-09 17:47:59,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-09 17:47:59,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-09 17:47:59,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-09 17:47:59,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-09 17:47:59,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-09 17:47:59,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-09 17:47:59,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-09 17:47:59,505 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-09 17:47:59,506 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-09 17:47:59,506 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-09 17:47:59,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-09 17:47:59,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-09 17:47:59,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-09 17:47:59,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-09 17:47:59,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-09 17:47:59,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-09 17:47:59,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-09 17:47:59,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-09 17:47:59,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-09 17:47:59,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-09 17:47:59,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/VMCAI2021_PN.epf [2020-10-09 17:47:59,540 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-09 17:47:59,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-09 17:47:59,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-09 17:47:59,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-09 17:47:59,542 INFO L138 SettingsManager]: * Use SBE=true [2020-10-09 17:47:59,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-09 17:47:59,543 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-09 17:47:59,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-09 17:47:59,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-09 17:47:59,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-09 17:47:59,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-09 17:47:59,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-09 17:47:59,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-09 17:47:59,544 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-09 17:47:59,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-09 17:47:59,544 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-09 17:47:59,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-09 17:47:59,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-09 17:47:59,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-09 17:47:59,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-09 17:47:59,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-09 17:47:59,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-09 17:47:59,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-09 17:47:59,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-09 17:47:59,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-09 17:47:59,546 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-10-09 17:47:59,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-09 17:47:59,547 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-10-09 17:47:59,547 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-09 17:47:59,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-09 17:47:59,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-09 17:47:59,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-09 17:47:59,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-09 17:47:59,855 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-09 17:47:59,855 INFO L275 PluginConnector]: CDTParser initialized [2020-10-09 17:47:59,856 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-10-09 17:47:59,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9474807bc/0086d080bf1e4cb9aded2bf9ed8e69b0/FLAGcebb53d16 [2020-10-09 17:48:00,471 INFO L306 CDTParser]: Found 1 translation units. [2020-10-09 17:48:00,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-10-09 17:48:00,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9474807bc/0086d080bf1e4cb9aded2bf9ed8e69b0/FLAGcebb53d16 [2020-10-09 17:48:00,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9474807bc/0086d080bf1e4cb9aded2bf9ed8e69b0 [2020-10-09 17:48:00,687 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-09 17:48:00,688 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-09 17:48:00,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-09 17:48:00,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-09 17:48:00,694 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-09 17:48:00,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:48:00" (1/1) ... [2020-10-09 17:48:00,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2920761b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:00, skipping insertion in model container [2020-10-09 17:48:00,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.10 05:48:00" (1/1) ... [2020-10-09 17:48:00,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-09 17:48:00,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-09 17:48:01,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:48:01,313 INFO L203 MainTranslator]: Completed pre-run [2020-10-09 17:48:01,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-09 17:48:01,475 INFO L208 MainTranslator]: Completed translation [2020-10-09 17:48:01,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01 WrapperNode [2020-10-09 17:48:01,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-09 17:48:01,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-09 17:48:01,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-09 17:48:01,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-09 17:48:01,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-09 17:48:01,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-09 17:48:01,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-09 17:48:01,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-09 17:48:01,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (1/1) ... [2020-10-09 17:48:01,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-09 17:48:01,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-09 17:48:01,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-09 17:48:01,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-09 17:48:01,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (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-09 17:48:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-09 17:48:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-09 17:48:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-09 17:48:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-09 17:48:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-09 17:48:01,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-09 17:48:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-09 17:48:01,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-09 17:48:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-09 17:48:01,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-09 17:48:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-09 17:48:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-09 17:48:01,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-09 17:48:01,671 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-09 17:48:03,624 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-09 17:48:03,625 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-09 17:48:03,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:48:03 BoogieIcfgContainer [2020-10-09 17:48:03,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-09 17:48:03,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-09 17:48:03,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-09 17:48:03,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-09 17:48:03,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.10 05:48:00" (1/3) ... [2020-10-09 17:48:03,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b7606b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:48:03, skipping insertion in model container [2020-10-09 17:48:03,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.10 05:48:01" (2/3) ... [2020-10-09 17:48:03,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b7606b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.10 05:48:03, skipping insertion in model container [2020-10-09 17:48:03,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.10 05:48:03" (3/3) ... [2020-10-09 17:48:03,636 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2020-10-09 17:48:03,647 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-09 17:48:03,655 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-09 17:48:03,656 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-09 17:48:03,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,685 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,686 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,686 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,689 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,689 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,692 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,700 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,700 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,704 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,705 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,705 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,706 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,709 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,709 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-09 17:48:03,728 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-09 17:48:03,752 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-09 17:48:03,752 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-09 17:48:03,753 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-09 17:48:03,753 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-09 17:48:03,753 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-09 17:48:03,753 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-09 17:48:03,753 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-09 17:48:03,754 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-09 17:48:03,768 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 195 flow [2020-10-09 17:48:03,814 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2020-10-09 17:48:03,815 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:48:03,820 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2020-10-09 17:48:03,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 90 transitions, 195 flow [2020-10-09 17:48:03,828 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 87 transitions, 183 flow [2020-10-09 17:48:03,838 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2020-10-09 17:48:03,839 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:48:03,839 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:03,840 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] [2020-10-09 17:48:03,841 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:03,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:03,849 INFO L82 PathProgramCache]: Analyzing trace with hash -644128995, now seen corresponding path program 1 times [2020-10-09 17:48:03,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:03,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105257143] [2020-10-09 17:48:03,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:48:04,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:48:04,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:48:04,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:48:04,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:48:04,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-09 17:48:04,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105257143] [2020-10-09 17:48:04,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:48:04,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-10-09 17:48:04,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565213546] [2020-10-09 17:48:04,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-09 17:48:04,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:48:04,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-09 17:48:04,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-09 17:48:04,337 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 90 [2020-10-09 17:48:04,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 183 flow. Second operand 4 states. [2020-10-09 17:48:04,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:48:04,340 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 90 [2020-10-09 17:48:04,341 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:48:04,376 INFO L129 PetriNetUnfolder]: 0/84 cut-off events. [2020-10-09 17:48:04,376 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:48:04,377 INFO L80 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 0/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 4/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2020-10-09 17:48:04,378 INFO L132 encePairwiseOnDemand]: 85/90 looper letters, 0 selfloop transitions, 2 changer transitions 11/84 dead transitions. [2020-10-09 17:48:04,378 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 84 transitions, 181 flow [2020-10-09 17:48:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-09 17:48:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-09 17:48:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2020-10-09 17:48:04,396 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9703703703703703 [2020-10-09 17:48:04,397 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 262 transitions. [2020-10-09 17:48:04,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 262 transitions. [2020-10-09 17:48:04,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:48:04,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 262 transitions. [2020-10-09 17:48:04,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-09 17:48:04,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-09 17:48:04,413 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-09 17:48:04,415 INFO L185 Difference]: Start difference. First operand has 95 places, 87 transitions, 183 flow. Second operand 3 states and 262 transitions. [2020-10-09 17:48:04,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 84 transitions, 181 flow [2020-10-09 17:48:04,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-09 17:48:04,425 INFO L241 Difference]: Finished difference. Result has 93 places, 73 transitions, 156 flow [2020-10-09 17:48:04,428 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2020-10-09 17:48:04,429 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, -2 predicate places. [2020-10-09 17:48:04,429 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 156 flow [2020-10-09 17:48:04,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-09 17:48:04,429 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:04,429 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] [2020-10-09 17:48:04,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-09 17:48:04,642 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:04,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:04,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1310755725, now seen corresponding path program 1 times [2020-10-09 17:48:04,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:04,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723174805] [2020-10-09 17:48:04,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:48:04,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-09 17:48:04,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:48:04,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:04,853 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-09 17:48:04,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:48:04,922 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-09 17:48:04,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723174805] [2020-10-09 17:48:04,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:48:04,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:48:04,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409297237] [2020-10-09 17:48:04,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:48:04,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:48:04,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:48:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:48:05,185 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 90 [2020-10-09 17:48:05,186 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 156 flow. Second operand 8 states. [2020-10-09 17:48:05,186 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:48:05,186 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 90 [2020-10-09 17:48:05,186 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:48:05,297 INFO L129 PetriNetUnfolder]: 3/99 cut-off events. [2020-10-09 17:48:05,297 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-09 17:48:05,298 INFO L80 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 99 events. 3/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 135 event pairs, 0 based on Foata normal form. 2/101 useless extension candidates. Maximal degree in co-relation 93. Up to 7 conditions per place. [2020-10-09 17:48:05,299 INFO L132 encePairwiseOnDemand]: 84/90 looper letters, 6 selfloop transitions, 2 changer transitions 10/83 dead transitions. [2020-10-09 17:48:05,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 83 transitions, 212 flow [2020-10-09 17:48:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-09 17:48:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-09 17:48:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 740 transitions. [2020-10-09 17:48:05,305 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2020-10-09 17:48:05,305 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 740 transitions. [2020-10-09 17:48:05,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 740 transitions. [2020-10-09 17:48:05,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:48:05,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 740 transitions. [2020-10-09 17:48:05,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-09 17:48:05,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-09 17:48:05,313 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-09 17:48:05,313 INFO L185 Difference]: Start difference. First operand has 93 places, 73 transitions, 156 flow. Second operand 9 states and 740 transitions. [2020-10-09 17:48:05,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 83 transitions, 212 flow [2020-10-09 17:48:05,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-09 17:48:05,317 INFO L241 Difference]: Finished difference. Result has 95 places, 73 transitions, 172 flow [2020-10-09 17:48:05,318 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=172, PETRI_PLACES=95, PETRI_TRANSITIONS=73} [2020-10-09 17:48:05,318 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 0 predicate places. [2020-10-09 17:48:05,319 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 73 transitions, 172 flow [2020-10-09 17:48:05,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:48:05,319 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:05,319 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] [2020-10-09 17:48:05,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-09 17:48:05,532 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:05,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:05,532 INFO L82 PathProgramCache]: Analyzing trace with hash 295474258, now seen corresponding path program 1 times [2020-10-09 17:48:05,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:05,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800090493] [2020-10-09 17:48:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:48:05,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-09 17:48:05,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:48:05,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:05,708 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-09 17:48:05,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:48:05,738 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-09 17:48:05,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800090493] [2020-10-09 17:48:05,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:48:05,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 8 [2020-10-09 17:48:05,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505697760] [2020-10-09 17:48:05,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-09 17:48:05,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:48:05,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-09 17:48:05,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-09 17:48:05,837 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-09 17:48:05,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 73 transitions, 172 flow. Second operand 8 states. [2020-10-09 17:48:05,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:48:05,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-09 17:48:05,838 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:48:06,124 INFO L129 PetriNetUnfolder]: 64/225 cut-off events. [2020-10-09 17:48:06,124 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2020-10-09 17:48:06,127 INFO L80 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 225 events. 64/225 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 847 event pairs, 0 based on Foata normal form. 8/229 useless extension candidates. Maximal degree in co-relation 371. Up to 36 conditions per place. [2020-10-09 17:48:06,130 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 10 selfloop transitions, 9 changer transitions 29/111 dead transitions. [2020-10-09 17:48:06,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 344 flow [2020-10-09 17:48:06,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 17:48:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 17:48:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 975 transitions. [2020-10-09 17:48:06,136 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2020-10-09 17:48:06,139 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 975 transitions. [2020-10-09 17:48:06,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 975 transitions. [2020-10-09 17:48:06,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:48:06,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 975 transitions. [2020-10-09 17:48:06,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 17:48:06,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 17:48:06,145 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 17:48:06,146 INFO L185 Difference]: Start difference. First operand has 95 places, 73 transitions, 172 flow. Second operand 12 states and 975 transitions. [2020-10-09 17:48:06,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 344 flow [2020-10-09 17:48:06,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 111 transitions, 328 flow, removed 6 selfloop flow, removed 8 redundant places. [2020-10-09 17:48:06,152 INFO L241 Difference]: Finished difference. Result has 101 places, 79 transitions, 254 flow [2020-10-09 17:48:06,153 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=254, PETRI_PLACES=101, PETRI_TRANSITIONS=79} [2020-10-09 17:48:06,153 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 6 predicate places. [2020-10-09 17:48:06,153 INFO L481 AbstractCegarLoop]: Abstraction has has 101 places, 79 transitions, 254 flow [2020-10-09 17:48:06,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-09 17:48:06,153 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:06,153 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] [2020-10-09 17:48:06,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-09 17:48:06,372 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:06,372 INFO L82 PathProgramCache]: Analyzing trace with hash 162939721, now seen corresponding path program 1 times [2020-10-09 17:48:06,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:06,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446845010] [2020-10-09 17:48:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:48:06,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-09 17:48:06,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:48:06,611 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-09 17:48:06,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:48:06,741 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-10-09 17:48:06,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:48:06,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:48:06,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:48:06,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:06,801 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-10-09 17:48:06,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:48:06,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:48:06,959 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 18 [2020-10-09 17:48:06,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:06,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:07,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:07,037 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-09 17:48:07,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:48:07,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-09 17:48:07,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-09 17:48:07,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,110 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-09 17:48:07,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,219 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-09 17:48:07,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,222 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 2, 1] term [2020-10-09 17:48:07,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,252 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,269 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-09 17:48:07,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,284 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-09 17:48:07,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,292 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 4, 2, 3, 2, 1] term [2020-10-09 17:48:07,293 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,309 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-09 17:48:07,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:48:07,376 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 6 conjuncts [2020-10-09 17:48:07,398 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:48:07,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:48:07,415 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-09 17:48:07,418 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 5 conjuncts [2020-10-09 17:48:07,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,427 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:48:07,432 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:48:07,443 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-09 17:48:07,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:07,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,461 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 17:48:07,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:48:07,494 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:48:07,496 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:48:07,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:07,534 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-09 17:48:07,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446845010] [2020-10-09 17:48:07,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:48:07,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 14 [2020-10-09 17:48:07,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161581443] [2020-10-09 17:48:07,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-09 17:48:07,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:48:07,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-09 17:48:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-10-09 17:48:09,228 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-09 17:48:09,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 79 transitions, 254 flow. Second operand 14 states. [2020-10-09 17:48:09,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:48:09,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-09 17:48:09,230 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:48:09,478 INFO L129 PetriNetUnfolder]: 66/299 cut-off events. [2020-10-09 17:48:09,478 INFO L130 PetriNetUnfolder]: For 244/251 co-relation queries the response was YES. [2020-10-09 17:48:09,481 INFO L80 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 299 events. 66/299 cut-off events. For 244/251 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1282 event pairs, 26 based on Foata normal form. 9/302 useless extension candidates. Maximal degree in co-relation 620. Up to 98 conditions per place. [2020-10-09 17:48:09,483 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 17 selfloop transitions, 7 changer transitions 13/99 dead transitions. [2020-10-09 17:48:09,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 99 transitions, 370 flow [2020-10-09 17:48:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-09 17:48:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-09 17:48:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 879 transitions. [2020-10-09 17:48:09,491 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8138888888888889 [2020-10-09 17:48:09,492 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 879 transitions. [2020-10-09 17:48:09,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 879 transitions. [2020-10-09 17:48:09,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:48:09,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 879 transitions. [2020-10-09 17:48:09,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-09 17:48:09,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-09 17:48:09,499 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-09 17:48:09,499 INFO L185 Difference]: Start difference. First operand has 101 places, 79 transitions, 254 flow. Second operand 12 states and 879 transitions. [2020-10-09 17:48:09,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 99 transitions, 370 flow [2020-10-09 17:48:09,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 99 transitions, 340 flow, removed 11 selfloop flow, removed 7 redundant places. [2020-10-09 17:48:09,506 INFO L241 Difference]: Finished difference. Result has 108 places, 83 transitions, 272 flow [2020-10-09 17:48:09,506 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=272, PETRI_PLACES=108, PETRI_TRANSITIONS=83} [2020-10-09 17:48:09,507 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 13 predicate places. [2020-10-09 17:48:09,507 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 83 transitions, 272 flow [2020-10-09 17:48:09,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-09 17:48:09,507 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:09,507 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-09 17:48:09,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-09 17:48:09,720 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:09,721 INFO L82 PathProgramCache]: Analyzing trace with hash -31204413, now seen corresponding path program 1 times [2020-10-09 17:48:09,722 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:09,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874915256] [2020-10-09 17:48:09,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:48:09,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-09 17:48:09,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:48:09,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:09,890 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-09 17:48:09,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:48:09,927 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-09 17:48:09,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874915256] [2020-10-09 17:48:09,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:48:09,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2020-10-09 17:48:09,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450467849] [2020-10-09 17:48:09,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 17:48:09,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:48:09,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 17:48:09,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-09 17:48:10,007 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-09 17:48:10,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 83 transitions, 272 flow. Second operand 10 states. [2020-10-09 17:48:10,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:48:10,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-09 17:48:10,009 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:48:10,157 INFO L129 PetriNetUnfolder]: 18/133 cut-off events. [2020-10-09 17:48:10,158 INFO L130 PetriNetUnfolder]: For 142/172 co-relation queries the response was YES. [2020-10-09 17:48:10,160 INFO L80 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 133 events. 18/133 cut-off events. For 142/172 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 295 event pairs, 0 based on Foata normal form. 19/151 useless extension candidates. Maximal degree in co-relation 311. Up to 30 conditions per place. [2020-10-09 17:48:10,161 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 6 selfloop transitions, 14 changer transitions 9/94 dead transitions. [2020-10-09 17:48:10,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 94 transitions, 406 flow [2020-10-09 17:48:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-09 17:48:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-09 17:48:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 878 transitions. [2020-10-09 17:48:10,165 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8868686868686869 [2020-10-09 17:48:10,166 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 878 transitions. [2020-10-09 17:48:10,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 878 transitions. [2020-10-09 17:48:10,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:48:10,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 878 transitions. [2020-10-09 17:48:10,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-09 17:48:10,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-09 17:48:10,171 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-09 17:48:10,171 INFO L185 Difference]: Start difference. First operand has 108 places, 83 transitions, 272 flow. Second operand 11 states and 878 transitions. [2020-10-09 17:48:10,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 94 transitions, 406 flow [2020-10-09 17:48:10,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 94 transitions, 361 flow, removed 18 selfloop flow, removed 11 redundant places. [2020-10-09 17:48:10,176 INFO L241 Difference]: Finished difference. Result has 106 places, 84 transitions, 297 flow [2020-10-09 17:48:10,176 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=297, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2020-10-09 17:48:10,176 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 11 predicate places. [2020-10-09 17:48:10,177 INFO L481 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 297 flow [2020-10-09 17:48:10,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 17:48:10,177 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:10,177 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:48:10,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-09 17:48:10,399 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:10,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1428093125, now seen corresponding path program 1 times [2020-10-09 17:48:10,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:10,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803404603] [2020-10-09 17:48:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-09 17:48:10,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-09 17:48:10,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:48:10,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:10,632 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-09 17:48:10,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:48:10,692 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-09 17:48:10,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803404603] [2020-10-09 17:48:10,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:48:10,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-09 17:48:10,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377078563] [2020-10-09 17:48:10,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-09 17:48:10,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:48:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-09 17:48:10,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-09 17:48:10,873 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 90 [2020-10-09 17:48:10,874 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 297 flow. Second operand 10 states. [2020-10-09 17:48:10,874 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:48:10,874 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 90 [2020-10-09 17:48:10,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:48:11,287 INFO L129 PetriNetUnfolder]: 46/419 cut-off events. [2020-10-09 17:48:11,288 INFO L130 PetriNetUnfolder]: For 678/692 co-relation queries the response was YES. [2020-10-09 17:48:11,290 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 419 events. 46/419 cut-off events. For 678/692 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2681 event pairs, 0 based on Foata normal form. 5/417 useless extension candidates. Maximal degree in co-relation 1024. Up to 103 conditions per place. [2020-10-09 17:48:11,291 INFO L132 encePairwiseOnDemand]: 81/90 looper letters, 6 selfloop transitions, 5 changer transitions 31/110 dead transitions. [2020-10-09 17:48:11,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 110 transitions, 423 flow [2020-10-09 17:48:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-09 17:48:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-09 17:48:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1813 transitions. [2020-10-09 17:48:11,298 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8758454106280193 [2020-10-09 17:48:11,298 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1813 transitions. [2020-10-09 17:48:11,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1813 transitions. [2020-10-09 17:48:11,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:48:11,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1813 transitions. [2020-10-09 17:48:11,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 24 states. [2020-10-09 17:48:11,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 24 states. [2020-10-09 17:48:11,308 INFO L81 ComplementDD]: Finished complementDD. Result 24 states. [2020-10-09 17:48:11,308 INFO L185 Difference]: Start difference. First operand has 106 places, 84 transitions, 297 flow. Second operand 23 states and 1813 transitions. [2020-10-09 17:48:11,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 110 transitions, 423 flow [2020-10-09 17:48:11,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 110 transitions, 377 flow, removed 16 selfloop flow, removed 8 redundant places. [2020-10-09 17:48:11,316 INFO L241 Difference]: Finished difference. Result has 138 places, 79 transitions, 282 flow [2020-10-09 17:48:11,316 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=282, PETRI_PLACES=138, PETRI_TRANSITIONS=79} [2020-10-09 17:48:11,317 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 43 predicate places. [2020-10-09 17:48:11,317 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 79 transitions, 282 flow [2020-10-09 17:48:11,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-09 17:48:11,317 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:11,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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:48:11,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-09 17:48:11,532 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1402347887, now seen corresponding path program 2 times [2020-10-09 17:48:11,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:11,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238435488] [2020-10-09 17:48:11,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:11,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-10-09 17:48:11,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-09 17:48:11,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-09 17:48:11,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-09 17:48:11,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-09 17:48:11,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-09 17:48:11,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:11,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:12,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:12,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:12,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:12,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:12,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:12,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-09 17:48:12,055 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-09 17:48:12,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-09 17:48:12,113 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 2, 1] term [2020-10-09 17:48:12,114 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,115 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-09 17:48:12,115 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,117 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 17:48:12,119 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-09 17:48:12,122 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:12,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-09 17:48:12,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 1] term [2020-10-09 17:48:12,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 2, 3, 2, 1] term [2020-10-09 17:48:12,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,182 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:12,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:12,263 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:48:12,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,264 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-10-09 17:48:12,265 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,265 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:48:12,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,266 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:12,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:12,309 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:48:12,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,311 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-10-09 17:48:12,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 4, 2, 3, 2, 1] term [2020-10-09 17:48:12,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-09 17:48:12,319 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:12,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-09 17:48:12,382 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-09 17:48:12,421 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 2, 1] term [2020-10-09 17:48:12,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-09 17:48:12,521 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-09 17:48:12,521 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238435488] [2020-10-09 17:48:12,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-09 17:48:12,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 11] imperfect sequences [] total 16 [2020-10-09 17:48:12,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176714350] [2020-10-09 17:48:12,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-09 17:48:12,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-10-09 17:48:12,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-09 17:48:12,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-10-09 17:48:13,631 INFO L506 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2020-10-09 17:48:13,632 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 79 transitions, 282 flow. Second operand 16 states. [2020-10-09 17:48:13,632 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-09 17:48:13,632 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2020-10-09 17:48:13,633 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-09 17:48:14,046 INFO L129 PetriNetUnfolder]: 31/255 cut-off events. [2020-10-09 17:48:14,047 INFO L130 PetriNetUnfolder]: For 246/248 co-relation queries the response was YES. [2020-10-09 17:48:14,048 INFO L80 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 255 events. 31/255 cut-off events. For 246/248 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1116 event pairs, 1 based on Foata normal form. 2/253 useless extension candidates. Maximal degree in co-relation 570. Up to 37 conditions per place. [2020-10-09 17:48:14,050 INFO L132 encePairwiseOnDemand]: 80/90 looper letters, 25 selfloop transitions, 6 changer transitions 15/108 dead transitions. [2020-10-09 17:48:14,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 108 transitions, 538 flow [2020-10-09 17:48:14,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-09 17:48:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-09 17:48:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1098 transitions. [2020-10-09 17:48:14,060 INFO L551 CegarLoopForPetriNet]: DFA transition density 0.8133333333333334 [2020-10-09 17:48:14,060 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1098 transitions. [2020-10-09 17:48:14,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1098 transitions. [2020-10-09 17:48:14,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-09 17:48:14,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1098 transitions. [2020-10-09 17:48:14,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-09 17:48:14,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-09 17:48:14,066 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-09 17:48:14,067 INFO L185 Difference]: Start difference. First operand has 138 places, 79 transitions, 282 flow. Second operand 15 states and 1098 transitions. [2020-10-09 17:48:14,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 108 transitions, 538 flow [2020-10-09 17:48:14,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 340 flow, removed 80 selfloop flow, removed 31 redundant places. [2020-10-09 17:48:14,073 INFO L241 Difference]: Finished difference. Result has 111 places, 82 transitions, 238 flow [2020-10-09 17:48:14,073 INFO L325 CegarLoopForPetriNet]: {PETRI_ALPHABET=90, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=238, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2020-10-09 17:48:14,074 INFO L341 CegarLoopForPetriNet]: 95 programPoint places, 16 predicate places. [2020-10-09 17:48:14,074 INFO L481 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 238 flow [2020-10-09 17:48:14,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-09 17:48:14,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-09 17:48:14,074 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-09 17:48:14,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-09 17:48:14,288 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-09 17:48:14,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-09 17:48:14,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1718784481, now seen corresponding path program 3 times [2020-10-09 17:48:14,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-10-09 17:48:14,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242863951] [2020-10-09 17:48:14,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-09 17:48:14,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2020-10-09 17:48:14,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2020-10-09 17:48:14,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:48:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-09 17:48:14,593 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-09 17:48:14,700 INFO L173 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2020-10-09 17:48:14,701 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-09 17:48:14,914 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-09 17:48:14,937 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-09 17:48:14,937 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,941 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,941 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,942 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-09 17:48:14,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,942 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-09 17:48:14,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,942 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-09 17:48:14,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,942 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-09 17:48:14,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,943 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-09 17:48:14,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,943 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-09 17:48:14,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,946 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,949 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-09 17:48:14,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,949 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-09 17:48:14,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,949 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-09 17:48:14,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,950 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-09 17:48:14,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,950 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-09 17:48:14,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,950 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-09 17:48:14,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:14,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-09 17:48:14,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-09 17:48:15,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.10 05:48:15 BasicIcfg [2020-10-09 17:48:15,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-09 17:48:15,059 INFO L168 Benchmark]: Toolchain (without parser) took 14370.78 ms. Allocated memory was 253.2 MB in the beginning and 532.2 MB in the end (delta: 278.9 MB). Free memory was 208.9 MB in the beginning and 293.1 MB in the end (delta: -84.2 MB). Peak memory consumption was 194.8 MB. Max. memory is 14.2 GB. [2020-10-09 17:48:15,060 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-09 17:48:15,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.63 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 208.9 MB in the beginning and 271.6 MB in the end (delta: -62.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 14.2 GB. [2020-10-09 17:48:15,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.93 ms. Allocated memory is still 320.9 MB. Free memory was 271.6 MB in the beginning and 268.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-09 17:48:15,063 INFO L168 Benchmark]: Boogie Preprocessor took 40.56 ms. Allocated memory is still 320.9 MB. Free memory was 268.2 MB in the beginning and 265.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-09 17:48:15,063 INFO L168 Benchmark]: RCFGBuilder took 2034.81 ms. Allocated memory was 320.9 MB in the beginning and 361.2 MB in the end (delta: 40.4 MB). Free memory was 265.7 MB in the beginning and 193.9 MB in the end (delta: 71.8 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. [2020-10-09 17:48:15,064 INFO L168 Benchmark]: TraceAbstraction took 11429.02 ms. Allocated memory was 361.2 MB in the beginning and 532.2 MB in the end (delta: 170.9 MB). Free memory was 193.9 MB in the beginning and 293.1 MB in the end (delta: -99.2 MB). Peak memory consumption was 71.7 MB. Max. memory is 14.2 GB. [2020-10-09 17:48:15,069 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.24 ms. Allocated memory is still 253.2 MB. Free memory was 231.3 MB in the beginning and 230.4 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 786.63 ms. Allocated memory was 253.2 MB in the beginning and 320.9 MB in the end (delta: 67.6 MB). Free memory was 208.9 MB in the beginning and 271.6 MB in the end (delta: -62.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.93 ms. Allocated memory is still 320.9 MB. Free memory was 271.6 MB in the beginning and 268.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 40.56 ms. Allocated memory is still 320.9 MB. Free memory was 268.2 MB in the beginning and 265.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2034.81 ms. Allocated memory was 320.9 MB in the beginning and 361.2 MB in the end (delta: 40.4 MB). Free memory was 265.7 MB in the beginning and 193.9 MB in the end (delta: 71.8 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11429.02 ms. Allocated memory was 361.2 MB in the beginning and 532.2 MB in the end (delta: 170.9 MB). Free memory was 193.9 MB in the beginning and 293.1 MB in the end (delta: -99.2 MB). Peak memory consumption was 71.7 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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_p2_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] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L802] 0 pthread_t t2186; VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L803] FCALL, FORK 0 pthread_create(&t2186, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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] [L728] 1 y$w_buff1 = y$w_buff0 [L729] 1 y$w_buff0 = 2 [L730] 1 y$w_buff1_used = y$w_buff0_used [L731] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L733] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L734] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L735] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L736] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L737] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 pthread_t t2187; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] FCALL, FORK 0 pthread_create(&t2187, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 pthread_t t2188; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L744] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L745] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L745] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L746] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L746] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L747] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L780] 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) [L780] 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) [L781] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L781] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L782] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L782] 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 [L783] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L784] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L784] 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 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 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) [L813] 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) [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L814] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L815] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L815] 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 [L816] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L816] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L817] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 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 [L820] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L821] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L822] 0 y$flush_delayed = weak$$choice2 [L823] 0 y$mem_tmp = y [L824] 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) [L824] 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) [L825] 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)) [L825] 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) [L825] 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)) [L825] 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)) [L826] 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)) [L826] 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) [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L826] 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) [L826] 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)) [L826] 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)) [L827] 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)) [L827] 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)) [L828] 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)) [L828] 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)) [L829] 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)) [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L829] 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)) [L829] 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)) [L830] 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)) [L830] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] EXPR 0 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$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L830] 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)) [L830] 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)) [L831] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L832] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L832] 0 y = y$flush_delayed ? y$mem_tmp : y [L833] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L7] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L7] 0 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 89 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: 11.1s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 48 SDtfs, 321 SDslu, 773 SDs, 0 SdLazy, 844 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 717 SyntacticMatches, 15 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 468 NumberOfCodeBlocks, 468 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 788 ConstructedInterpolants, 0 QuantifiedInterpolants, 185885 SizeOfPredicates, 64 NumberOfNonLiveVariables, 1188 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...