/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/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:57:43,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:57:43,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:57:43,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:57:43,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:57:43,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:57:43,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:57:43,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:57:43,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:57:43,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:57:43,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:57:43,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:57:43,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:57:43,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:57:43,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:57:43,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:57:43,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:57:43,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:57:43,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:57:43,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:57:43,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:57:43,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:57:43,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:57:43,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:57:43,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:57:43,805 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:57:43,805 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:57:43,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:57:43,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:57:43,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:57:43,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:57:43,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:57:43,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:57:43,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:57:43,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:57:43,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:57:43,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:57:43,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:57:43,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:57:43,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:57:43,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:57:43,813 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 04:57:43,835 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:57:43,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:57:43,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:57:43,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:57:43,837 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:57:43,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:57:43,837 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:57:43,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:57:43,838 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:57:43,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:57:43,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:57:43,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:57:43,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:57:43,838 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:57:43,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:57:43,839 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:57:43,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:57:43,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:57:43,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:57:43,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:57:43,840 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:57:43,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:57:43,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:57:43,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:57:43,841 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:57:43,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:57:43,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:57:43,841 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:57:43,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:57:44,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:57:44,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:57:44,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:57:44,135 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:57:44,136 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:57:44,136 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2020-10-16 04:57:44,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ee6b6b0/a6c18b28940644dfbe9f2d9b2b020227/FLAGa2f4b248e [2020-10-16 04:57:44,751 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:57:44,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_power.opt.i [2020-10-16 04:57:44,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ee6b6b0/a6c18b28940644dfbe9f2d9b2b020227/FLAGa2f4b248e [2020-10-16 04:57:45,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85ee6b6b0/a6c18b28940644dfbe9f2d9b2b020227 [2020-10-16 04:57:45,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:57:45,106 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:57:45,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:45,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:57:45,111 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:57:45,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230a6e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45, skipping insertion in model container [2020-10-16 04:57:45,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:57:45,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:57:45,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:45,607 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:57:45,670 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:45,767 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:57:45,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45 WrapperNode [2020-10-16 04:57:45,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:45,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:45,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:57:45,770 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:57:45,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,834 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:45,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:57:45,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:57:45,835 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:57:45,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (1/1) ... [2020-10-16 04:57:45,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:57:45,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:57:45,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:57:45,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:57:45,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (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-16 04:57:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:57:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:57:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:57:45,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:57:45,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:57:45,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:57:45,938 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:57:45,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:57:45,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:57:45,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:57:45,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:57:45,941 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 04:57:47,528 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:57:47,528 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:57:47,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:47 BoogieIcfgContainer [2020-10-16 04:57:47,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:57:47,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:57:47,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:57:47,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:57:47,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:57:45" (1/3) ... [2020-10-16 04:57:47,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a1311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:47, skipping insertion in model container [2020-10-16 04:57:47,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:45" (2/3) ... [2020-10-16 04:57:47,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297a1311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:47, skipping insertion in model container [2020-10-16 04:57:47,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:47" (3/3) ... [2020-10-16 04:57:47,539 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2020-10-16 04:57:47,550 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:57:47,557 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:57:47,558 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:57:47,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,585 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,586 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,589 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,590 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,591 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,592 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,593 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,595 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,595 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,596 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,596 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,597 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,597 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,598 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,599 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,605 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,612 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,612 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,613 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:47,632 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 04:57:47,652 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:57:47,653 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:57:47,653 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:57:47,653 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:57:47,653 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:57:47,653 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:57:47,653 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:57:47,654 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:57:47,666 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 04:57:47,705 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 04:57:47,706 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:47,710 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 04:57:47,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 78 transitions, 166 flow [2020-10-16 04:57:47,717 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:47,719 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:57:47,722 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:47,724 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:47,725 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 81 places, 76 transitions, 158 flow [2020-10-16 04:57:47,745 INFO L129 PetriNetUnfolder]: 2/76 cut-off events. [2020-10-16 04:57:47,745 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:47,746 INFO L80 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 76 events. 2/76 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2020-10-16 04:57:47,747 INFO L117 LiptonReduction]: Number of co-enabled transitions 936 [2020-10-16 04:57:47,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:47,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:47,999 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:48,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:48,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:48,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,418 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:57:48,522 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:57:48,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:48,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:48,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:48,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:48,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:48,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:48,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:57:48,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:48,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:48,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:48,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:48,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:48,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:49,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:57:49,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:49,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:49,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:49,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:49,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:49,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:49,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:49,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:49,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:49,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:49,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:49,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:49,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:49,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:49,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:49,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:49,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:49,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:49,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:50,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:50,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:50,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:50,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:50,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:50,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:50,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:50,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:50,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:50,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:50,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:50,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:50,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:50,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:50,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:50,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:50,257 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:50,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:50,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:50,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:50,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:50,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:50,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:50,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:50,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:50,978 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 04:57:51,063 INFO L132 LiptonReduction]: Checked pairs total: 2379 [2020-10-16 04:57:51,064 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 04:57:51,066 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3349 [2020-10-16 04:57:51,073 INFO L129 PetriNetUnfolder]: 0/10 cut-off events. [2020-10-16 04:57:51,073 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:51,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:51,075 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:57:51,075 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash 781438270, now seen corresponding path program 1 times [2020-10-16 04:57:51,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:51,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970528098] [2020-10-16 04:57:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:51,302 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-16 04:57:51,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970528098] [2020-10-16 04:57:51,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:51,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:57:51,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483714364] [2020-10-16 04:57:51,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:57:51,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:51,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:57:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:57:51,336 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 144 [2020-10-16 04:57:51,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 04:57:51,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:51,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 144 [2020-10-16 04:57:51,342 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:51,394 INFO L129 PetriNetUnfolder]: 9/47 cut-off events. [2020-10-16 04:57:51,394 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:51,395 INFO L80 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 47 events. 9/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 130 event pairs, 1 based on Foata normal form. 6/51 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2020-10-16 04:57:51,396 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 5 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2020-10-16 04:57:51,396 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 60 flow [2020-10-16 04:57:51,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:57:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:57:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2020-10-16 04:57:51,413 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8703703703703703 [2020-10-16 04:57:51,414 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2020-10-16 04:57:51,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2020-10-16 04:57:51,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:51,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2020-10-16 04:57:51,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:57:51,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:57:51,430 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:57:51,432 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 376 transitions. [2020-10-16 04:57:51,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 60 flow [2020-10-16 04:57:51,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:51,438 INFO L241 Difference]: Finished difference. Result has 25 places, 18 transitions, 44 flow [2020-10-16 04:57:51,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2020-10-16 04:57:51,441 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2020-10-16 04:57:51,442 INFO L481 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2020-10-16 04:57:51,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:57:51,442 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:51,442 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:51,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:57:51,443 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1105080138, now seen corresponding path program 1 times [2020-10-16 04:57:51,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:51,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058803382] [2020-10-16 04:57:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:51,551 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-16 04:57:51,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058803382] [2020-10-16 04:57:51,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:51,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:51,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20706196] [2020-10-16 04:57:51,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:51,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:51,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:51,557 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2020-10-16 04:57:51,558 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand 4 states. [2020-10-16 04:57:51,558 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:51,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2020-10-16 04:57:51,559 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:51,607 INFO L129 PetriNetUnfolder]: 1/29 cut-off events. [2020-10-16 04:57:51,608 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:51,608 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 1/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 39. Up to 5 conditions per place. [2020-10-16 04:57:51,609 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 2 selfloop transitions, 2 changer transitions 5/22 dead transitions. [2020-10-16 04:57:51,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 22 transitions, 70 flow [2020-10-16 04:57:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2020-10-16 04:57:51,612 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2020-10-16 04:57:51,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2020-10-16 04:57:51,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2020-10-16 04:57:51,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:51,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2020-10-16 04:57:51,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:51,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:51,618 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:51,618 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 5 states and 591 transitions. [2020-10-16 04:57:51,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 22 transitions, 70 flow [2020-10-16 04:57:51,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:51,619 INFO L241 Difference]: Finished difference. Result has 30 places, 17 transitions, 50 flow [2020-10-16 04:57:51,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2020-10-16 04:57:51,620 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2020-10-16 04:57:51,620 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 50 flow [2020-10-16 04:57:51,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:51,620 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:51,621 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:51,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:57:51,621 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash 485831526, now seen corresponding path program 1 times [2020-10-16 04:57:51,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:51,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352908020] [2020-10-16 04:57:51,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:51,686 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-16 04:57:51,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352908020] [2020-10-16 04:57:51,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:51,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:57:51,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679676492] [2020-10-16 04:57:51,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:51,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:51,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:51,690 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2020-10-16 04:57:51,690 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 50 flow. Second operand 4 states. [2020-10-16 04:57:51,690 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:51,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2020-10-16 04:57:51,691 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:51,737 INFO L129 PetriNetUnfolder]: 7/50 cut-off events. [2020-10-16 04:57:51,737 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2020-10-16 04:57:51,738 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 50 events. 7/50 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 154 event pairs, 0 based on Foata normal form. 6/55 useless extension candidates. Maximal degree in co-relation 93. Up to 14 conditions per place. [2020-10-16 04:57:51,738 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 7 selfloop transitions, 2 changer transitions 5/24 dead transitions. [2020-10-16 04:57:51,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 24 transitions, 97 flow [2020-10-16 04:57:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2020-10-16 04:57:51,741 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8138888888888889 [2020-10-16 04:57:51,741 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2020-10-16 04:57:51,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2020-10-16 04:57:51,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:51,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2020-10-16 04:57:51,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:51,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:51,745 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:51,745 INFO L185 Difference]: Start difference. First operand has 30 places, 17 transitions, 50 flow. Second operand 5 states and 586 transitions. [2020-10-16 04:57:51,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 24 transitions, 97 flow [2020-10-16 04:57:51,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 87 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:51,746 INFO L241 Difference]: Finished difference. Result has 30 places, 17 transitions, 54 flow [2020-10-16 04:57:51,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2020-10-16 04:57:51,747 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2020-10-16 04:57:51,747 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 54 flow [2020-10-16 04:57:51,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:51,747 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:51,747 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:51,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:57:51,748 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash -2119129117, now seen corresponding path program 1 times [2020-10-16 04:57:51,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:51,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903063112] [2020-10-16 04:57:51,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:51,846 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-16 04:57:51,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903063112] [2020-10-16 04:57:51,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:51,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:51,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462110467] [2020-10-16 04:57:51,848 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:51,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:51,850 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2020-10-16 04:57:51,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 54 flow. Second operand 4 states. [2020-10-16 04:57:51,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:51,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2020-10-16 04:57:51,851 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:51,873 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2020-10-16 04:57:51,873 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2020-10-16 04:57:51,874 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 21 events. 0/21 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 2/23 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 04:57:51,874 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 2 selfloop transitions, 2 changer transitions 2/19 dead transitions. [2020-10-16 04:57:51,874 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 19 transitions, 74 flow [2020-10-16 04:57:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 588 transitions. [2020-10-16 04:57:51,877 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8166666666666667 [2020-10-16 04:57:51,877 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 588 transitions. [2020-10-16 04:57:51,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 588 transitions. [2020-10-16 04:57:51,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:51,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 588 transitions. [2020-10-16 04:57:51,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:51,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:51,881 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:51,881 INFO L185 Difference]: Start difference. First operand has 30 places, 17 transitions, 54 flow. Second operand 5 states and 588 transitions. [2020-10-16 04:57:51,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 19 transitions, 74 flow [2020-10-16 04:57:51,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 19 transitions, 66 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:51,883 INFO L241 Difference]: Finished difference. Result has 31 places, 17 transitions, 58 flow [2020-10-16 04:57:51,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2020-10-16 04:57:51,883 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2020-10-16 04:57:51,884 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 58 flow [2020-10-16 04:57:51,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:51,884 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:51,884 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:51,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:57:51,884 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:51,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:51,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1268553490, now seen corresponding path program 1 times [2020-10-16 04:57:51,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:51,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76761138] [2020-10-16 04:57:51,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:51,946 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-16 04:57:51,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76761138] [2020-10-16 04:57:51,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:51,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:51,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994252990] [2020-10-16 04:57:51,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:57:51,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:51,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:57:51,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:57:51,949 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2020-10-16 04:57:51,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 58 flow. Second operand 5 states. [2020-10-16 04:57:51,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:51,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2020-10-16 04:57:51,950 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:51,989 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2020-10-16 04:57:51,989 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2020-10-16 04:57:51,989 INFO L80 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 28 events. 1/28 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 62 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 58. Up to 6 conditions per place. [2020-10-16 04:57:51,990 INFO L132 encePairwiseOnDemand]: 140/144 looper letters, 6 selfloop transitions, 1 changer transitions 3/20 dead transitions. [2020-10-16 04:57:51,990 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 20 transitions, 94 flow [2020-10-16 04:57:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2020-10-16 04:57:51,992 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7652777777777777 [2020-10-16 04:57:51,992 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2020-10-16 04:57:51,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2020-10-16 04:57:51,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:51,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2020-10-16 04:57:51,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:51,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:51,995 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:51,996 INFO L185 Difference]: Start difference. First operand has 31 places, 17 transitions, 58 flow. Second operand 5 states and 551 transitions. [2020-10-16 04:57:51,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 20 transitions, 94 flow [2020-10-16 04:57:51,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 20 transitions, 77 flow, removed 4 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:51,997 INFO L241 Difference]: Finished difference. Result has 31 places, 17 transitions, 55 flow [2020-10-16 04:57:51,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=55, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2020-10-16 04:57:51,998 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2020-10-16 04:57:51,998 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 17 transitions, 55 flow [2020-10-16 04:57:51,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:57:51,998 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:51,998 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:51,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:57:51,998 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:51,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:51,999 INFO L82 PathProgramCache]: Analyzing trace with hash 333633886, now seen corresponding path program 2 times [2020-10-16 04:57:51,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:51,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329008323] [2020-10-16 04:57:52,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:52,046 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-16 04:57:52,046 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329008323] [2020-10-16 04:57:52,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:52,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:57:52,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934886023] [2020-10-16 04:57:52,047 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:52,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:52,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:52,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:52,049 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2020-10-16 04:57:52,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 17 transitions, 55 flow. Second operand 4 states. [2020-10-16 04:57:52,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:52,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2020-10-16 04:57:52,050 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:52,077 INFO L129 PetriNetUnfolder]: 6/42 cut-off events. [2020-10-16 04:57:52,077 INFO L130 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2020-10-16 04:57:52,077 INFO L80 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 42 events. 6/42 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 5/44 useless extension candidates. Maximal degree in co-relation 84. Up to 13 conditions per place. [2020-10-16 04:57:52,078 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 5 selfloop transitions, 4 changer transitions 1/22 dead transitions. [2020-10-16 04:57:52,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 85 flow [2020-10-16 04:57:52,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:57:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:57:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2020-10-16 04:57:52,080 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8125 [2020-10-16 04:57:52,080 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2020-10-16 04:57:52,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2020-10-16 04:57:52,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:52,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2020-10-16 04:57:52,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:57:52,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:57:52,083 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:57:52,083 INFO L185 Difference]: Start difference. First operand has 31 places, 17 transitions, 55 flow. Second operand 4 states and 468 transitions. [2020-10-16 04:57:52,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 85 flow [2020-10-16 04:57:52,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 22 transitions, 80 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 04:57:52,085 INFO L241 Difference]: Finished difference. Result has 31 places, 19 transitions, 76 flow [2020-10-16 04:57:52,085 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2020-10-16 04:57:52,086 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2020-10-16 04:57:52,086 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 76 flow [2020-10-16 04:57:52,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:52,086 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:52,086 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:52,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:57:52,086 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:52,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash -596400601, now seen corresponding path program 1 times [2020-10-16 04:57:52,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:52,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406236666] [2020-10-16 04:57:52,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:52,163 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-16 04:57:52,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406236666] [2020-10-16 04:57:52,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:52,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:52,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621679533] [2020-10-16 04:57:52,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:57:52,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:57:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:57:52,167 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 144 [2020-10-16 04:57:52,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 76 flow. Second operand 5 states. [2020-10-16 04:57:52,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:52,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 144 [2020-10-16 04:57:52,167 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:52,211 INFO L129 PetriNetUnfolder]: 2/27 cut-off events. [2020-10-16 04:57:52,212 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2020-10-16 04:57:52,212 INFO L80 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 27 events. 2/27 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 4/31 useless extension candidates. Maximal degree in co-relation 68. Up to 9 conditions per place. [2020-10-16 04:57:52,212 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 1 selfloop transitions, 6 changer transitions 1/20 dead transitions. [2020-10-16 04:57:52,212 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 20 transitions, 97 flow [2020-10-16 04:57:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2020-10-16 04:57:52,215 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2020-10-16 04:57:52,215 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2020-10-16 04:57:52,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2020-10-16 04:57:52,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:52,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2020-10-16 04:57:52,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:52,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:52,219 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:52,219 INFO L185 Difference]: Start difference. First operand has 31 places, 19 transitions, 76 flow. Second operand 5 states and 580 transitions. [2020-10-16 04:57:52,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 20 transitions, 97 flow [2020-10-16 04:57:52,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 20 transitions, 77 flow, removed 3 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:52,220 INFO L241 Difference]: Finished difference. Result has 32 places, 19 transitions, 82 flow [2020-10-16 04:57:52,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2020-10-16 04:57:52,221 INFO L342 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2020-10-16 04:57:52,221 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 82 flow [2020-10-16 04:57:52,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:57:52,221 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:52,221 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:52,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:57:52,222 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:52,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1949187931, now seen corresponding path program 1 times [2020-10-16 04:57:52,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:52,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969909404] [2020-10-16 04:57:52,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:57:52,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:57:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:57:52,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:57:52,385 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:57:52,385 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:57:52,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:57:52,403 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-16 04:57:52,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,405 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-16 04:57:52,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,405 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-16 04:57:52,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,406 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-16 04:57:52,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,406 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-16 04:57:52,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,406 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-16 04:57:52,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,407 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-16 04:57:52,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,407 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-16 04:57:52,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,408 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-16 04:57:52,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,408 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-16 04:57:52,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,409 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-16 04:57:52,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,409 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-16 04:57:52,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,409 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-16 04:57:52,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,410 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-16 04:57:52,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,410 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-16 04:57:52,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,411 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-16 04:57:52,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,411 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-16 04:57:52,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,411 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-16 04:57:52,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,412 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-16 04:57:52,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,412 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-16 04:57:52,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:57:52,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:57:52 BasicIcfg [2020-10-16 04:57:52,464 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:57:52,466 INFO L168 Benchmark]: Toolchain (without parser) took 7359.96 ms. Allocated memory was 250.1 MB in the beginning and 506.5 MB in the end (delta: 256.4 MB). Free memory was 206.1 MB in the beginning and 453.0 MB in the end (delta: -246.9 MB). Peak memory consumption was 228.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:52,466 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:57:52,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 661.70 ms. Allocated memory was 250.1 MB in the beginning and 309.3 MB in the end (delta: 59.2 MB). Free memory was 206.1 MB in the beginning and 257.6 MB in the end (delta: -51.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:52,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 309.3 MB. Free memory was 257.6 MB in the beginning and 255.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:52,469 INFO L168 Benchmark]: Boogie Preprocessor took 32.67 ms. Allocated memory is still 309.3 MB. Free memory was 255.1 MB in the beginning and 252.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:52,470 INFO L168 Benchmark]: RCFGBuilder took 1662.48 ms. Allocated memory was 309.3 MB in the beginning and 356.5 MB in the end (delta: 47.2 MB). Free memory was 252.6 MB in the beginning and 238.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 97.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:52,471 INFO L168 Benchmark]: TraceAbstraction took 4932.36 ms. Allocated memory was 356.5 MB in the beginning and 506.5 MB in the end (delta: 149.9 MB). Free memory was 238.9 MB in the beginning and 453.0 MB in the end (delta: -214.1 MB). Peak memory consumption was 155.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:57:52,475 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.37 ms. Allocated memory is still 250.1 MB. Free memory is still 226.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 661.70 ms. Allocated memory was 250.1 MB in the beginning and 309.3 MB in the end (delta: 59.2 MB). Free memory was 206.1 MB in the beginning and 257.6 MB in the end (delta: -51.6 MB). Peak memory consumption was 26.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 65.42 ms. Allocated memory is still 309.3 MB. Free memory was 257.6 MB in the beginning and 255.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 32.67 ms. Allocated memory is still 309.3 MB. Free memory was 255.1 MB in the beginning and 252.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1662.48 ms. Allocated memory was 309.3 MB in the beginning and 356.5 MB in the end (delta: 47.2 MB). Free memory was 252.6 MB in the beginning and 238.9 MB in the end (delta: 13.7 MB). Peak memory consumption was 97.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 4932.36 ms. Allocated memory was 356.5 MB in the beginning and 506.5 MB in the end (delta: 149.9 MB). Free memory was 238.9 MB in the beginning and 453.0 MB in the end (delta: -214.1 MB). Peak memory consumption was 155.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 597 VarBasedMoverChecksPositive, 54 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 87 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 81 PlacesBefore, 26 PlacesAfterwards, 76 TransitionsBefore, 20 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 66 TotalNumberOfCompositions, 2379 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p1_EAX = 0; [L704] 0 int __unbuffered_p1_EBX = 0; [L705] 0 _Bool main$tmp_guard0; [L706] 0 _Bool main$tmp_guard1; [L708] 0 int x = 0; [L709] 0 _Bool x$flush_delayed; [L710] 0 int x$mem_tmp; [L711] 0 _Bool x$r_buff0_thd0; [L712] 0 _Bool x$r_buff0_thd1; [L713] 0 _Bool x$r_buff0_thd2; [L714] 0 _Bool x$r_buff1_thd0; [L715] 0 _Bool x$r_buff1_thd1; [L716] 0 _Bool x$r_buff1_thd2; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1635; [L803] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L804] 0 pthread_t t1636; [L805] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff1 = x$w_buff0 [L761] 2 x$w_buff0 = 1 [L762] 2 x$w_buff1_used = x$w_buff0_used [L763] 2 x$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L771] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L744] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L745] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x [L747] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L747] 1 x = x$flush_delayed ? x$mem_tmp : x [L748] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L814] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L815] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L818] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 77 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: 4.7s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 26 SDtfs, 19 SDslu, 26 SDs, 0 SdLazy, 73 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 2066 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...