/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:43:12,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:43:12,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:43:12,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:43:12,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:43:12,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:43:12,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:43:12,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:43:12,640 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:43:12,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:43:12,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:43:12,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:43:12,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:43:12,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:43:12,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:43:12,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:43:12,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:43:12,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:43:12,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:43:12,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:43:12,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:43:12,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:43:12,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:43:12,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:43:12,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:43:12,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:43:12,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:43:12,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:43:12,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:43:12,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:43:12,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:43:12,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:43:12,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:43:12,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:43:12,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:43:12,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:43:12,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:43:12,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:43:12,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:43:12,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:43:12,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:43:12,688 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-RepeatedVariableLbe.epf [2021-03-25 04:43:12,732 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:43:12,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:43:12,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:43:12,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:43:12,734 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:43:12,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:43:12,734 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:43:12,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:43:12,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:43:12,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:43:12,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:43:12,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:43:12,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:43:12,735 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:43:12,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:43:12,735 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:43:12,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:43:12,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:43:12,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:43:12,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:43:12,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:43:12,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:43:12,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:43:12,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:43:12,737 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:43:12,737 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:43:12,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:43:12,737 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:43:12,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:43:12,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:43:12,737 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 04:43:13,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:43:13,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:43:13,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:43:13,055 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:43:13,057 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:43:13,059 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-03-25 04:43:13,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da95fb4b2/33ef87bdf6fc4e77b78c7ac76cdb4fa6/FLAG4b60a5d0f [2021-03-25 04:43:13,686 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:43:13,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-03-25 04:43:13,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da95fb4b2/33ef87bdf6fc4e77b78c7ac76cdb4fa6/FLAG4b60a5d0f [2021-03-25 04:43:14,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da95fb4b2/33ef87bdf6fc4e77b78c7ac76cdb4fa6 [2021-03-25 04:43:14,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:43:14,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:43:14,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:43:14,130 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:43:14,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:43:14,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bbcbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14, skipping insertion in model container [2021-03-25 04:43:14,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:43:14,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:43:14,344 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2021-03-25 04:43:14,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:43:14,566 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:43:14,576 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2021-03-25 04:43:14,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:43:14,721 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:43:14,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14 WrapperNode [2021-03-25 04:43:14,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:43:14,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:43:14,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:43:14,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:43:14,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,761 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:43:14,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:43:14,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:43:14,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:43:14,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,844 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... [2021-03-25 04:43:14,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:43:14,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:43:14,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:43:14,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:43:14,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:43:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:43:14,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:43:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:43:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:43:14,906 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:43:14,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:43:14,907 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:43:14,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:43:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:43:14,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:43:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:43:14,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:43:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:43:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:43:14,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:43:14,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:43:14,910 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 04:43:16,675 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:43:16,675 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:43:16,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:43:16 BoogieIcfgContainer [2021-03-25 04:43:16,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:43:16,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:43:16,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:43:16,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:43:16,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:43:14" (1/3) ... [2021-03-25 04:43:16,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ce4f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:43:16, skipping insertion in model container [2021-03-25 04:43:16,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:43:14" (2/3) ... [2021-03-25 04:43:16,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ce4f99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:43:16, skipping insertion in model container [2021-03-25 04:43:16,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:43:16" (3/3) ... [2021-03-25 04:43:16,683 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2021-03-25 04:43:16,692 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:43:16,696 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:43:16,697 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:43:16,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,779 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,779 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,779 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,780 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,781 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,782 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,783 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,783 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,783 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,784 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,785 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,785 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,785 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,786 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,788 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,788 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,795 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,798 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,798 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,799 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,799 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,799 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,799 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,799 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,799 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,799 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,800 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,800 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,800 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,800 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,800 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,800 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,825 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,828 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,829 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,830 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,830 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,831 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,832 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,832 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,834 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,834 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,834 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:43:16,837 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:43:16,854 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:43:16,880 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:43:16,880 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:43:16,880 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:43:16,880 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:43:16,880 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:43:16,881 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:43:16,881 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:43:16,881 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:43:16,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 04:43:16,950 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 04:43:16,950 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:16,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:43:16,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-25 04:43:16,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-25 04:43:16,967 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:16,974 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 04:43:16,977 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-25 04:43:16,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-25 04:43:17,013 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-25 04:43:17,013 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:17,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:43:17,018 INFO L142 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-25 04:43:18,885 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-25 04:43:19,158 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:43:20,546 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 04:43:21,120 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:43:21,432 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:43:21,827 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 04:43:21,953 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:43:22,860 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:43:23,133 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:43:23,690 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:43:24,258 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:43:24,694 INFO L154 LiptonReduction]: Checked pairs total: 5149 [2021-03-25 04:43:24,695 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-25 04:43:24,696 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7730 [2021-03-25 04:43:24,703 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-25 04:43:24,703 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:24,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:24,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:24,704 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:24,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:24,708 INFO L82 PathProgramCache]: Analyzing trace with hash 557082090, now seen corresponding path program 1 times [2021-03-25 04:43:24,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:24,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549390954] [2021-03-25 04:43:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:24,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:24,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:24,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:24,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:24,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549390954] [2021-03-25 04:43:24,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:24,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:43:24,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530203647] [2021-03-25 04:43:24,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:43:24,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:24,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:43:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:43:24,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 197 [2021-03-25 04:43:24,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:24,908 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:24,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 197 [2021-03-25 04:43:24,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:25,026 INFO L129 PetriNetUnfolder]: 185/411 cut-off events. [2021-03-25 04:43:25,026 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:25,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 411 events. 185/411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2203 event pairs, 123 based on Foata normal form. 20/392 useless extension candidates. Maximal degree in co-relation 685. Up to 209 conditions per place. [2021-03-25 04:43:25,031 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 11 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2021-03-25 04:43:25,031 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 140 flow [2021-03-25 04:43:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:43:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:43:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-25 04:43:25,043 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9086294416243654 [2021-03-25 04:43:25,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-25 04:43:25,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-25 04:43:25,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:25,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-25 04:43:25,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:25,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:25,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:25,060 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 537 transitions. [2021-03-25 04:43:25,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 140 flow [2021-03-25 04:43:25,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:43:25,064 INFO L241 Difference]: Finished difference. Result has 54 places, 40 transitions, 92 flow [2021-03-25 04:43:25,066 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2021-03-25 04:43:25,067 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 04:43:25,067 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:25,067 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 92 flow [2021-03-25 04:43:25,068 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 40 transitions, 92 flow [2021-03-25 04:43:25,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2021-03-25 04:43:25,074 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-25 04:43:25,075 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:25,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:43:25,077 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-25 04:43:25,379 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:43:25,634 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:43:26,248 WARN L205 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 04:43:26,825 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 04:43:27,048 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:43:27,180 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 04:43:28,065 INFO L154 LiptonReduction]: Checked pairs total: 2227 [2021-03-25 04:43:28,065 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 04:43:28,065 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2998 [2021-03-25 04:43:28,067 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 04:43:28,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:28,067 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:28,068 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:28,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:43:28,068 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:28,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1270069717, now seen corresponding path program 1 times [2021-03-25 04:43:28,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:28,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628634089] [2021-03-25 04:43:28,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:28,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:28,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:28,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:28,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:28,188 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:43:28,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:43:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:28,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628634089] [2021-03-25 04:43:28,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:28,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:28,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132689650] [2021-03-25 04:43:28,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:28,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:28,194 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 208 [2021-03-25 04:43:28,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:28,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:28,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 208 [2021-03-25 04:43:28,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:28,213 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 04:43:28,213 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:28,214 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:43:28,214 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-25 04:43:28,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 76 flow [2021-03-25 04:43:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:43:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:43:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-25 04:43:28,219 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9006410256410257 [2021-03-25 04:43:28,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-25 04:43:28,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-25 04:43:28,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:28,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-25 04:43:28,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:28,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:28,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:28,223 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 562 transitions. [2021-03-25 04:43:28,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 76 flow [2021-03-25 04:43:28,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:43:28,224 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 74 flow [2021-03-25 04:43:28,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-25 04:43:28,225 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2021-03-25 04:43:28,225 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:28,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 74 flow [2021-03-25 04:43:28,225 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 74 flow [2021-03-25 04:43:28,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 74 flow [2021-03-25 04:43:28,229 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 04:43:28,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:43:28,229 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 29 events. 0/29 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/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 04:43:28,230 INFO L142 LiptonReduction]: Number of co-enabled transitions 410 [2021-03-25 04:43:28,594 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:43:28,732 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:43:29,043 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-25 04:43:29,176 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-25 04:43:29,179 INFO L154 LiptonReduction]: Checked pairs total: 964 [2021-03-25 04:43:29,179 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:43:29,179 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 954 [2021-03-25 04:43:29,180 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-03-25 04:43:29,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:29,181 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:29,181 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:43:29,181 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:29,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:29,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1062863582, now seen corresponding path program 1 times [2021-03-25 04:43:29,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:29,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710526552] [2021-03-25 04:43:29,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:29,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:29,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:43:29,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:29,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710526552] [2021-03-25 04:43:29,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:29,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:29,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787385530] [2021-03-25 04:43:29,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:29,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:29,353 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-03-25 04:43:29,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:29,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-03-25 04:43:29,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:29,436 INFO L129 PetriNetUnfolder]: 205/371 cut-off events. [2021-03-25 04:43:29,437 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-25 04:43:29,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 727 conditions, 371 events. 205/371 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1818 event pairs, 167 based on Foata normal form. 4/353 useless extension candidates. Maximal degree in co-relation 717. Up to 297 conditions per place. [2021-03-25 04:43:29,440 INFO L132 encePairwiseOnDemand]: 206/210 looper letters, 11 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-25 04:43:29,440 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 108 flow [2021-03-25 04:43:29,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:43:29,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:43:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2021-03-25 04:43:29,442 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8238095238095238 [2021-03-25 04:43:29,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2021-03-25 04:43:29,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2021-03-25 04:43:29,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:29,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2021-03-25 04:43:29,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,446 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 519 transitions. [2021-03-25 04:43:29,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 108 flow [2021-03-25 04:43:29,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:43:29,448 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 85 flow [2021-03-25 04:43:29,448 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-03-25 04:43:29,448 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -18 predicate places. [2021-03-25 04:43:29,448 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:29,448 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 85 flow [2021-03-25 04:43:29,449 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 85 flow [2021-03-25 04:43:29,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 85 flow [2021-03-25 04:43:29,453 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-25 04:43:29,453 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 04:43:29,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 37 events. 3/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 56. Up to 10 conditions per place. [2021-03-25 04:43:29,454 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-25 04:43:29,456 INFO L154 LiptonReduction]: Checked pairs total: 430 [2021-03-25 04:43:29,456 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:29,456 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 04:43:29,457 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 85 flow [2021-03-25 04:43:29,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,458 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:29,458 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:29,458 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:43:29,458 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash 360573107, now seen corresponding path program 1 times [2021-03-25 04:43:29,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:29,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654369643] [2021-03-25 04:43:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:29,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:43:29,604 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-25 04:43:29,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 04:43:29,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:43:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:29,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654369643] [2021-03-25 04:43:29,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:29,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:29,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318866887] [2021-03-25 04:43:29,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:29,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:29,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:29,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:29,636 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 210 [2021-03-25 04:43:29,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:29,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 210 [2021-03-25 04:43:29,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:29,777 INFO L129 PetriNetUnfolder]: 215/383 cut-off events. [2021-03-25 04:43:29,777 INFO L130 PetriNetUnfolder]: For 101/103 co-relation queries the response was YES. [2021-03-25 04:43:29,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 383 events. 215/383 cut-off events. For 101/103 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1852 event pairs, 146 based on Foata normal form. 4/366 useless extension candidates. Maximal degree in co-relation 854. Up to 317 conditions per place. [2021-03-25 04:43:29,780 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 12 selfloop transitions, 10 changer transitions 0/40 dead transitions. [2021-03-25 04:43:29,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 159 flow [2021-03-25 04:43:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2021-03-25 04:43:29,782 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.805952380952381 [2021-03-25 04:43:29,783 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2021-03-25 04:43:29,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2021-03-25 04:43:29,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:29,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2021-03-25 04:43:29,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,787 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,788 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 85 flow. Second operand 4 states and 677 transitions. [2021-03-25 04:43:29,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 159 flow [2021-03-25 04:43:29,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 40 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:43:29,789 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 151 flow [2021-03-25 04:43:29,790 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-03-25 04:43:29,790 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -14 predicate places. [2021-03-25 04:43:29,790 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:29,790 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 151 flow [2021-03-25 04:43:29,790 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 151 flow [2021-03-25 04:43:29,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 151 flow [2021-03-25 04:43:29,842 INFO L129 PetriNetUnfolder]: 45/156 cut-off events. [2021-03-25 04:43:29,842 INFO L130 PetriNetUnfolder]: For 82/85 co-relation queries the response was YES. [2021-03-25 04:43:29,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 156 events. 45/156 cut-off events. For 82/85 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 823 event pairs, 24 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 329. Up to 63 conditions per place. [2021-03-25 04:43:29,845 INFO L142 LiptonReduction]: Number of co-enabled transitions 558 [2021-03-25 04:43:29,852 INFO L154 LiptonReduction]: Checked pairs total: 371 [2021-03-25 04:43:29,852 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:29,852 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 62 [2021-03-25 04:43:29,853 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 151 flow [2021-03-25 04:43:29,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,854 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:29,854 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:29,854 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:43:29,855 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash 327063347, now seen corresponding path program 2 times [2021-03-25 04:43:29,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:29,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980663007] [2021-03-25 04:43:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:29,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:43:29,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:29,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:29,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:43:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:29,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980663007] [2021-03-25 04:43:29,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:29,970 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:29,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031698507] [2021-03-25 04:43:29,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:29,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:29,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:29,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:29,974 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 210 [2021-03-25 04:43:29,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:29,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:29,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 210 [2021-03-25 04:43:29,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:30,108 INFO L129 PetriNetUnfolder]: 224/407 cut-off events. [2021-03-25 04:43:30,108 INFO L130 PetriNetUnfolder]: For 376/499 co-relation queries the response was YES. [2021-03-25 04:43:30,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 407 events. 224/407 cut-off events. For 376/499 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1998 event pairs, 141 based on Foata normal form. 18/408 useless extension candidates. Maximal degree in co-relation 1179. Up to 312 conditions per place. [2021-03-25 04:43:30,113 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 19 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2021-03-25 04:43:30,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 260 flow [2021-03-25 04:43:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:30,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:30,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 680 transitions. [2021-03-25 04:43:30,115 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2021-03-25 04:43:30,115 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 680 transitions. [2021-03-25 04:43:30,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 680 transitions. [2021-03-25 04:43:30,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:30,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 680 transitions. [2021-03-25 04:43:30,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,120 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,120 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 151 flow. Second operand 4 states and 680 transitions. [2021-03-25 04:43:30,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 260 flow [2021-03-25 04:43:30,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 49 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:43:30,123 INFO L241 Difference]: Finished difference. Result has 48 places, 45 transitions, 231 flow [2021-03-25 04:43:30,124 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2021-03-25 04:43:30,124 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -10 predicate places. [2021-03-25 04:43:30,124 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:30,124 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 231 flow [2021-03-25 04:43:30,124 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 231 flow [2021-03-25 04:43:30,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 231 flow [2021-03-25 04:43:30,192 INFO L129 PetriNetUnfolder]: 168/349 cut-off events. [2021-03-25 04:43:30,192 INFO L130 PetriNetUnfolder]: For 505/574 co-relation queries the response was YES. [2021-03-25 04:43:30,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 349 events. 168/349 cut-off events. For 505/574 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1787 event pairs, 55 based on Foata normal form. 2/313 useless extension candidates. Maximal degree in co-relation 1025. Up to 221 conditions per place. [2021-03-25 04:43:30,198 INFO L142 LiptonReduction]: Number of co-enabled transitions 654 [2021-03-25 04:43:30,216 INFO L154 LiptonReduction]: Checked pairs total: 648 [2021-03-25 04:43:30,216 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:30,216 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-03-25 04:43:30,217 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 231 flow [2021-03-25 04:43:30,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:30,218 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:30,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:43:30,218 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:30,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:30,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1693129703, now seen corresponding path program 1 times [2021-03-25 04:43:30,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:30,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492914278] [2021-03-25 04:43:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:30,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:30,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:30,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:30,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:43:30,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:30,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:30,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:30,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492914278] [2021-03-25 04:43:30,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:30,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:30,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611850909] [2021-03-25 04:43:30,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:30,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:30,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:30,327 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 210 [2021-03-25 04:43:30,328 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,328 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:30,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 210 [2021-03-25 04:43:30,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:30,449 INFO L129 PetriNetUnfolder]: 233/416 cut-off events. [2021-03-25 04:43:30,450 INFO L130 PetriNetUnfolder]: For 648/960 co-relation queries the response was YES. [2021-03-25 04:43:30,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1491 conditions, 416 events. 233/416 cut-off events. For 648/960 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1947 event pairs, 85 based on Foata normal form. 27/429 useless extension candidates. Maximal degree in co-relation 1474. Up to 269 conditions per place. [2021-03-25 04:43:30,454 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 27 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2021-03-25 04:43:30,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 359 flow [2021-03-25 04:43:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 709 transitions. [2021-03-25 04:43:30,457 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.844047619047619 [2021-03-25 04:43:30,457 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 709 transitions. [2021-03-25 04:43:30,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 709 transitions. [2021-03-25 04:43:30,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:30,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 709 transitions. [2021-03-25 04:43:30,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 177.25) internal successors, (709), 4 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,460 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,460 INFO L185 Difference]: Start difference. First operand has 48 places, 45 transitions, 231 flow. Second operand 4 states and 709 transitions. [2021-03-25 04:43:30,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 359 flow [2021-03-25 04:43:30,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 342 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:43:30,465 INFO L241 Difference]: Finished difference. Result has 50 places, 49 transitions, 268 flow [2021-03-25 04:43:30,465 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2021-03-25 04:43:30,465 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -8 predicate places. [2021-03-25 04:43:30,466 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:30,466 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 49 transitions, 268 flow [2021-03-25 04:43:30,466 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 49 transitions, 268 flow [2021-03-25 04:43:30,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 49 transitions, 268 flow [2021-03-25 04:43:30,514 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1184] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$w_buff1_used~0_390 256) 0)) (.cse19 (= (mod v_~x$r_buff1_thd0~0_197 256) 0)) (.cse10 (= (mod v_~x$r_buff0_thd0~0_262 256) 0))) (let ((.cse11 (not .cse10)) (.cse3 (and .cse10 .cse19)) (.cse4 (and .cse18 .cse10)) (.cse17 (= (mod v_~x$w_buff0_used~0_548 256) 0)) (.cse7 (= (mod v_~weak$$choice2~0_92 256) 0))) (let ((.cse0 (not .cse7)) (.cse9 (or .cse3 .cse4 .cse17)) (.cse5 (or .cse11 (not .cse19))) (.cse6 (or (not .cse18) .cse11)) (.cse12 (not .cse17))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= |v_ULTIMATE.start_main_#t~nondet39_33| v_~weak$$choice0~0_21) (= v_~x$flush_delayed~0_52 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~ite52_79| |v_ULTIMATE.start_main_#t~ite52_80|))) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite53_69| |v_ULTIMATE.start_main_#t~ite53_70|) .cse1 (= v_~x$w_buff1_used~0_390 v_~x$w_buff1_used~0_389)) (and (let ((.cse2 (= (mod v_~x$w_buff0_used~0_547 256) 0))) (or (and (or .cse2 .cse3 .cse4) (= v_~x$w_buff1_used~0_390 |v_ULTIMATE.start_main_#t~ite53_70|) .cse1) (and (= |v_ULTIMATE.start_main_#t~ite52_80| 0) (= |v_ULTIMATE.start_main_#t~ite53_70| |v_ULTIMATE.start_main_#t~ite52_80|) .cse5 (not .cse2) .cse6))) .cse7 (= v_~x$w_buff1_used~0_389 |v_ULTIMATE.start_main_#t~ite53_70|)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite58_84| |v_ULTIMATE.start_main_#t~ite58_83|))) (or (and .cse0 (= v_~x$r_buff1_thd0~0_197 v_~x$r_buff1_thd0~0_196) (= |v_ULTIMATE.start_main_#t~ite59_78| |v_ULTIMATE.start_main_#t~ite59_77|) .cse8) (and (= v_~x$r_buff1_thd0~0_197 |v_ULTIMATE.start_main_#t~ite59_78|) (= v_~x$r_buff1_thd0~0_196 |v_ULTIMATE.start_main_#t~ite59_78|) .cse7 .cse8))) (or (and (= |v_ULTIMATE.start_main_#t~ite42_55| v_~x~0_218) .cse9 (= |v_ULTIMATE.start_main_#t~ite41_58| |v_ULTIMATE.start_main_#t~ite41_57|)) (and .cse5 (= |v_ULTIMATE.start_main_#t~ite41_58| |v_ULTIMATE.start_main_#t~ite42_55|) .cse6 (or (and (= |v_ULTIMATE.start_main_#t~ite41_58| v_~x$w_buff1~0_159) .cse10) (and (= v_~x$w_buff0~0_156 |v_ULTIMATE.start_main_#t~ite41_58|) .cse11)) .cse12)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_28 256)) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= |v_ULTIMATE.start_main_#t~ite47_76| v_~x$w_buff1~0_158) .cse7 (or (and .cse9 .cse13 (= |v_ULTIMATE.start_main_#t~ite47_76| v_~x$w_buff1~0_159)) (and .cse5 (= |v_ULTIMATE.start_main_#t~ite46_82| v_~x$w_buff1~0_159) (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite47_76|) .cse6 .cse12))) (and .cse13 .cse0 (= v_~x$w_buff1~0_159 v_~x$w_buff1~0_158) (= |v_ULTIMATE.start_main_#t~ite47_76| |v_ULTIMATE.start_main_#t~ite47_75|)))) (= v_~x$mem_tmp~0_32 v_~x~0_218) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite55_96| |v_ULTIMATE.start_main_#t~ite55_95|))) (or (and (= v_~x$r_buff0_thd0~0_262 v_~x$r_buff0_thd0~0_261) .cse14 .cse0 (= |v_ULTIMATE.start_main_#t~ite56_92| |v_ULTIMATE.start_main_#t~ite56_91|)) (and .cse14 .cse7 (= v_~x$r_buff0_thd0~0_261 |v_ULTIMATE.start_main_#t~ite56_92|) (= v_~x$r_buff0_thd0~0_262 |v_ULTIMATE.start_main_#t~ite56_92|)))) (= (ite (= (ite (not (and (= v_~__unbuffered_p3_EAX~0_30 1) (= v_~__unbuffered_p1_EAX~0_30 0) (= v_~__unbuffered_p2_EAX~0_30 0) (= 0 v_~__unbuffered_p3_EBX~0_30) (= 2 |v_ULTIMATE.start_main_#t~ite42_55|))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_28) (= |v_ULTIMATE.start_main_#t~nondet40_39| v_~weak$$choice2~0_92) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite49_90| |v_ULTIMATE.start_main_#t~ite49_89|))) (or (and (= v_~x$w_buff0_used~0_547 |v_ULTIMATE.start_main_#t~ite50_82|) (or (and .cse5 (or (and (= |v_ULTIMATE.start_main_#t~ite49_90| 0) .cse11) (and .cse10 (= v_~x$w_buff0_used~0_548 |v_ULTIMATE.start_main_#t~ite49_90|))) (= |v_ULTIMATE.start_main_#t~ite49_90| |v_ULTIMATE.start_main_#t~ite50_82|) .cse6 .cse12) (and .cse9 (= v_~x$w_buff0_used~0_548 |v_ULTIMATE.start_main_#t~ite50_82|) .cse15)) .cse7) (and .cse0 (= v_~x$w_buff0_used~0_548 v_~x$w_buff0_used~0_547) (= |v_ULTIMATE.start_main_#t~ite50_82| |v_ULTIMATE.start_main_#t~ite50_81|) .cse15))) (or (and .cse7 (= |v_ULTIMATE.start_main_#t~ite42_55| v_~x~0_217)) (and .cse0 (= v_~x$mem_tmp~0_32 v_~x~0_217))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite43_84| |v_ULTIMATE.start_main_#t~ite43_83|))) (or (and .cse0 .cse16 (= |v_ULTIMATE.start_main_#t~ite44_78| |v_ULTIMATE.start_main_#t~ite44_77|) (= v_~x$w_buff0~0_156 v_~x$w_buff0~0_155)) (and (= v_~x$w_buff0~0_155 |v_ULTIMATE.start_main_#t~ite44_78|) .cse7 (or (and .cse9 .cse16 (= v_~x$w_buff0~0_156 |v_ULTIMATE.start_main_#t~ite44_78|)) (and (= v_~x$w_buff0~0_156 |v_ULTIMATE.start_main_#t~ite43_84|) .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite43_84| |v_ULTIMATE.start_main_#t~ite44_78|) .cse12))))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_89|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_83|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_77|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_81|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_79|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_30, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_39|, ~x$w_buff1~0=v_~x$w_buff1~0_159, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_83|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_390, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_77|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_69|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_91|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_548, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_57|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_33|, ~x~0=v_~x~0_218} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_155, ~x$flush_delayed~0=v_~x$flush_delayed~0_52, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_74|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_88|, ~x$mem_tmp~0=v_~x$mem_tmp~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_82|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_54|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_44|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_80|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_30, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_261, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_38|, ~x$w_buff1~0=v_~x$w_buff1~0_158, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_82|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_389, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_48|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_30, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_76|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_196, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_54|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_68|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_90|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_547, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_94|, ~weak$$choice0~0=v_~weak$$choice0~0_21, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_48|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_56|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_32|, ~weak$$choice2~0=v_~weak$$choice2~0_92, ~x~0=v_~x~0_217} AuxVars[|v_ULTIMATE.start_main_#t~ite47_76|, |v_ULTIMATE.start_main_#t~ite43_84|, |v_ULTIMATE.start_main_#t~ite42_55|, |v_ULTIMATE.start_main_#t~ite44_78|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite55_96|, |v_ULTIMATE.start_main_#t~ite59_78|, |v_ULTIMATE.start_main_#t~ite50_82|, |v_ULTIMATE.start_main_#t~ite52_80|, |v_ULTIMATE.start_main_#t~ite53_70|, |v_ULTIMATE.start_main_#t~ite49_90|, |v_ULTIMATE.start_main_#t~ite41_58|, |v_ULTIMATE.start_main_#t~ite58_84|, |v_ULTIMATE.start_main_#t~ite56_92|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][39], [P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 99#L841true, 36#L765true, P2Thread1of1ForFork0InUse, 38#L815true, P0Thread1of1ForFork2InUse, 71#L785true, Black: 163#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$r_buff1_thd0~0 0)), 168#true, Black: 171#(and (= ~x~0 1) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd0~0 0)), Black: 141#(= ~__unbuffered_p3_EAX~0 0), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 147#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0) (= ~x~0 ~x$w_buff1~0)), 151#true, Black: 153#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff0_used~0 0)), Black: 154#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= ~x$w_buff1_used~0 0) (= ~x$r_buff1_thd0~0 0) (not (= ~x~0 ~x$w_buff0~0)))]) [2021-03-25 04:43:30,514 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 04:43:30,515 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 04:43:30,515 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 04:43:30,515 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 04:43:30,517 INFO L129 PetriNetUnfolder]: 199/393 cut-off events. [2021-03-25 04:43:30,518 INFO L130 PetriNetUnfolder]: For 783/939 co-relation queries the response was YES. [2021-03-25 04:43:30,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 393 events. 199/393 cut-off events. For 783/939 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2076 event pairs, 63 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 1300. Up to 229 conditions per place. [2021-03-25 04:43:30,524 INFO L142 LiptonReduction]: Number of co-enabled transitions 718 [2021-03-25 04:43:30,569 INFO L154 LiptonReduction]: Checked pairs total: 670 [2021-03-25 04:43:30,570 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:30,570 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 104 [2021-03-25 04:43:30,571 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 268 flow [2021-03-25 04:43:30,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,571 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:30,572 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:30,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:43:30,572 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:30,572 INFO L82 PathProgramCache]: Analyzing trace with hash 484663530, now seen corresponding path program 1 times [2021-03-25 04:43:30,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:30,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550686749] [2021-03-25 04:43:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:30,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:30,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:43:30,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:30,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:43:30,706 INFO L142 QuantifierPusher]: treesize reduction 20, result has 48.7 percent of original size [2021-03-25 04:43:30,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:43:30,721 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.6 percent of original size [2021-03-25 04:43:30,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 04:43:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:30,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550686749] [2021-03-25 04:43:30,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:30,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:43:30,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684814797] [2021-03-25 04:43:30,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:43:30,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:30,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:43:30,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:43:30,752 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 210 [2021-03-25 04:43:30,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 268 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:30,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 210 [2021-03-25 04:43:30,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:30,919 INFO L129 PetriNetUnfolder]: 224/427 cut-off events. [2021-03-25 04:43:30,919 INFO L130 PetriNetUnfolder]: For 821/1198 co-relation queries the response was YES. [2021-03-25 04:43:30,921 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 427 events. 224/427 cut-off events. For 821/1198 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2094 event pairs, 63 based on Foata normal form. 40/454 useless extension candidates. Maximal degree in co-relation 1622. Up to 268 conditions per place. [2021-03-25 04:43:30,924 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 27 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2021-03-25 04:43:30,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 398 flow [2021-03-25 04:43:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 665 transitions. [2021-03-25 04:43:30,926 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2021-03-25 04:43:30,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 665 transitions. [2021-03-25 04:43:30,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 665 transitions. [2021-03-25 04:43:30,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:30,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 665 transitions. [2021-03-25 04:43:30,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,930 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:30,930 INFO L185 Difference]: Start difference. First operand has 50 places, 49 transitions, 268 flow. Second operand 4 states and 665 transitions. [2021-03-25 04:43:30,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 398 flow [2021-03-25 04:43:30,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 380 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 04:43:30,936 INFO L241 Difference]: Finished difference. Result has 54 places, 52 transitions, 322 flow [2021-03-25 04:43:30,936 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2021-03-25 04:43:30,936 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-25 04:43:30,936 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:30,936 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 52 transitions, 322 flow [2021-03-25 04:43:30,937 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 52 transitions, 322 flow [2021-03-25 04:43:30,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 52 transitions, 322 flow [2021-03-25 04:43:30,987 INFO L129 PetriNetUnfolder]: 185/378 cut-off events. [2021-03-25 04:43:30,988 INFO L130 PetriNetUnfolder]: For 1400/1590 co-relation queries the response was YES. [2021-03-25 04:43:30,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 378 events. 185/378 cut-off events. For 1400/1590 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1940 event pairs, 44 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1413. Up to 205 conditions per place. [2021-03-25 04:43:30,993 INFO L142 LiptonReduction]: Number of co-enabled transitions 768 [2021-03-25 04:43:31,014 INFO L154 LiptonReduction]: Checked pairs total: 742 [2021-03-25 04:43:31,014 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:31,014 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 78 [2021-03-25 04:43:31,020 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 322 flow [2021-03-25 04:43:31,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:31,020 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:31,021 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:43:31,021 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:31,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:31,021 INFO L82 PathProgramCache]: Analyzing trace with hash -947413700, now seen corresponding path program 1 times [2021-03-25 04:43:31,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:31,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182413803] [2021-03-25 04:43:31,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:31,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:43:31,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:43:31,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:31,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:43:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:31,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182413803] [2021-03-25 04:43:31,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:31,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:43:31,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903061901] [2021-03-25 04:43:31,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:43:31,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:31,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:43:31,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:43:31,110 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 210 [2021-03-25 04:43:31,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:31,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 210 [2021-03-25 04:43:31,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:31,284 INFO L129 PetriNetUnfolder]: 240/438 cut-off events. [2021-03-25 04:43:31,284 INFO L130 PetriNetUnfolder]: For 1665/2248 co-relation queries the response was YES. [2021-03-25 04:43:31,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 438 events. 240/438 cut-off events. For 1665/2248 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2102 event pairs, 62 based on Foata normal form. 55/483 useless extension candidates. Maximal degree in co-relation 1889. Up to 279 conditions per place. [2021-03-25 04:43:31,289 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 29 selfloop transitions, 15 changer transitions 0/62 dead transitions. [2021-03-25 04:43:31,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 480 flow [2021-03-25 04:43:31,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:43:31,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:43:31,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 870 transitions. [2021-03-25 04:43:31,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2021-03-25 04:43:31,291 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 870 transitions. [2021-03-25 04:43:31,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 870 transitions. [2021-03-25 04:43:31,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:31,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 870 transitions. [2021-03-25 04:43:31,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,297 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,297 INFO L185 Difference]: Start difference. First operand has 54 places, 52 transitions, 322 flow. Second operand 5 states and 870 transitions. [2021-03-25 04:43:31,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 480 flow [2021-03-25 04:43:31,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 464 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-25 04:43:31,301 INFO L241 Difference]: Finished difference. Result has 58 places, 56 transitions, 383 flow [2021-03-25 04:43:31,301 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=383, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2021-03-25 04:43:31,301 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 0 predicate places. [2021-03-25 04:43:31,301 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:31,302 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 56 transitions, 383 flow [2021-03-25 04:43:31,302 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 56 transitions, 383 flow [2021-03-25 04:43:31,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 56 transitions, 383 flow [2021-03-25 04:43:31,353 INFO L129 PetriNetUnfolder]: 195/418 cut-off events. [2021-03-25 04:43:31,353 INFO L130 PetriNetUnfolder]: For 1549/1695 co-relation queries the response was YES. [2021-03-25 04:43:31,355 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1701 conditions, 418 events. 195/418 cut-off events. For 1549/1695 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2280 event pairs, 44 based on Foata normal form. 1/406 useless extension candidates. Maximal degree in co-relation 1680. Up to 202 conditions per place. [2021-03-25 04:43:31,359 INFO L142 LiptonReduction]: Number of co-enabled transitions 846 [2021-03-25 04:43:31,411 INFO L154 LiptonReduction]: Checked pairs total: 831 [2021-03-25 04:43:31,412 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:31,412 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 111 [2021-03-25 04:43:31,412 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 383 flow [2021-03-25 04:43:31,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,413 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:31,413 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:31,413 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:43:31,413 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:31,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash -612986630, now seen corresponding path program 2 times [2021-03-25 04:43:31,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:31,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502573773] [2021-03-25 04:43:31,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:31,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:31,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:31,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:31,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:43:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:31,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502573773] [2021-03-25 04:43:31,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:31,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:31,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195356942] [2021-03-25 04:43:31,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:31,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:31,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:31,490 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-03-25 04:43:31,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:31,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-03-25 04:43:31,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:31,636 INFO L129 PetriNetUnfolder]: 289/516 cut-off events. [2021-03-25 04:43:31,636 INFO L130 PetriNetUnfolder]: For 2632/3225 co-relation queries the response was YES. [2021-03-25 04:43:31,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2552 conditions, 516 events. 289/516 cut-off events. For 2632/3225 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2440 event pairs, 61 based on Foata normal form. 66/571 useless extension candidates. Maximal degree in co-relation 2529. Up to 322 conditions per place. [2021-03-25 04:43:31,642 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 32 selfloop transitions, 28 changer transitions 0/78 dead transitions. [2021-03-25 04:43:31,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 78 transitions, 695 flow [2021-03-25 04:43:31,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:43:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:43:31,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1033 transitions. [2021-03-25 04:43:31,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8198412698412698 [2021-03-25 04:43:31,645 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1033 transitions. [2021-03-25 04:43:31,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1033 transitions. [2021-03-25 04:43:31,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:31,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1033 transitions. [2021-03-25 04:43:31,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,650 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 210.0) internal successors, (1470), 7 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,651 INFO L185 Difference]: Start difference. First operand has 58 places, 56 transitions, 383 flow. Second operand 6 states and 1033 transitions. [2021-03-25 04:43:31,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 78 transitions, 695 flow [2021-03-25 04:43:31,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 611 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-03-25 04:43:31,656 INFO L241 Difference]: Finished difference. Result has 62 places, 74 transitions, 570 flow [2021-03-25 04:43:31,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=62, PETRI_TRANSITIONS=74} [2021-03-25 04:43:31,656 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 4 predicate places. [2021-03-25 04:43:31,656 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:31,656 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 74 transitions, 570 flow [2021-03-25 04:43:31,656 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 74 transitions, 570 flow [2021-03-25 04:43:31,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 74 transitions, 570 flow [2021-03-25 04:43:31,728 INFO L129 PetriNetUnfolder]: 292/552 cut-off events. [2021-03-25 04:43:31,728 INFO L130 PetriNetUnfolder]: For 2641/2932 co-relation queries the response was YES. [2021-03-25 04:43:31,730 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 552 events. 292/552 cut-off events. For 2641/2932 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2807 event pairs, 40 based on Foata normal form. 11/540 useless extension candidates. Maximal degree in co-relation 2597. Up to 318 conditions per place. [2021-03-25 04:43:31,737 INFO L142 LiptonReduction]: Number of co-enabled transitions 1018 [2021-03-25 04:43:31,790 INFO L154 LiptonReduction]: Checked pairs total: 1860 [2021-03-25 04:43:31,790 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:31,790 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-03-25 04:43:31,790 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 74 transitions, 570 flow [2021-03-25 04:43:31,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.0) internal successors, (845), 5 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,791 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:31,791 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:31,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:43:31,791 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:31,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:31,792 INFO L82 PathProgramCache]: Analyzing trace with hash 448792966, now seen corresponding path program 1 times [2021-03-25 04:43:31,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:31,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626371451] [2021-03-25 04:43:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:31,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:31,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:31,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:31,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:31,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626371451] [2021-03-25 04:43:31,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:31,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:31,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366573411] [2021-03-25 04:43:31,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:31,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:31,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:31,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:31,867 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:31,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 74 transitions, 570 flow. Second operand has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:31,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:31,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:31,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:32,051 INFO L129 PetriNetUnfolder]: 707/1272 cut-off events. [2021-03-25 04:43:32,051 INFO L130 PetriNetUnfolder]: For 5836/6541 co-relation queries the response was YES. [2021-03-25 04:43:32,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 1272 events. 707/1272 cut-off events. For 5836/6541 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 8110 event pairs, 273 based on Foata normal form. 228/1402 useless extension candidates. Maximal degree in co-relation 5195. Up to 576 conditions per place. [2021-03-25 04:43:32,068 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 12 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2021-03-25 04:43:32,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 601 flow [2021-03-25 04:43:32,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:43:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:43:32,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-25 04:43:32,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8685714285714285 [2021-03-25 04:43:32,071 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-25 04:43:32,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-25 04:43:32,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:32,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-25 04:43:32,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.4) internal successors, (912), 5 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,076 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,076 INFO L185 Difference]: Start difference. First operand has 62 places, 74 transitions, 570 flow. Second operand 5 states and 912 transitions. [2021-03-25 04:43:32,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 601 flow [2021-03-25 04:43:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 574 flow, removed 13 selfloop flow, removed 1 redundant places. [2021-03-25 04:43:32,087 INFO L241 Difference]: Finished difference. Result has 68 places, 78 transitions, 587 flow [2021-03-25 04:43:32,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=587, PETRI_PLACES=68, PETRI_TRANSITIONS=78} [2021-03-25 04:43:32,088 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2021-03-25 04:43:32,088 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:32,088 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 78 transitions, 587 flow [2021-03-25 04:43:32,089 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 78 transitions, 587 flow [2021-03-25 04:43:32,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 78 transitions, 587 flow [2021-03-25 04:43:32,288 INFO L129 PetriNetUnfolder]: 726/1295 cut-off events. [2021-03-25 04:43:32,289 INFO L130 PetriNetUnfolder]: For 6466/7163 co-relation queries the response was YES. [2021-03-25 04:43:32,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5854 conditions, 1295 events. 726/1295 cut-off events. For 6466/7163 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 8234 event pairs, 233 based on Foata normal form. 25/1199 useless extension candidates. Maximal degree in co-relation 5827. Up to 586 conditions per place. [2021-03-25 04:43:32,313 INFO L142 LiptonReduction]: Number of co-enabled transitions 1272 [2021-03-25 04:43:32,414 INFO L154 LiptonReduction]: Checked pairs total: 1207 [2021-03-25 04:43:32,414 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:32,414 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 326 [2021-03-25 04:43:32,416 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 78 transitions, 587 flow [2021-03-25 04:43:32,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 178.75) internal successors, (715), 4 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:32,416 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:32,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:43:32,417 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 2055969712, now seen corresponding path program 1 times [2021-03-25 04:43:32,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:32,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781846191] [2021-03-25 04:43:32,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:32,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:32,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:32,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:32,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:32,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781846191] [2021-03-25 04:43:32,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:32,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:43:32,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402171467] [2021-03-25 04:43:32,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:43:32,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:32,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:43:32,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:43:32,489 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:32,490 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 78 transitions, 587 flow. Second operand has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,490 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:32,490 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:32,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:32,657 INFO L129 PetriNetUnfolder]: 405/863 cut-off events. [2021-03-25 04:43:32,657 INFO L130 PetriNetUnfolder]: For 5316/7395 co-relation queries the response was YES. [2021-03-25 04:43:32,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4012 conditions, 863 events. 405/863 cut-off events. For 5316/7395 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 5865 event pairs, 77 based on Foata normal form. 484/1285 useless extension candidates. Maximal degree in co-relation 3983. Up to 476 conditions per place. [2021-03-25 04:43:32,668 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 12 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2021-03-25 04:43:32,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 87 transitions, 691 flow [2021-03-25 04:43:32,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:43:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:43:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1277 transitions. [2021-03-25 04:43:32,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8687074829931973 [2021-03-25 04:43:32,672 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1277 transitions. [2021-03-25 04:43:32,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1277 transitions. [2021-03-25 04:43:32,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:32,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1277 transitions. [2021-03-25 04:43:32,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 182.42857142857142) internal successors, (1277), 7 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,678 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,678 INFO L185 Difference]: Start difference. First operand has 68 places, 78 transitions, 587 flow. Second operand 7 states and 1277 transitions. [2021-03-25 04:43:32,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 87 transitions, 691 flow [2021-03-25 04:43:32,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 87 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:43:32,687 INFO L241 Difference]: Finished difference. Result has 76 places, 83 transitions, 690 flow [2021-03-25 04:43:32,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=690, PETRI_PLACES=76, PETRI_TRANSITIONS=83} [2021-03-25 04:43:32,687 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2021-03-25 04:43:32,687 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:32,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 83 transitions, 690 flow [2021-03-25 04:43:32,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 83 transitions, 690 flow [2021-03-25 04:43:32,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 83 transitions, 690 flow [2021-03-25 04:43:32,790 INFO L129 PetriNetUnfolder]: 416/875 cut-off events. [2021-03-25 04:43:32,791 INFO L130 PetriNetUnfolder]: For 6179/8357 co-relation queries the response was YES. [2021-03-25 04:43:32,797 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4529 conditions, 875 events. 416/875 cut-off events. For 6179/8357 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5950 event pairs, 55 based on Foata normal form. 54/851 useless extension candidates. Maximal degree in co-relation 4498. Up to 471 conditions per place. [2021-03-25 04:43:32,807 INFO L142 LiptonReduction]: Number of co-enabled transitions 1494 [2021-03-25 04:43:32,835 INFO L154 LiptonReduction]: Checked pairs total: 1080 [2021-03-25 04:43:32,836 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:32,836 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-03-25 04:43:32,836 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 83 transitions, 690 flow [2021-03-25 04:43:32,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.8) internal successors, (894), 5 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,836 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:32,837 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:32,837 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:43:32,837 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:32,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:32,837 INFO L82 PathProgramCache]: Analyzing trace with hash 630910270, now seen corresponding path program 1 times [2021-03-25 04:43:32,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:32,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577163587] [2021-03-25 04:43:32,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:32,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:32,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:32,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:32,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:32,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:32,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:32,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577163587] [2021-03-25 04:43:32,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:32,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:43:32,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178433387] [2021-03-25 04:43:32,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:43:32,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:32,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:43:32,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:43:32,916 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:32,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 83 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:32,917 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:32,917 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:32,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:33,081 INFO L129 PetriNetUnfolder]: 283/669 cut-off events. [2021-03-25 04:43:33,081 INFO L130 PetriNetUnfolder]: For 5965/9464 co-relation queries the response was YES. [2021-03-25 04:43:33,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3674 conditions, 669 events. 283/669 cut-off events. For 5965/9464 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4606 event pairs, 15 based on Foata normal form. 622/1238 useless extension candidates. Maximal degree in co-relation 3641. Up to 449 conditions per place. [2021-03-25 04:43:33,091 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 7 selfloop transitions, 28 changer transitions 4/91 dead transitions. [2021-03-25 04:43:33,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 91 transitions, 852 flow [2021-03-25 04:43:33,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:43:33,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:43:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1642 transitions. [2021-03-25 04:43:33,095 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8687830687830688 [2021-03-25 04:43:33,095 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1642 transitions. [2021-03-25 04:43:33,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1642 transitions. [2021-03-25 04:43:33,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:33,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1642 transitions. [2021-03-25 04:43:33,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 182.44444444444446) internal successors, (1642), 9 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,102 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,102 INFO L185 Difference]: Start difference. First operand has 76 places, 83 transitions, 690 flow. Second operand 9 states and 1642 transitions. [2021-03-25 04:43:33,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 91 transitions, 852 flow [2021-03-25 04:43:33,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 91 transitions, 776 flow, removed 22 selfloop flow, removed 5 redundant places. [2021-03-25 04:43:33,121 INFO L241 Difference]: Finished difference. Result has 82 places, 87 transitions, 754 flow [2021-03-25 04:43:33,121 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=754, PETRI_PLACES=82, PETRI_TRANSITIONS=87} [2021-03-25 04:43:33,121 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2021-03-25 04:43:33,121 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:33,121 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 87 transitions, 754 flow [2021-03-25 04:43:33,121 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 87 transitions, 754 flow [2021-03-25 04:43:33,122 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 87 transitions, 754 flow [2021-03-25 04:43:33,189 INFO L129 PetriNetUnfolder]: 272/657 cut-off events. [2021-03-25 04:43:33,189 INFO L130 PetriNetUnfolder]: For 4565/5299 co-relation queries the response was YES. [2021-03-25 04:43:33,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3213 conditions, 657 events. 272/657 cut-off events. For 4565/5299 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4577 event pairs, 12 based on Foata normal form. 44/648 useless extension candidates. Maximal degree in co-relation 3180. Up to 275 conditions per place. [2021-03-25 04:43:33,201 INFO L142 LiptonReduction]: Number of co-enabled transitions 1588 [2021-03-25 04:43:33,217 INFO L154 LiptonReduction]: Checked pairs total: 1531 [2021-03-25 04:43:33,217 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:33,218 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-03-25 04:43:33,219 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 87 transitions, 754 flow [2021-03-25 04:43:33,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 178.83333333333334) internal successors, (1073), 6 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:33,220 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:33,220 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:43:33,220 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2066277327, now seen corresponding path program 1 times [2021-03-25 04:43:33,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:33,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325802343] [2021-03-25 04:43:33,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:33,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:33,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:33,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:33,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325802343] [2021-03-25 04:43:33,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:33,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:33,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857714074] [2021-03-25 04:43:33,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:33,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:33,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:33,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:33,303 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 210 [2021-03-25 04:43:33,304 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 87 transitions, 754 flow. Second operand has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:33,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 210 [2021-03-25 04:43:33,304 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:33,493 INFO L129 PetriNetUnfolder]: 539/1264 cut-off events. [2021-03-25 04:43:33,493 INFO L130 PetriNetUnfolder]: For 8912/10115 co-relation queries the response was YES. [2021-03-25 04:43:33,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6188 conditions, 1264 events. 539/1264 cut-off events. For 8912/10115 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 9940 event pairs, 27 based on Foata normal form. 94/1255 useless extension candidates. Maximal degree in co-relation 6153. Up to 544 conditions per place. [2021-03-25 04:43:33,506 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 4 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2021-03-25 04:43:33,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 786 flow [2021-03-25 04:43:33,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2021-03-25 04:43:33,509 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9035714285714286 [2021-03-25 04:43:33,509 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2021-03-25 04:43:33,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2021-03-25 04:43:33,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:33,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2021-03-25 04:43:33,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,512 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,512 INFO L185 Difference]: Start difference. First operand has 82 places, 87 transitions, 754 flow. Second operand 4 states and 759 transitions. [2021-03-25 04:43:33,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 786 flow [2021-03-25 04:43:33,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 89 transitions, 689 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-03-25 04:43:33,622 INFO L241 Difference]: Finished difference. Result has 83 places, 88 transitions, 670 flow [2021-03-25 04:43:33,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=670, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2021-03-25 04:43:33,622 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2021-03-25 04:43:33,622 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:33,622 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 88 transitions, 670 flow [2021-03-25 04:43:33,623 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 88 transitions, 670 flow [2021-03-25 04:43:33,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 88 transitions, 670 flow [2021-03-25 04:43:33,743 INFO L129 PetriNetUnfolder]: 534/1263 cut-off events. [2021-03-25 04:43:33,743 INFO L130 PetriNetUnfolder]: For 5430/5970 co-relation queries the response was YES. [2021-03-25 04:43:33,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4911 conditions, 1263 events. 534/1263 cut-off events. For 5430/5970 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 10174 event pairs, 22 based on Foata normal form. 90/1266 useless extension candidates. Maximal degree in co-relation 4876. Up to 315 conditions per place. [2021-03-25 04:43:33,767 INFO L142 LiptonReduction]: Number of co-enabled transitions 1628 [2021-03-25 04:43:33,799 INFO L154 LiptonReduction]: Checked pairs total: 892 [2021-03-25 04:43:33,799 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:43:33,799 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 177 [2021-03-25 04:43:33,799 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 670 flow [2021-03-25 04:43:33,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:33,800 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:33,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:43:33,800 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:33,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:33,801 INFO L82 PathProgramCache]: Analyzing trace with hash -136571729, now seen corresponding path program 2 times [2021-03-25 04:43:33,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:33,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243952081] [2021-03-25 04:43:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:33,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:33,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:33,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:33,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:33,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:43:33,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:33,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:33,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:33,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243952081] [2021-03-25 04:43:33,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:33,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:43:33,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440035389] [2021-03-25 04:43:33,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:43:33,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:33,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:43:33,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:43:33,914 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:43:33,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 670 flow. Second operand has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:33,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:33,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:43:33,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:34,179 INFO L129 PetriNetUnfolder]: 511/1200 cut-off events. [2021-03-25 04:43:34,179 INFO L130 PetriNetUnfolder]: For 7262/10639 co-relation queries the response was YES. [2021-03-25 04:43:34,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5337 conditions, 1200 events. 511/1200 cut-off events. For 7262/10639 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 9477 event pairs, 14 based on Foata normal form. 1006/2107 useless extension candidates. Maximal degree in co-relation 5300. Up to 315 conditions per place. [2021-03-25 04:43:34,192 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 2 selfloop transitions, 33 changer transitions 4/92 dead transitions. [2021-03-25 04:43:34,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 787 flow [2021-03-25 04:43:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 04:43:34,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 04:43:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1999 transitions. [2021-03-25 04:43:34,197 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8653679653679653 [2021-03-25 04:43:34,197 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1999 transitions. [2021-03-25 04:43:34,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1999 transitions. [2021-03-25 04:43:34,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:34,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1999 transitions. [2021-03-25 04:43:34,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 181.72727272727272) internal successors, (1999), 11 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:34,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:34,206 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:34,206 INFO L185 Difference]: Start difference. First operand has 83 places, 88 transitions, 670 flow. Second operand 11 states and 1999 transitions. [2021-03-25 04:43:34,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 787 flow [2021-03-25 04:43:34,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 92 transitions, 758 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 04:43:34,271 INFO L241 Difference]: Finished difference. Result has 93 places, 88 transitions, 718 flow [2021-03-25 04:43:34,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=718, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2021-03-25 04:43:34,271 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 35 predicate places. [2021-03-25 04:43:34,271 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:34,271 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 718 flow [2021-03-25 04:43:34,272 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 718 flow [2021-03-25 04:43:34,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 88 transitions, 718 flow [2021-03-25 04:43:34,391 INFO L129 PetriNetUnfolder]: 501/1192 cut-off events. [2021-03-25 04:43:34,391 INFO L130 PetriNetUnfolder]: For 5647/6212 co-relation queries the response was YES. [2021-03-25 04:43:34,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5292 conditions, 1192 events. 501/1192 cut-off events. For 5647/6212 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 9538 event pairs, 12 based on Foata normal form. 66/1175 useless extension candidates. Maximal degree in co-relation 5255. Up to 315 conditions per place. [2021-03-25 04:43:34,417 INFO L142 LiptonReduction]: Number of co-enabled transitions 1596 [2021-03-25 04:43:35,161 WARN L205 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 186 [2021-03-25 04:43:35,411 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-25 04:43:36,630 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 341 DAG size of output: 264 [2021-03-25 04:43:37,090 WARN L205 SmtUtils]: Spent 456.00 ms on a formula simplification that was a NOOP. DAG size: 246 [2021-03-25 04:43:37,359 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:43:37,558 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:43:38,073 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:43:38,575 WARN L205 SmtUtils]: Spent 501.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 04:43:38,600 INFO L154 LiptonReduction]: Checked pairs total: 2774 [2021-03-25 04:43:38,600 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 04:43:38,600 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4329 [2021-03-25 04:43:38,600 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 678 flow [2021-03-25 04:43:38,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 178.85714285714286) internal successors, (1252), 7 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:38,601 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:38,601 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:38,601 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:43:38,601 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1920626065, now seen corresponding path program 1 times [2021-03-25 04:43:38,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:38,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581568361] [2021-03-25 04:43:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:38,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:38,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:38,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:38,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:38,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:38,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:38,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:38,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581568361] [2021-03-25 04:43:38,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:38,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:38,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038742087] [2021-03-25 04:43:38,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:38,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:38,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:38,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:38,691 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 212 [2021-03-25 04:43:38,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 678 flow. Second operand has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:38,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:38,692 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 212 [2021-03-25 04:43:38,692 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:38,825 INFO L129 PetriNetUnfolder]: 512/1053 cut-off events. [2021-03-25 04:43:38,825 INFO L130 PetriNetUnfolder]: For 15602/16414 co-relation queries the response was YES. [2021-03-25 04:43:38,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4502 conditions, 1053 events. 512/1053 cut-off events. For 15602/16414 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6882 event pairs, 28 based on Foata normal form. 76/1058 useless extension candidates. Maximal degree in co-relation 4463. Up to 303 conditions per place. [2021-03-25 04:43:38,835 INFO L132 encePairwiseOnDemand]: 209/212 looper letters, 3 selfloop transitions, 1 changer transitions 1/71 dead transitions. [2021-03-25 04:43:38,836 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 71 transitions, 574 flow [2021-03-25 04:43:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 726 transitions. [2021-03-25 04:43:38,838 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8561320754716981 [2021-03-25 04:43:38,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 726 transitions. [2021-03-25 04:43:38,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 726 transitions. [2021-03-25 04:43:38,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:38,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 726 transitions. [2021-03-25 04:43:38,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 181.5) internal successors, (726), 4 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:38,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:38,841 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:38,841 INFO L185 Difference]: Start difference. First operand has 90 places, 82 transitions, 678 flow. Second operand 4 states and 726 transitions. [2021-03-25 04:43:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 71 transitions, 574 flow [2021-03-25 04:43:38,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 71 transitions, 485 flow, removed 29 selfloop flow, removed 13 redundant places. [2021-03-25 04:43:38,863 INFO L241 Difference]: Finished difference. Result has 72 places, 70 transitions, 480 flow [2021-03-25 04:43:38,864 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=480, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2021-03-25 04:43:38,864 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2021-03-25 04:43:38,864 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:38,864 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 70 transitions, 480 flow [2021-03-25 04:43:38,864 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 70 transitions, 480 flow [2021-03-25 04:43:38,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 70 transitions, 480 flow [2021-03-25 04:43:38,933 INFO L129 PetriNetUnfolder]: 313/686 cut-off events. [2021-03-25 04:43:38,933 INFO L130 PetriNetUnfolder]: For 2541/2897 co-relation queries the response was YES. [2021-03-25 04:43:38,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 686 events. 313/686 cut-off events. For 2541/2897 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4387 event pairs, 14 based on Foata normal form. 34/688 useless extension candidates. Maximal degree in co-relation 2497. Up to 199 conditions per place. [2021-03-25 04:43:38,944 INFO L142 LiptonReduction]: Number of co-enabled transitions 936 [2021-03-25 04:43:39,056 INFO L154 LiptonReduction]: Checked pairs total: 784 [2021-03-25 04:43:39,056 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:43:39,056 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 192 [2021-03-25 04:43:39,059 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 481 flow [2021-03-25 04:43:39,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:39,060 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:39,060 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:39,060 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:43:39,060 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:39,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1904732593, now seen corresponding path program 1 times [2021-03-25 04:43:39,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:39,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775882053] [2021-03-25 04:43:39,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:43:39,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:39,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:43:39,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:39,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:39,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:43:39,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:43:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:43:39,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775882053] [2021-03-25 04:43:39,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:43:39,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:43:39,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686037249] [2021-03-25 04:43:39,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:43:39,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:43:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:43:39,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:43:39,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 214 [2021-03-25 04:43:39,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 481 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:39,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:43:39,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 214 [2021-03-25 04:43:39,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:43:39,255 INFO L129 PetriNetUnfolder]: 512/1095 cut-off events. [2021-03-25 04:43:39,255 INFO L130 PetriNetUnfolder]: For 6420/6919 co-relation queries the response was YES. [2021-03-25 04:43:39,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4034 conditions, 1095 events. 512/1095 cut-off events. For 6420/6919 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7505 event pairs, 32 based on Foata normal form. 92/1114 useless extension candidates. Maximal degree in co-relation 4003. Up to 340 conditions per place. [2021-03-25 04:43:39,264 INFO L132 encePairwiseOnDemand]: 211/214 looper letters, 3 selfloop transitions, 1 changer transitions 21/70 dead transitions. [2021-03-25 04:43:39,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 493 flow [2021-03-25 04:43:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:43:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:43:39,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-03-25 04:43:39,267 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8621495327102804 [2021-03-25 04:43:39,267 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-03-25 04:43:39,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-03-25 04:43:39,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:43:39,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-03-25 04:43:39,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:39,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:39,270 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:39,270 INFO L185 Difference]: Start difference. First operand has 70 places, 69 transitions, 481 flow. Second operand 4 states and 738 transitions. [2021-03-25 04:43:39,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 493 flow [2021-03-25 04:43:39,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 489 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:43:39,288 INFO L241 Difference]: Finished difference. Result has 73 places, 49 transitions, 328 flow [2021-03-25 04:43:39,288 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2021-03-25 04:43:39,288 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 15 predicate places. [2021-03-25 04:43:39,288 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:43:39,288 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 49 transitions, 328 flow [2021-03-25 04:43:39,288 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 49 transitions, 328 flow [2021-03-25 04:43:39,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 49 transitions, 328 flow [2021-03-25 04:43:39,336 INFO L129 PetriNetUnfolder]: 229/519 cut-off events. [2021-03-25 04:43:39,336 INFO L130 PetriNetUnfolder]: For 1911/2123 co-relation queries the response was YES. [2021-03-25 04:43:39,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 519 events. 229/519 cut-off events. For 1911/2123 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3168 event pairs, 14 based on Foata normal form. 24/517 useless extension candidates. Maximal degree in co-relation 1926. Up to 184 conditions per place. [2021-03-25 04:43:39,343 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-25 04:43:39,369 INFO L154 LiptonReduction]: Checked pairs total: 56 [2021-03-25 04:43:39,369 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:43:39,369 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-03-25 04:43:39,370 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 326 flow [2021-03-25 04:43:39,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:43:39,370 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:43:39,370 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:43:39,370 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 04:43:39,370 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:43:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:43:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1231094921, now seen corresponding path program 1 times [2021-03-25 04:43:39,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:43:39,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743940333] [2021-03-25 04:43:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:43:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:43:39,413 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:43:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:43:39,448 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:43:39,489 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:43:39,489 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:43:39,489 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 04:43:39,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:43:39 BasicIcfg [2021-03-25 04:43:39,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:43:39,604 INFO L168 Benchmark]: Toolchain (without parser) took 25474.81 ms. Allocated memory was 255.9 MB in the beginning and 906.0 MB in the end (delta: 650.1 MB). Free memory was 231.7 MB in the beginning and 353.6 MB in the end (delta: -121.9 MB). Peak memory consumption was 529.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:39,607 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:43:39,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.64 ms. Allocated memory was 255.9 MB in the beginning and 436.2 MB in the end (delta: 180.4 MB). Free memory was 231.3 MB in the beginning and 394.2 MB in the end (delta: -162.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:39,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.79 ms. Allocated memory is still 436.2 MB. Free memory was 394.2 MB in the beginning and 391.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:39,607 INFO L168 Benchmark]: Boogie Preprocessor took 38.83 ms. Allocated memory is still 436.2 MB. Free memory was 391.3 MB in the beginning and 388.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:39,608 INFO L168 Benchmark]: RCFGBuilder took 1829.15 ms. Allocated memory is still 436.2 MB. Free memory was 388.9 MB in the beginning and 294.9 MB in the end (delta: 94.0 MB). Peak memory consumption was 96.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:39,608 INFO L168 Benchmark]: TraceAbstraction took 22922.65 ms. Allocated memory was 436.2 MB in the beginning and 906.0 MB in the end (delta: 469.8 MB). Free memory was 293.9 MB in the beginning and 353.6 MB in the end (delta: -59.8 MB). Peak memory consumption was 411.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:43:39,609 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 593.64 ms. Allocated memory was 255.9 MB in the beginning and 436.2 MB in the end (delta: 180.4 MB). Free memory was 231.3 MB in the beginning and 394.2 MB in the end (delta: -162.9 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 83.79 ms. Allocated memory is still 436.2 MB. Free memory was 394.2 MB in the beginning and 391.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 38.83 ms. Allocated memory is still 436.2 MB. Free memory was 391.3 MB in the beginning and 388.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1829.15 ms. Allocated memory is still 436.2 MB. Free memory was 388.9 MB in the beginning and 294.9 MB in the end (delta: 94.0 MB). Peak memory consumption was 96.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22922.65 ms. Allocated memory was 436.2 MB in the beginning and 906.0 MB in the end (delta: 469.8 MB). Free memory was 293.9 MB in the beginning and 353.6 MB in the end (delta: -59.8 MB). Peak memory consumption was 411.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7717.7ms, 127 PlacesBefore, 58 PlacesAfterwards, 116 TransitionsBefore, 46 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 5 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5149 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2463, positive: 2352, positive conditional: 0, positive unconditional: 2352, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1359, positive: 1326, positive conditional: 0, positive unconditional: 1326, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1359, positive: 1326, positive conditional: 0, positive unconditional: 1326, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2463, positive: 1026, positive conditional: 0, positive unconditional: 1026, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 1359, unknown conditional: 0, unknown unconditional: 1359] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 154, Positive conditional cache size: 0, Positive unconditional cache size: 154, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2997.5ms, 54 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 29 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2227 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 608, positive: 491, positive conditional: 0, positive unconditional: 491, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 42, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 608, positive: 463, positive conditional: 0, positive unconditional: 463, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 954.1ms, 41 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 410 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 964 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 214, positive: 162, positive conditional: 0, positive unconditional: 162, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 214, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 111, Positive conditional cache size: 0, Positive unconditional cache size: 111, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.6ms, 40 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 90, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 61.9ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 371 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 74, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 91.7ms, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 158, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 158, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 125, Positive conditional cache size: 0, Positive unconditional cache size: 125, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 103.7ms, 50 PlacesBefore, 50 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 718 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 670 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 208, positive conditional: 0, positive unconditional: 208, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 231, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 77.1ms, 54 PlacesBefore, 54 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 742 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 297, positive: 273, positive conditional: 0, positive unconditional: 273, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 297, positive: 271, positive conditional: 0, positive unconditional: 271, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 158, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 109.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 846 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 831 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 183, positive conditional: 0, positive unconditional: 183, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 208, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.4ms, 62 PlacesBefore, 62 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1860 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 626, positive: 580, positive conditional: 0, positive unconditional: 580, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 626, positive: 579, positive conditional: 0, positive unconditional: 579, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 325.6ms, 68 PlacesBefore, 68 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1207 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 394, positive: 369, positive conditional: 0, positive unconditional: 369, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 394, positive: 367, positive conditional: 0, positive unconditional: 367, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 147.8ms, 76 PlacesBefore, 76 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1080 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 314, positive: 293, positive conditional: 0, positive unconditional: 293, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 314, positive: 293, positive conditional: 0, positive unconditional: 293, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 96.1ms, 82 PlacesBefore, 82 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 1588 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1531 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 351, positive: 322, positive conditional: 0, positive unconditional: 322, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 351, positive: 322, positive conditional: 0, positive unconditional: 322, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 176.4ms, 83 PlacesBefore, 83 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 1628 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 892 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 454, positive: 437, positive conditional: 0, positive unconditional: 437, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 454, positive: 431, positive conditional: 0, positive unconditional: 431, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4328.4ms, 93 PlacesBefore, 90 PlacesAfterwards, 88 TransitionsBefore, 82 TransitionsAfterwards, 1596 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 2774 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1692, positive: 1641, positive conditional: 0, positive unconditional: 1641, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1692, positive: 1641, positive conditional: 0, positive unconditional: 1641, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 192.1ms, 72 PlacesBefore, 70 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 784 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 470, positive: 451, positive conditional: 0, positive unconditional: 451, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 470, positive: 450, positive conditional: 0, positive unconditional: 450, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 80.7ms, 73 PlacesBefore, 68 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 56 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 91, Positive conditional cache size: 0, Positive unconditional cache size: 91, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] 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) [L790] 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) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 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 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 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 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] 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) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] 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) [L871] 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) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 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 [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 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 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22614.8ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2934.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7819.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 68 SDtfs, 41 SDslu, 24 SDs, 0 SdLazy, 446 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 499.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 358.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=754occurred in iteration=12, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 54.4ms SsaConstructionTime, 603.5ms SatisfiabilityAnalysisTime, 998.8ms InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 269 ConstructedInterpolants, 0 QuantifiedInterpolants, 1558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...