/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/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:46:02,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:46:02,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:46:02,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:46:02,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:46:02,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:46:02,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:46:02,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:46:02,556 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:46:02,557 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:46:02,557 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:46:02,558 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:46:02,559 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:46:02,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:46:02,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:46:02,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:46:02,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:46:02,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:46:02,564 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:46:02,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:46:02,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:46:02,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:46:02,568 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:46:02,569 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:46:02,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:46:02,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:46:02,572 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:46:02,573 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:46:02,573 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:46:02,574 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:46:02,574 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:46:02,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:46:02,575 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:46:02,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:46:02,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:46:02,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:46:02,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:46:02,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:46:02,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:46:02,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:46:02,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:46:02,590 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:46:02,622 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:46:02,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:46:02,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:46:02,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:46:02,624 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:46:02,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:46:02,624 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:46:02,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:46:02,625 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:46:02,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:46:02,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:46:02,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:46:02,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:46:02,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:46:02,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:46:02,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:46:02,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:46:02,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:46:02,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:46:02,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:46:02,627 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:46:02,627 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:46:02,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:46:02,628 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:46:02,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:46:02,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:46:02,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:46:02,986 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:46:02,986 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:46:02,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-25 04:46:03,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c233e8f/8ecb074a53c5465486501b5b18364424/FLAGde657c6cb [2021-03-25 04:46:03,576 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:46:03,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-03-25 04:46:03,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c233e8f/8ecb074a53c5465486501b5b18364424/FLAGde657c6cb [2021-03-25 04:46:04,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8c233e8f/8ecb074a53c5465486501b5b18364424 [2021-03-25 04:46:04,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:46:04,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:46:04,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:46:04,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:46:04,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:46:04,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239bfef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04, skipping insertion in model container [2021-03-25 04:46:04,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:46:04,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:46:04,276 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/mix044_tso.oepc.i[949,962] [2021-03-25 04:46:04,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:46:04,468 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:46:04,478 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/mix044_tso.oepc.i[949,962] [2021-03-25 04:46:04,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:46:04,606 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:46:04,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04 WrapperNode [2021-03-25 04:46:04,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:46:04,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:46:04,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:46:04,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:46:04,615 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:46:04" (1/1) ... [2021-03-25 04:46:04,647 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:46:04" (1/1) ... [2021-03-25 04:46:04,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:46:04,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:46:04,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:46:04,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:46:04,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,711 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (1/1) ... [2021-03-25 04:46:04,714 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:46:04,715 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:46:04,715 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:46:04,715 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:46:04,716 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (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:46:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:46:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:46:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:46:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:46:04,777 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:46:04,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:46:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:46:04,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:46:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:46:04,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:46:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:46:04,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:46:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:46:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:46:04,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:46:04,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:46:04,780 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:46:06,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:46:06,949 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:46:06,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:46:06 BoogieIcfgContainer [2021-03-25 04:46:06,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:46:06,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:46:06,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:46:06,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:46:06,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:46:04" (1/3) ... [2021-03-25 04:46:06,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:46:06, skipping insertion in model container [2021-03-25 04:46:06,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:46:04" (2/3) ... [2021-03-25 04:46:06,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b5ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:46:06, skipping insertion in model container [2021-03-25 04:46:06,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:46:06" (3/3) ... [2021-03-25 04:46:06,957 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2021-03-25 04:46:06,962 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:46:06,965 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:46:06,966 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:46:06,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:06,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:06,999 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:06,999 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:06,999 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,000 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,000 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,000 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,001 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,002 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,003 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,003 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,004 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,004 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,004 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,004 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,004 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,005 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,005 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,008 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,009 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,009 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,009 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,009 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,009 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,010 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,012 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,013 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,013 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,013 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,013 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,014 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,015 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,016 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,017 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,021 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,022 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,023 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,025 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,026 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,027 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,027 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,028 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,028 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:46:07,029 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:46:07,045 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:46:07,060 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:46:07,060 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:46:07,060 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:46:07,061 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:46:07,061 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:46:07,061 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:46:07,061 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:46:07,061 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:46:07,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-03-25 04:46:07,106 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-25 04:46:07,107 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:46:07,110 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:46:07,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-03-25 04:46:07,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-03-25 04:46:07,116 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:07,122 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-25 04:46:07,125 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-03-25 04:46:07,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-03-25 04:46:07,144 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-03-25 04:46:07,144 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:46:07,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 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/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-25 04:46:07,148 INFO L142 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-25 04:46:08,232 WARN L205 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 04:46:08,493 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 04:46:09,935 WARN L205 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 04:46:10,541 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 04:46:11,304 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:46:11,686 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 04:46:11,817 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:46:12,945 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:46:13,206 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:46:13,763 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:46:14,358 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:46:14,507 INFO L154 LiptonReduction]: Checked pairs total: 5220 [2021-03-25 04:46:14,507 INFO L156 LiptonReduction]: Total number of compositions: 76 [2021-03-25 04:46:14,509 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7394 [2021-03-25 04:46:14,532 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-25 04:46:14,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:46:14,532 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:14,533 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:46:14,533 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:46:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1034007324, now seen corresponding path program 1 times [2021-03-25 04:46:14,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:14,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897748815] [2021-03-25 04:46:14,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:14,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:14,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:14,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:14,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:14,806 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:46:14,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897748815] [2021-03-25 04:46:14,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:14,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:46:14,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516004580] [2021-03-25 04:46:14,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:46:14,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:46:14,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:46:14,823 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 195 [2021-03-25 04:46:14,825 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 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:46:14,825 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:14,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 195 [2021-03-25 04:46:14,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:14,952 INFO L129 PetriNetUnfolder]: 185/412 cut-off events. [2021-03-25 04:46:14,952 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:46:14,954 INFO L84 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 412 events. 185/412 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2212 event pairs, 123 based on Foata normal form. 20/393 useless extension candidates. Maximal degree in co-relation 685. Up to 209 conditions per place. [2021-03-25 04:46:14,956 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 11 selfloop transitions, 2 changer transitions 4/50 dead transitions. [2021-03-25 04:46:14,956 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 142 flow [2021-03-25 04:46:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:46:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:46:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-25 04:46:14,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9179487179487179 [2021-03-25 04:46:14,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-25 04:46:14,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-25 04:46:14,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:14,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-25 04:46:14,976 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:46:14,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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:46:14,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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:46:14,983 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 3 states and 537 transitions. [2021-03-25 04:46:14,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 142 flow [2021-03-25 04:46:14,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 138 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:46:14,987 INFO L241 Difference]: Finished difference. Result has 55 places, 41 transitions, 94 flow [2021-03-25 04:46:14,989 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2021-03-25 04:46:14,990 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-03-25 04:46:14,990 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:14,990 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 41 transitions, 94 flow [2021-03-25 04:46:14,990 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 41 transitions, 94 flow [2021-03-25 04:46:14,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-25 04:46:14,995 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 04:46:14,995 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:46:14,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:46:14,996 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-25 04:46:15,141 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-25 04:46:15,242 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-03-25 04:46:15,478 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 04:46:15,637 WARN L205 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 04:46:16,472 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 190 [2021-03-25 04:46:16,745 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:46:17,940 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-25 04:46:18,512 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:46:19,028 INFO L154 LiptonReduction]: Checked pairs total: 2261 [2021-03-25 04:46:19,028 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 04:46:19,028 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4038 [2021-03-25 04:46:19,029 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 72 flow [2021-03-25 04:46:19,029 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:46:19,029 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:19,029 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:46:19,029 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:46:19,029 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:46:19,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:19,030 INFO L82 PathProgramCache]: Analyzing trace with hash 48708481, now seen corresponding path program 1 times [2021-03-25 04:46:19,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:19,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174589746] [2021-03-25 04:46:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:19,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:19,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:19,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:19,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:19,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:19,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:19,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:19,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:46:19,195 INFO L142 QuantifierPusher]: treesize reduction 11, result has 47.6 percent of original size [2021-03-25 04:46:19,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:19,203 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:46:19,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:46:19,209 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:46:19,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174589746] [2021-03-25 04:46:19,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:19,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:46:19,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94587550] [2021-03-25 04:46:19,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:46:19,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:46:19,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:46:19,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 206 [2021-03-25 04:46:19,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 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:46:19,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:19,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 206 [2021-03-25 04:46:19,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:19,336 INFO L129 PetriNetUnfolder]: 225/407 cut-off events. [2021-03-25 04:46:19,336 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-03-25 04:46:19,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 407 events. 225/407 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2041 event pairs, 150 based on Foata normal form. 4/388 useless extension candidates. Maximal degree in co-relation 776. Up to 316 conditions per place. [2021-03-25 04:46:19,340 INFO L132 encePairwiseOnDemand]: 197/206 looper letters, 11 selfloop transitions, 10 changer transitions 0/41 dead transitions. [2021-03-25 04:46:19,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 138 flow [2021-03-25 04:46:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:46:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:46:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2021-03-25 04:46:19,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8131067961165048 [2021-03-25 04:46:19,343 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 670 transitions. [2021-03-25 04:46:19,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 670 transitions. [2021-03-25 04:46:19,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:19,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 670 transitions. [2021-03-25 04:46:19,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.5) internal successors, (670), 4 states have internal predecessors, (670), 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:46:19,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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:46:19,348 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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:46:19,348 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 72 flow. Second operand 4 states and 670 transitions. [2021-03-25 04:46:19,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 138 flow [2021-03-25 04:46:19,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:46:19,349 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 132 flow [2021-03-25 04:46:19,350 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-03-25 04:46:19,350 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -15 predicate places. [2021-03-25 04:46:19,350 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:19,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 132 flow [2021-03-25 04:46:19,351 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 132 flow [2021-03-25 04:46:19,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 132 flow [2021-03-25 04:46:19,376 INFO L129 PetriNetUnfolder]: 77/216 cut-off events. [2021-03-25 04:46:19,376 INFO L130 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2021-03-25 04:46:19,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 216 events. 77/216 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1033 event pairs, 31 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 410. Up to 117 conditions per place. [2021-03-25 04:46:19,379 INFO L142 LiptonReduction]: Number of co-enabled transitions 564 [2021-03-25 04:46:20,045 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:46:20,196 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:46:20,523 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 04:46:20,694 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 04:46:20,710 INFO L154 LiptonReduction]: Checked pairs total: 978 [2021-03-25 04:46:20,710 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:46:20,710 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1360 [2021-03-25 04:46:20,711 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 126 flow [2021-03-25 04:46:20,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 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:46:20,712 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:20,712 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:20,712 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:46:20,712 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:46:20,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:20,712 INFO L82 PathProgramCache]: Analyzing trace with hash 160874809, now seen corresponding path program 1 times [2021-03-25 04:46:20,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:20,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137935691] [2021-03-25 04:46:20,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:20,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:20,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:20,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:20,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:20,855 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:46:20,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137935691] [2021-03-25 04:46:20,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:20,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:46:20,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115095754] [2021-03-25 04:46:20,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:46:20,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:46:20,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:46:20,858 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 208 [2021-03-25 04:46:20,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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:46:20,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:20,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 208 [2021-03-25 04:46:20,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:20,916 INFO L129 PetriNetUnfolder]: 172/363 cut-off events. [2021-03-25 04:46:20,916 INFO L130 PetriNetUnfolder]: For 127/163 co-relation queries the response was YES. [2021-03-25 04:46:20,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 363 events. 172/363 cut-off events. For 127/163 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1912 event pairs, 98 based on Foata normal form. 6/320 useless extension candidates. Maximal degree in co-relation 799. Up to 231 conditions per place. [2021-03-25 04:46:20,919 INFO L132 encePairwiseOnDemand]: 204/208 looper letters, 4 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 04:46:20,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 144 flow [2021-03-25 04:46:20,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:46:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:46:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-25 04:46:20,922 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9006410256410257 [2021-03-25 04:46:20,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-25 04:46:20,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-25 04:46:20,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:20,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-25 04:46:20,923 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:46:20,924 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:46:20,925 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:46:20,925 INFO L185 Difference]: Start difference. First operand has 42 places, 36 transitions, 126 flow. Second operand 3 states and 562 transitions. [2021-03-25 04:46:20,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 144 flow [2021-03-25 04:46:20,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 142 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 04:46:20,927 INFO L241 Difference]: Finished difference. Result has 45 places, 38 transitions, 145 flow [2021-03-25 04:46:20,927 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2021-03-25 04:46:20,927 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -14 predicate places. [2021-03-25 04:46:20,927 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:20,928 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 145 flow [2021-03-25 04:46:20,928 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 145 flow [2021-03-25 04:46:20,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 145 flow [2021-03-25 04:46:20,962 INFO L129 PetriNetUnfolder]: 117/307 cut-off events. [2021-03-25 04:46:20,962 INFO L130 PetriNetUnfolder]: For 85/94 co-relation queries the response was YES. [2021-03-25 04:46:20,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 307 events. 117/307 cut-off events. For 85/94 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1681 event pairs, 47 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 638. Up to 169 conditions per place. [2021-03-25 04:46:20,966 INFO L142 LiptonReduction]: Number of co-enabled transitions 614 [2021-03-25 04:46:20,975 INFO L154 LiptonReduction]: Checked pairs total: 293 [2021-03-25 04:46:20,975 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:20,975 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 48 [2021-03-25 04:46:20,976 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 145 flow [2021-03-25 04:46:20,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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:46:20,976 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:20,977 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:20,977 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:46:20,977 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:46:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:20,977 INFO L82 PathProgramCache]: Analyzing trace with hash -407491586, now seen corresponding path program 1 times [2021-03-25 04:46:20,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:20,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962561519] [2021-03-25 04:46:20,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:21,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:21,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:21,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:21,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:21,090 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:46:21,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962561519] [2021-03-25 04:46:21,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:21,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:46:21,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337796753] [2021-03-25 04:46:21,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:46:21,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:21,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:46:21,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:46:21,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 208 [2021-03-25 04:46:21,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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:46:21,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:21,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 208 [2021-03-25 04:46:21,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:21,169 INFO L129 PetriNetUnfolder]: 204/433 cut-off events. [2021-03-25 04:46:21,169 INFO L130 PetriNetUnfolder]: For 334/480 co-relation queries the response was YES. [2021-03-25 04:46:21,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 433 events. 204/433 cut-off events. For 334/480 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2442 event pairs, 120 based on Foata normal form. 34/426 useless extension candidates. Maximal degree in co-relation 976. Up to 287 conditions per place. [2021-03-25 04:46:21,174 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 4 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 04:46:21,174 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 159 flow [2021-03-25 04:46:21,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:46:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:46:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2021-03-25 04:46:21,176 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8990384615384616 [2021-03-25 04:46:21,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2021-03-25 04:46:21,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2021-03-25 04:46:21,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:21,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2021-03-25 04:46:21,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 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:46:21,179 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:46:21,180 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:46:21,180 INFO L185 Difference]: Start difference. First operand has 45 places, 38 transitions, 145 flow. Second operand 3 states and 561 transitions. [2021-03-25 04:46:21,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 159 flow [2021-03-25 04:46:21,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:21,183 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 155 flow [2021-03-25 04:46:21,183 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-25 04:46:21,183 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -12 predicate places. [2021-03-25 04:46:21,183 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:21,184 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 155 flow [2021-03-25 04:46:21,184 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 155 flow [2021-03-25 04:46:21,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 155 flow [2021-03-25 04:46:21,231 INFO L129 PetriNetUnfolder]: 148/395 cut-off events. [2021-03-25 04:46:21,232 INFO L130 PetriNetUnfolder]: For 159/202 co-relation queries the response was YES. [2021-03-25 04:46:21,233 INFO L84 FinitePrefix]: Finished finitePrefix Result has 842 conditions, 395 events. 148/395 cut-off events. For 159/202 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2423 event pairs, 61 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 829. Up to 225 conditions per place. [2021-03-25 04:46:21,237 INFO L142 LiptonReduction]: Number of co-enabled transitions 614 [2021-03-25 04:46:21,250 INFO L154 LiptonReduction]: Checked pairs total: 318 [2021-03-25 04:46:21,250 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:21,251 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-25 04:46:21,251 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 155 flow [2021-03-25 04:46:21,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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:46:21,252 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:21,252 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:21,252 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:46:21,252 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:46:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1225126864, now seen corresponding path program 1 times [2021-03-25 04:46:21,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:21,253 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663186794] [2021-03-25 04:46:21,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:21,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:21,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:21,330 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:46:21,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663186794] [2021-03-25 04:46:21,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:21,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:46:21,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343822148] [2021-03-25 04:46:21,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:46:21,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:21,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:46:21,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:46:21,337 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 208 [2021-03-25 04:46:21,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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:46:21,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:21,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 208 [2021-03-25 04:46:21,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:21,402 INFO L129 PetriNetUnfolder]: 204/433 cut-off events. [2021-03-25 04:46:21,402 INFO L130 PetriNetUnfolder]: For 607/753 co-relation queries the response was YES. [2021-03-25 04:46:21,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 433 events. 204/433 cut-off events. For 607/753 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2414 event pairs, 120 based on Foata normal form. 14/406 useless extension candidates. Maximal degree in co-relation 1018. Up to 287 conditions per place. [2021-03-25 04:46:21,406 INFO L132 encePairwiseOnDemand]: 205/208 looper letters, 2 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-03-25 04:46:21,406 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 163 flow [2021-03-25 04:46:21,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:46:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:46:21,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 568 transitions. [2021-03-25 04:46:21,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9102564102564102 [2021-03-25 04:46:21,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 568 transitions. [2021-03-25 04:46:21,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 568 transitions. [2021-03-25 04:46:21,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:21,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 568 transitions. [2021-03-25 04:46:21,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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:46:21,411 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:46:21,412 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:46:21,412 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 155 flow. Second operand 3 states and 568 transitions. [2021-03-25 04:46:21,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 163 flow [2021-03-25 04:46:21,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:21,416 INFO L241 Difference]: Finished difference. Result has 49 places, 38 transitions, 160 flow [2021-03-25 04:46:21,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2021-03-25 04:46:21,417 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2021-03-25 04:46:21,417 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:21,417 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 38 transitions, 160 flow [2021-03-25 04:46:21,417 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 38 transitions, 160 flow [2021-03-25 04:46:21,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 160 flow [2021-03-25 04:46:21,458 INFO L129 PetriNetUnfolder]: 139/375 cut-off events. [2021-03-25 04:46:21,459 INFO L130 PetriNetUnfolder]: For 308/367 co-relation queries the response was YES. [2021-03-25 04:46:21,460 INFO L84 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 375 events. 139/375 cut-off events. For 308/367 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2254 event pairs, 53 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 823. Up to 209 conditions per place. [2021-03-25 04:46:21,464 INFO L142 LiptonReduction]: Number of co-enabled transitions 610 [2021-03-25 04:46:21,552 INFO L154 LiptonReduction]: Checked pairs total: 601 [2021-03-25 04:46:21,552 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:46:21,553 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 136 [2021-03-25 04:46:21,553 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 161 flow [2021-03-25 04:46:21,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 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:46:21,554 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:21,554 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:21,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:46:21,554 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:46:21,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash -748150989, now seen corresponding path program 1 times [2021-03-25 04:46:21,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:21,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982962960] [2021-03-25 04:46:21,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:21,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:21,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:21,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:21,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:21,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:21,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:21,673 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:46:21,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982962960] [2021-03-25 04:46:21,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:21,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:46:21,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340525169] [2021-03-25 04:46:21,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:46:21,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:46:21,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:46:21,675 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 210 [2021-03-25 04:46:21,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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:46:21,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:21,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 210 [2021-03-25 04:46:21,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:21,815 INFO L129 PetriNetUnfolder]: 403/745 cut-off events. [2021-03-25 04:46:21,815 INFO L130 PetriNetUnfolder]: For 657/1254 co-relation queries the response was YES. [2021-03-25 04:46:21,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 745 events. 403/745 cut-off events. For 657/1254 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4309 event pairs, 266 based on Foata normal form. 12/696 useless extension candidates. Maximal degree in co-relation 2206. Up to 599 conditions per place. [2021-03-25 04:46:21,822 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 19 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2021-03-25 04:46:21,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 49 transitions, 275 flow [2021-03-25 04:46:21,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:46:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:46:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2021-03-25 04:46:21,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2021-03-25 04:46:21,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 535 transitions. [2021-03-25 04:46:21,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 535 transitions. [2021-03-25 04:46:21,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:21,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 535 transitions. [2021-03-25 04:46:21,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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:46:21,828 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:46:21,828 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:46:21,828 INFO L185 Difference]: Start difference. First operand has 48 places, 37 transitions, 161 flow. Second operand 3 states and 535 transitions. [2021-03-25 04:46:21,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 49 transitions, 275 flow [2021-03-25 04:46:21,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:46:21,832 INFO L241 Difference]: Finished difference. Result has 49 places, 46 transitions, 248 flow [2021-03-25 04:46:21,832 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2021-03-25 04:46:21,832 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2021-03-25 04:46:21,832 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:21,833 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 46 transitions, 248 flow [2021-03-25 04:46:21,833 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 46 transitions, 248 flow [2021-03-25 04:46:21,833 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 248 flow [2021-03-25 04:46:21,913 INFO L129 PetriNetUnfolder]: 226/520 cut-off events. [2021-03-25 04:46:21,913 INFO L130 PetriNetUnfolder]: For 522/724 co-relation queries the response was YES. [2021-03-25 04:46:21,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 520 events. 226/520 cut-off events. For 522/724 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3131 event pairs, 61 based on Foata normal form. 4/485 useless extension candidates. Maximal degree in co-relation 1424. Up to 294 conditions per place. [2021-03-25 04:46:21,920 INFO L142 LiptonReduction]: Number of co-enabled transitions 670 [2021-03-25 04:46:21,950 INFO L154 LiptonReduction]: Checked pairs total: 420 [2021-03-25 04:46:21,950 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:21,950 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-25 04:46:21,952 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 248 flow [2021-03-25 04:46:21,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 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:46:21,952 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:21,952 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:21,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:46:21,953 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:46:21,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:21,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1632144019, now seen corresponding path program 1 times [2021-03-25 04:46:21,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:21,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971102805] [2021-03-25 04:46:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:22,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:22,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:22,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:22,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:46:22,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:22,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:22,054 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:46:22,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971102805] [2021-03-25 04:46:22,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:22,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:46:22,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136170362] [2021-03-25 04:46:22,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:46:22,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:22,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:46:22,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:46:22,057 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 210 [2021-03-25 04:46:22,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 248 flow. Second operand has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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:46:22,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:22,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 210 [2021-03-25 04:46:22,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:22,256 INFO L129 PetriNetUnfolder]: 419/775 cut-off events. [2021-03-25 04:46:22,256 INFO L130 PetriNetUnfolder]: For 1058/2188 co-relation queries the response was YES. [2021-03-25 04:46:22,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 775 events. 419/775 cut-off events. For 1058/2188 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4438 event pairs, 155 based on Foata normal form. 40/765 useless extension candidates. Maximal degree in co-relation 2703. Up to 479 conditions per place. [2021-03-25 04:46:22,263 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 29 selfloop transitions, 9 changer transitions 0/58 dead transitions. [2021-03-25 04:46:22,263 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 392 flow [2021-03-25 04:46:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:46:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:46:22,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions. [2021-03-25 04:46:22,266 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8202380952380952 [2021-03-25 04:46:22,266 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 689 transitions. [2021-03-25 04:46:22,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 689 transitions. [2021-03-25 04:46:22,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:22,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 689 transitions. [2021-03-25 04:46:22,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 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:46:22,269 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:46:22,270 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:46:22,270 INFO L185 Difference]: Start difference. First operand has 49 places, 46 transitions, 248 flow. Second operand 4 states and 689 transitions. [2021-03-25 04:46:22,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 392 flow [2021-03-25 04:46:22,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 380 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:22,275 INFO L241 Difference]: Finished difference. Result has 52 places, 50 transitions, 288 flow [2021-03-25 04:46:22,275 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2021-03-25 04:46:22,275 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2021-03-25 04:46:22,275 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:22,275 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 50 transitions, 288 flow [2021-03-25 04:46:22,276 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 50 transitions, 288 flow [2021-03-25 04:46:22,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 288 flow [2021-03-25 04:46:22,363 INFO L129 PetriNetUnfolder]: 357/711 cut-off events. [2021-03-25 04:46:22,363 INFO L130 PetriNetUnfolder]: For 1567/1963 co-relation queries the response was YES. [2021-03-25 04:46:22,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 711 events. 357/711 cut-off events. For 1567/1963 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4336 event pairs, 69 based on Foata normal form. 9/641 useless extension candidates. Maximal degree in co-relation 2364. Up to 417 conditions per place. [2021-03-25 04:46:22,374 INFO L142 LiptonReduction]: Number of co-enabled transitions 740 [2021-03-25 04:46:22,408 INFO L154 LiptonReduction]: Checked pairs total: 491 [2021-03-25 04:46:22,408 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:22,408 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 133 [2021-03-25 04:46:22,409 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 288 flow [2021-03-25 04:46:22,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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:46:22,409 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:22,409 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:46:22,410 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:46:22,410 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:46:22,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:22,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1221848352, now seen corresponding path program 1 times [2021-03-25 04:46:22,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:22,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784001507] [2021-03-25 04:46:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:22,474 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 04:46:22,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 04:46:22,503 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 04:46:22,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 04:46:22,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:22,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:22,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:22,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:22,549 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:46:22,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784001507] [2021-03-25 04:46:22,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:22,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:46:22,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872770696] [2021-03-25 04:46:22,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:46:22,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:22,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:46:22,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:46:22,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 210 [2021-03-25 04:46:22,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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:46:22,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:22,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 210 [2021-03-25 04:46:22,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:22,708 INFO L129 PetriNetUnfolder]: 415/800 cut-off events. [2021-03-25 04:46:22,708 INFO L130 PetriNetUnfolder]: For 1473/2920 co-relation queries the response was YES. [2021-03-25 04:46:22,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3129 conditions, 800 events. 415/800 cut-off events. For 1473/2920 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4732 event pairs, 125 based on Foata normal form. 33/777 useless extension candidates. Maximal degree in co-relation 3109. Up to 599 conditions per place. [2021-03-25 04:46:22,715 INFO L132 encePairwiseOnDemand]: 205/210 looper letters, 24 selfloop transitions, 15 changer transitions 0/59 dead transitions. [2021-03-25 04:46:22,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 427 flow [2021-03-25 04:46:22,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:46:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:46:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 511 transitions. [2021-03-25 04:46:22,718 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2021-03-25 04:46:22,718 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 511 transitions. [2021-03-25 04:46:22,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 511 transitions. [2021-03-25 04:46:22,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:22,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 511 transitions. [2021-03-25 04:46:22,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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:46:22,720 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:46:22,721 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:46:22,721 INFO L185 Difference]: Start difference. First operand has 52 places, 50 transitions, 288 flow. Second operand 3 states and 511 transitions. [2021-03-25 04:46:22,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 427 flow [2021-03-25 04:46:22,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 59 transitions, 416 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:22,725 INFO L241 Difference]: Finished difference. Result has 54 places, 56 transitions, 383 flow [2021-03-25 04:46:22,725 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=54, PETRI_TRANSITIONS=56} [2021-03-25 04:46:22,725 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2021-03-25 04:46:22,725 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:22,725 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 56 transitions, 383 flow [2021-03-25 04:46:22,725 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 56 transitions, 383 flow [2021-03-25 04:46:22,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 383 flow [2021-03-25 04:46:22,810 INFO L129 PetriNetUnfolder]: 348/712 cut-off events. [2021-03-25 04:46:22,811 INFO L130 PetriNetUnfolder]: For 2247/2851 co-relation queries the response was YES. [2021-03-25 04:46:22,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2648 conditions, 712 events. 348/712 cut-off events. For 2247/2851 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4458 event pairs, 77 based on Foata normal form. 10/632 useless extension candidates. Maximal degree in co-relation 2628. Up to 420 conditions per place. [2021-03-25 04:46:22,821 INFO L142 LiptonReduction]: Number of co-enabled transitions 794 [2021-03-25 04:46:22,871 INFO L154 LiptonReduction]: Checked pairs total: 856 [2021-03-25 04:46:22,871 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:22,871 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 146 [2021-03-25 04:46:22,871 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 56 transitions, 383 flow [2021-03-25 04:46:22,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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:46:22,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:22,872 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:22,872 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:46:22,872 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:46:22,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash 306295738, now seen corresponding path program 1 times [2021-03-25 04:46:22,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:22,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142269042] [2021-03-25 04:46:22,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:22,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:22,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 04:46:22,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:22,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 04:46:23,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:23,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:46:23,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:23,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:46:23,043 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:46:23,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142269042] [2021-03-25 04:46:23,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:23,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:46:23,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006425858] [2021-03-25 04:46:23,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:46:23,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:23,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:46:23,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:46:23,045 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 210 [2021-03-25 04:46:23,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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:46:23,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:23,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 210 [2021-03-25 04:46:23,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:23,246 INFO L129 PetriNetUnfolder]: 422/800 cut-off events. [2021-03-25 04:46:23,246 INFO L130 PetriNetUnfolder]: For 2314/4244 co-relation queries the response was YES. [2021-03-25 04:46:23,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 800 events. 422/800 cut-off events. For 2314/4244 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4642 event pairs, 176 based on Foata normal form. 64/811 useless extension candidates. Maximal degree in co-relation 3397. Up to 592 conditions per place. [2021-03-25 04:46:23,256 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 21 selfloop transitions, 25 changer transitions 0/66 dead transitions. [2021-03-25 04:46:23,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 551 flow [2021-03-25 04:46:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:46:23,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:46:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 636 transitions. [2021-03-25 04:46:23,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7571428571428571 [2021-03-25 04:46:23,258 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 636 transitions. [2021-03-25 04:46:23,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 636 transitions. [2021-03-25 04:46:23,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:23,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 636 transitions. [2021-03-25 04:46:23,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 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:46:23,261 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:46:23,263 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:46:23,263 INFO L185 Difference]: Start difference. First operand has 54 places, 56 transitions, 383 flow. Second operand 4 states and 636 transitions. [2021-03-25 04:46:23,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 551 flow [2021-03-25 04:46:23,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 525 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:23,267 INFO L241 Difference]: Finished difference. Result has 57 places, 63 transitions, 502 flow [2021-03-25 04:46:23,267 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=502, PETRI_PLACES=57, PETRI_TRANSITIONS=63} [2021-03-25 04:46:23,267 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2021-03-25 04:46:23,267 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:23,268 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 63 transitions, 502 flow [2021-03-25 04:46:23,268 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 63 transitions, 502 flow [2021-03-25 04:46:23,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 63 transitions, 502 flow [2021-03-25 04:46:23,355 INFO L129 PetriNetUnfolder]: 357/722 cut-off events. [2021-03-25 04:46:23,355 INFO L130 PetriNetUnfolder]: For 2737/3339 co-relation queries the response was YES. [2021-03-25 04:46:23,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 722 events. 357/722 cut-off events. For 2737/3339 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4529 event pairs, 85 based on Foata normal form. 17/646 useless extension candidates. Maximal degree in co-relation 3024. Up to 430 conditions per place. [2021-03-25 04:46:23,365 INFO L142 LiptonReduction]: Number of co-enabled transitions 844 [2021-03-25 04:46:23,421 INFO L154 LiptonReduction]: Checked pairs total: 1080 [2021-03-25 04:46:23,422 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:23,422 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 155 [2021-03-25 04:46:23,422 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 63 transitions, 502 flow [2021-03-25 04:46:23,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 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:46:23,423 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:23,423 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:23,423 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:46:23,423 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:46:23,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:23,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1484797856, now seen corresponding path program 1 times [2021-03-25 04:46:23,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:23,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728243469] [2021-03-25 04:46:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:23,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:23,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:46:23,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:23,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 04:46:23,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:23,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:46:23,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:23,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:23,565 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:46:23,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728243469] [2021-03-25 04:46:23,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:23,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:46:23,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310171561] [2021-03-25 04:46:23,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:46:23,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:23,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:46:23,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:46:23,567 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 210 [2021-03-25 04:46:23,568 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 63 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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:46:23,568 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:23,568 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 210 [2021-03-25 04:46:23,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:23,790 INFO L129 PetriNetUnfolder]: 489/917 cut-off events. [2021-03-25 04:46:23,791 INFO L130 PetriNetUnfolder]: For 4507/7642 co-relation queries the response was YES. [2021-03-25 04:46:23,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4256 conditions, 917 events. 489/917 cut-off events. For 4507/7642 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5475 event pairs, 80 based on Foata normal form. 116/976 useless extension candidates. Maximal degree in co-relation 4232. Up to 528 conditions per place. [2021-03-25 04:46:23,799 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 43 selfloop transitions, 15 changer transitions 0/78 dead transitions. [2021-03-25 04:46:23,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 78 transitions, 743 flow [2021-03-25 04:46:23,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:46:23,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:46:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 852 transitions. [2021-03-25 04:46:23,803 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8114285714285714 [2021-03-25 04:46:23,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 852 transitions. [2021-03-25 04:46:23,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 852 transitions. [2021-03-25 04:46:23,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:23,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 852 transitions. [2021-03-25 04:46:23,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 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:46:23,807 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:46:23,807 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:46:23,807 INFO L185 Difference]: Start difference. First operand has 57 places, 63 transitions, 502 flow. Second operand 5 states and 852 transitions. [2021-03-25 04:46:23,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 78 transitions, 743 flow [2021-03-25 04:46:23,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 78 transitions, 712 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 04:46:23,812 INFO L241 Difference]: Finished difference. Result has 61 places, 69 transitions, 584 flow [2021-03-25 04:46:23,813 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=584, PETRI_PLACES=61, PETRI_TRANSITIONS=69} [2021-03-25 04:46:23,813 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2021-03-25 04:46:23,813 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:23,813 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 69 transitions, 584 flow [2021-03-25 04:46:23,814 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 69 transitions, 584 flow [2021-03-25 04:46:23,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 69 transitions, 584 flow [2021-03-25 04:46:23,936 INFO L129 PetriNetUnfolder]: 416/837 cut-off events. [2021-03-25 04:46:23,937 INFO L130 PetriNetUnfolder]: For 5025/6525 co-relation queries the response was YES. [2021-03-25 04:46:23,940 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4024 conditions, 837 events. 416/837 cut-off events. For 5025/6525 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5252 event pairs, 96 based on Foata normal form. 26/760 useless extension candidates. Maximal degree in co-relation 4000. Up to 483 conditions per place. [2021-03-25 04:46:23,953 INFO L142 LiptonReduction]: Number of co-enabled transitions 948 [2021-03-25 04:46:24,059 INFO L154 LiptonReduction]: Checked pairs total: 1114 [2021-03-25 04:46:24,059 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:24,059 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 246 [2021-03-25 04:46:24,061 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 584 flow [2021-03-25 04:46:24,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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:46:24,061 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:24,061 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:24,062 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:46:24,062 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:46:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1177190275, now seen corresponding path program 1 times [2021-03-25 04:46:24,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:24,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361937888] [2021-03-25 04:46:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:24,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:24,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:24,125 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 04:46:24,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 04:46:24,143 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:46:24,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:46:24,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:24,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:46:24,177 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:46:24,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361937888] [2021-03-25 04:46:24,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:24,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:46:24,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793182898] [2021-03-25 04:46:24,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:46:24,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:24,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:46:24,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:46:24,182 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2021-03-25 04:46:24,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 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:46:24,183 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:24,183 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2021-03-25 04:46:24,183 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:24,444 INFO L129 PetriNetUnfolder]: 560/1105 cut-off events. [2021-03-25 04:46:24,444 INFO L130 PetriNetUnfolder]: For 7056/13384 co-relation queries the response was YES. [2021-03-25 04:46:24,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5641 conditions, 1105 events. 560/1105 cut-off events. For 7056/13384 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 7128 event pairs, 38 based on Foata normal form. 149/1192 useless extension candidates. Maximal degree in co-relation 5615. Up to 618 conditions per place. [2021-03-25 04:46:24,455 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 41 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2021-03-25 04:46:24,455 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 863 flow [2021-03-25 04:46:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:46:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:46:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 997 transitions. [2021-03-25 04:46:24,458 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7912698412698412 [2021-03-25 04:46:24,458 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 997 transitions. [2021-03-25 04:46:24,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 997 transitions. [2021-03-25 04:46:24,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:24,459 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 997 transitions. [2021-03-25 04:46:24,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 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:46:24,464 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:46:24,464 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:46:24,464 INFO L185 Difference]: Start difference. First operand has 61 places, 69 transitions, 584 flow. Second operand 6 states and 997 transitions. [2021-03-25 04:46:24,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 863 flow [2021-03-25 04:46:24,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 84 transitions, 816 flow, removed 19 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:24,472 INFO L241 Difference]: Finished difference. Result has 67 places, 76 transitions, 708 flow [2021-03-25 04:46:24,473 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=67, PETRI_TRANSITIONS=76} [2021-03-25 04:46:24,473 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2021-03-25 04:46:24,473 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:24,473 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 76 transitions, 708 flow [2021-03-25 04:46:24,473 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 76 transitions, 708 flow [2021-03-25 04:46:24,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 76 transitions, 708 flow [2021-03-25 04:46:24,591 INFO L129 PetriNetUnfolder]: 496/963 cut-off events. [2021-03-25 04:46:24,591 INFO L130 PetriNetUnfolder]: For 6242/7926 co-relation queries the response was YES. [2021-03-25 04:46:24,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5004 conditions, 963 events. 496/963 cut-off events. For 6242/7926 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5991 event pairs, 82 based on Foata normal form. 35/900 useless extension candidates. Maximal degree in co-relation 4977. Up to 567 conditions per place. [2021-03-25 04:46:24,609 INFO L142 LiptonReduction]: Number of co-enabled transitions 1086 [2021-03-25 04:46:24,885 INFO L154 LiptonReduction]: Checked pairs total: 1551 [2021-03-25 04:46:24,885 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:24,885 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 412 [2021-03-25 04:46:24,885 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 76 transitions, 708 flow [2021-03-25 04:46:24,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 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:46:24,886 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:24,886 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:46:24,886 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:46:24,886 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:46:24,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:24,887 INFO L82 PathProgramCache]: Analyzing trace with hash 251317796, now seen corresponding path program 1 times [2021-03-25 04:46:24,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:24,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385832639] [2021-03-25 04:46:24,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:24,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:24,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:24,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:24,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:24,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:24,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:24,932 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:46:24,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385832639] [2021-03-25 04:46:24,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:24,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:46:24,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249719835] [2021-03-25 04:46:24,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:46:24,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:24,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:46:24,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:46:24,934 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:46:24,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 76 transitions, 708 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:46:24,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:24,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:46:24,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:25,304 INFO L129 PetriNetUnfolder]: 1418/2583 cut-off events. [2021-03-25 04:46:25,304 INFO L130 PetriNetUnfolder]: For 13630/16076 co-relation queries the response was YES. [2021-03-25 04:46:25,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10360 conditions, 2583 events. 1418/2583 cut-off events. For 13630/16076 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 19118 event pairs, 467 based on Foata normal form. 467/2787 useless extension candidates. Maximal degree in co-relation 10331. Up to 1224 conditions per place. [2021-03-25 04:46:25,338 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 11 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2021-03-25 04:46:25,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 85 transitions, 735 flow [2021-03-25 04:46:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:46:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:46:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 912 transitions. [2021-03-25 04:46:25,341 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8685714285714285 [2021-03-25 04:46:25,341 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 912 transitions. [2021-03-25 04:46:25,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 912 transitions. [2021-03-25 04:46:25,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:25,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 912 transitions. [2021-03-25 04:46:25,344 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:46:25,345 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:46:25,346 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:46:25,346 INFO L185 Difference]: Start difference. First operand has 67 places, 76 transitions, 708 flow. Second operand 5 states and 912 transitions. [2021-03-25 04:46:25,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 85 transitions, 735 flow [2021-03-25 04:46:25,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 699 flow, removed 15 selfloop flow, removed 2 redundant places. [2021-03-25 04:46:25,359 INFO L241 Difference]: Finished difference. Result has 72 places, 81 transitions, 710 flow [2021-03-25 04:46:25,359 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=710, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2021-03-25 04:46:25,359 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2021-03-25 04:46:25,359 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:25,359 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 81 transitions, 710 flow [2021-03-25 04:46:25,360 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 81 transitions, 710 flow [2021-03-25 04:46:25,360 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 81 transitions, 710 flow [2021-03-25 04:46:25,622 INFO L129 PetriNetUnfolder]: 1412/2571 cut-off events. [2021-03-25 04:46:25,622 INFO L130 PetriNetUnfolder]: For 13189/15448 co-relation queries the response was YES. [2021-03-25 04:46:25,638 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11059 conditions, 2571 events. 1412/2571 cut-off events. For 13189/15448 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 19237 event pairs, 416 based on Foata normal form. 179/2438 useless extension candidates. Maximal degree in co-relation 11029. Up to 1262 conditions per place. [2021-03-25 04:46:25,671 INFO L142 LiptonReduction]: Number of co-enabled transitions 1462 [2021-03-25 04:46:25,966 INFO L154 LiptonReduction]: Checked pairs total: 1003 [2021-03-25 04:46:25,966 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:25,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 607 [2021-03-25 04:46:25,966 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 710 flow [2021-03-25 04:46:25,967 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:46:25,967 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:25,967 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:46:25,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:46:25,967 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:46:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1974409837, now seen corresponding path program 1 times [2021-03-25 04:46:25,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:25,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957865090] [2021-03-25 04:46:25,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:26,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:26,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:26,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:26,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:26,020 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:46:26,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957865090] [2021-03-25 04:46:26,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:26,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:46:26,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823580070] [2021-03-25 04:46:26,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:46:26,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:46:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:46:26,023 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:46:26,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 710 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:46:26,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:26,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:46:26,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:26,313 INFO L129 PetriNetUnfolder]: 850/1818 cut-off events. [2021-03-25 04:46:26,313 INFO L130 PetriNetUnfolder]: For 9183/14136 co-relation queries the response was YES. [2021-03-25 04:46:26,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8300 conditions, 1818 events. 850/1818 cut-off events. For 9183/14136 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 14435 event pairs, 114 based on Foata normal form. 937/2599 useless extension candidates. Maximal degree in co-relation 8268. Up to 1050 conditions per place. [2021-03-25 04:46:26,342 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 11 selfloop transitions, 19 changer transitions 0/90 dead transitions. [2021-03-25 04:46:26,343 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 90 transitions, 805 flow [2021-03-25 04:46:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:46:26,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:46:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1277 transitions. [2021-03-25 04:46:26,346 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8687074829931973 [2021-03-25 04:46:26,346 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1277 transitions. [2021-03-25 04:46:26,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1277 transitions. [2021-03-25 04:46:26,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:26,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1277 transitions. [2021-03-25 04:46:26,348 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:46:26,350 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:46:26,351 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:46:26,351 INFO L185 Difference]: Start difference. First operand has 72 places, 81 transitions, 710 flow. Second operand 7 states and 1277 transitions. [2021-03-25 04:46:26,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 90 transitions, 805 flow [2021-03-25 04:46:26,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 796 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:46:26,364 INFO L241 Difference]: Finished difference. Result has 80 places, 86 transitions, 798 flow [2021-03-25 04:46:26,364 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=798, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2021-03-25 04:46:26,365 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 21 predicate places. [2021-03-25 04:46:26,365 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:26,365 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 86 transitions, 798 flow [2021-03-25 04:46:26,365 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 86 transitions, 798 flow [2021-03-25 04:46:26,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 86 transitions, 798 flow [2021-03-25 04:46:26,561 INFO L129 PetriNetUnfolder]: 862/1835 cut-off events. [2021-03-25 04:46:26,562 INFO L130 PetriNetUnfolder]: For 12140/16471 co-relation queries the response was YES. [2021-03-25 04:46:26,575 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9357 conditions, 1835 events. 862/1835 cut-off events. For 12140/16471 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 14755 event pairs, 97 based on Foata normal form. 180/1838 useless extension candidates. Maximal degree in co-relation 9323. Up to 1050 conditions per place. [2021-03-25 04:46:26,591 INFO L142 LiptonReduction]: Number of co-enabled transitions 1764 [2021-03-25 04:46:26,679 INFO L154 LiptonReduction]: Checked pairs total: 1094 [2021-03-25 04:46:26,679 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:26,679 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 314 [2021-03-25 04:46:26,680 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 798 flow [2021-03-25 04:46:26,680 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:46:26,680 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:26,680 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:46:26,680 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:46:26,681 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:46:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1548106012, now seen corresponding path program 1 times [2021-03-25 04:46:26,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:26,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151088600] [2021-03-25 04:46:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:26,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:26,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:26,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:26,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:26,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:26,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:26,746 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:46:26,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151088600] [2021-03-25 04:46:26,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:26,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:46:26,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809040184] [2021-03-25 04:46:26,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:46:26,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:26,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:46:26,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:46:26,748 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:46:26,749 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 798 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:46:26,749 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:26,749 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:46:26,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:27,044 INFO L129 PetriNetUnfolder]: 617/1447 cut-off events. [2021-03-25 04:46:27,045 INFO L130 PetriNetUnfolder]: For 10894/21032 co-relation queries the response was YES. [2021-03-25 04:46:27,057 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7938 conditions, 1447 events. 617/1447 cut-off events. For 10894/21032 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 11733 event pairs, 16 based on Foata normal form. 1207/2517 useless extension candidates. Maximal degree in co-relation 7902. Up to 980 conditions per place. [2021-03-25 04:46:27,065 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 6 selfloop transitions, 28 changer transitions 4/96 dead transitions. [2021-03-25 04:46:27,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 96 transitions, 964 flow [2021-03-25 04:46:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 04:46:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 04:46:27,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1642 transitions. [2021-03-25 04:46:27,069 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8687830687830688 [2021-03-25 04:46:27,069 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1642 transitions. [2021-03-25 04:46:27,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1642 transitions. [2021-03-25 04:46:27,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:27,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1642 transitions. [2021-03-25 04:46:27,073 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:46:27,076 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:46:27,077 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:46:27,077 INFO L185 Difference]: Start difference. First operand has 80 places, 86 transitions, 798 flow. Second operand 9 states and 1642 transitions. [2021-03-25 04:46:27,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 96 transitions, 964 flow [2021-03-25 04:46:27,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 96 transitions, 892 flow, removed 20 selfloop flow, removed 5 redundant places. [2021-03-25 04:46:27,107 INFO L241 Difference]: Finished difference. Result has 86 places, 92 transitions, 868 flow [2021-03-25 04:46:27,107 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2021-03-25 04:46:27,107 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 27 predicate places. [2021-03-25 04:46:27,108 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:27,108 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 92 transitions, 868 flow [2021-03-25 04:46:27,108 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 92 transitions, 868 flow [2021-03-25 04:46:27,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 92 transitions, 868 flow [2021-03-25 04:46:27,241 INFO L129 PetriNetUnfolder]: 600/1419 cut-off events. [2021-03-25 04:46:27,241 INFO L130 PetriNetUnfolder]: For 10053/12431 co-relation queries the response was YES. [2021-03-25 04:46:27,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 1419 events. 600/1419 cut-off events. For 10053/12431 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 11712 event pairs, 10 based on Foata normal form. 56/1329 useless extension candidates. Maximal degree in co-relation 7026. Up to 601 conditions per place. [2021-03-25 04:46:27,266 INFO L142 LiptonReduction]: Number of co-enabled transitions 1882 [2021-03-25 04:46:27,442 INFO L154 LiptonReduction]: Checked pairs total: 2246 [2021-03-25 04:46:27,442 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:46:27,443 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 335 [2021-03-25 04:46:27,443 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 89 transitions, 842 flow [2021-03-25 04:46:27,444 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:46:27,444 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:27,444 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:46:27,444 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:46:27,444 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:46:27,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:27,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1171160019, now seen corresponding path program 1 times [2021-03-25 04:46:27,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:27,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866830743] [2021-03-25 04:46:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:27,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:27,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:27,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:27,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:27,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:27,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:27,512 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:46:27,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866830743] [2021-03-25 04:46:27,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:27,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:46:27,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310630313] [2021-03-25 04:46:27,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:46:27,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:46:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:46:27,514 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 210 [2021-03-25 04:46:27,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 89 transitions, 842 flow. Second operand has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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:46:27,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:27,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 210 [2021-03-25 04:46:27,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:27,677 INFO L129 PetriNetUnfolder]: 646/1421 cut-off events. [2021-03-25 04:46:27,678 INFO L130 PetriNetUnfolder]: For 8227/9686 co-relation queries the response was YES. [2021-03-25 04:46:27,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6849 conditions, 1421 events. 646/1421 cut-off events. For 8227/9686 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 10073 event pairs, 30 based on Foata normal form. 46/1388 useless extension candidates. Maximal degree in co-relation 6811. Up to 513 conditions per place. [2021-03-25 04:46:27,688 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 4 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2021-03-25 04:46:27,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 750 flow [2021-03-25 04:46:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:46:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:46:27,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 751 transitions. [2021-03-25 04:46:27,690 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8940476190476191 [2021-03-25 04:46:27,690 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 751 transitions. [2021-03-25 04:46:27,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 751 transitions. [2021-03-25 04:46:27,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:27,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 751 transitions. [2021-03-25 04:46:27,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 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:46:27,693 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:46:27,693 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:46:27,693 INFO L185 Difference]: Start difference. First operand has 86 places, 89 transitions, 842 flow. Second operand 4 states and 751 transitions. [2021-03-25 04:46:27,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 750 flow [2021-03-25 04:46:27,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 687 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-03-25 04:46:27,728 INFO L241 Difference]: Finished difference. Result has 76 places, 78 transitions, 660 flow [2021-03-25 04:46:27,728 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=660, PETRI_PLACES=76, PETRI_TRANSITIONS=78} [2021-03-25 04:46:27,728 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 17 predicate places. [2021-03-25 04:46:27,728 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:27,728 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 78 transitions, 660 flow [2021-03-25 04:46:27,729 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 78 transitions, 660 flow [2021-03-25 04:46:27,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 78 transitions, 660 flow [2021-03-25 04:46:27,832 INFO L129 PetriNetUnfolder]: 646/1409 cut-off events. [2021-03-25 04:46:27,832 INFO L130 PetriNetUnfolder]: For 5991/7075 co-relation queries the response was YES. [2021-03-25 04:46:27,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5858 conditions, 1409 events. 646/1409 cut-off events. For 5991/7075 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 10266 event pairs, 18 based on Foata normal form. 34/1352 useless extension candidates. Maximal degree in co-relation 5825. Up to 455 conditions per place. [2021-03-25 04:46:27,847 INFO L142 LiptonReduction]: Number of co-enabled transitions 1192 [2021-03-25 04:46:27,944 INFO L154 LiptonReduction]: Checked pairs total: 354 [2021-03-25 04:46:27,945 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:27,945 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 217 [2021-03-25 04:46:27,945 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 78 transitions, 660 flow [2021-03-25 04:46:27,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 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:46:27,945 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:27,945 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:46:27,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:46:27,946 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:46:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:27,946 INFO L82 PathProgramCache]: Analyzing trace with hash 543004853, now seen corresponding path program 2 times [2021-03-25 04:46:27,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:27,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014449328] [2021-03-25 04:46:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:27,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:28,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:28,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:28,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:28,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:28,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:28,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:28,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:28,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:28,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:46:28,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:28,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:28,025 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:46:28,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014449328] [2021-03-25 04:46:28,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:28,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:46:28,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187589850] [2021-03-25 04:46:28,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:46:28,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:28,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:46:28,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:46:28,027 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 210 [2021-03-25 04:46:28,028 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 78 transitions, 660 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:46:28,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:28,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 210 [2021-03-25 04:46:28,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:28,232 INFO L129 PetriNetUnfolder]: 596/1309 cut-off events. [2021-03-25 04:46:28,232 INFO L130 PetriNetUnfolder]: For 4735/6549 co-relation queries the response was YES. [2021-03-25 04:46:28,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5914 conditions, 1309 events. 596/1309 cut-off events. For 4735/6549 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9281 event pairs, 12 based on Foata normal form. 339/1573 useless extension candidates. Maximal degree in co-relation 5879. Up to 375 conditions per place. [2021-03-25 04:46:28,240 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 2 selfloop transitions, 18 changer transitions 6/83 dead transitions. [2021-03-25 04:46:28,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 83 transitions, 756 flow [2021-03-25 04:46:28,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:46:28,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:46:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1450 transitions. [2021-03-25 04:46:28,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2021-03-25 04:46:28,250 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1450 transitions. [2021-03-25 04:46:28,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1450 transitions. [2021-03-25 04:46:28,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:28,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1450 transitions. [2021-03-25 04:46:28,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 181.25) internal successors, (1450), 8 states have internal predecessors, (1450), 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:46:28,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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:46:28,256 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 210.0) internal successors, (1890), 9 states have internal predecessors, (1890), 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:46:28,256 INFO L185 Difference]: Start difference. First operand has 76 places, 78 transitions, 660 flow. Second operand 8 states and 1450 transitions. [2021-03-25 04:46:28,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 83 transitions, 756 flow [2021-03-25 04:46:28,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 83 transitions, 686 flow, removed 30 selfloop flow, removed 3 redundant places. [2021-03-25 04:46:28,271 INFO L241 Difference]: Finished difference. Result has 83 places, 77 transitions, 648 flow [2021-03-25 04:46:28,271 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=648, PETRI_PLACES=83, PETRI_TRANSITIONS=77} [2021-03-25 04:46:28,271 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 24 predicate places. [2021-03-25 04:46:28,271 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:28,271 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 77 transitions, 648 flow [2021-03-25 04:46:28,272 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 77 transitions, 648 flow [2021-03-25 04:46:28,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 648 flow [2021-03-25 04:46:28,326 INFO L129 PetriNetUnfolder]: 295/660 cut-off events. [2021-03-25 04:46:28,326 INFO L130 PetriNetUnfolder]: For 2733/3470 co-relation queries the response was YES. [2021-03-25 04:46:28,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2887 conditions, 660 events. 295/660 cut-off events. For 2733/3470 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4016 event pairs, 2 based on Foata normal form. 7/623 useless extension candidates. Maximal degree in co-relation 2852. Up to 192 conditions per place. [2021-03-25 04:46:28,333 INFO L142 LiptonReduction]: Number of co-enabled transitions 994 [2021-03-25 04:46:28,920 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 186 [2021-03-25 04:46:29,130 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-25 04:46:30,496 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 340 DAG size of output: 268 [2021-03-25 04:46:31,039 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 248 [2021-03-25 04:46:31,363 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:46:31,581 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:46:32,155 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 04:46:32,711 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 04:46:32,738 INFO L154 LiptonReduction]: Checked pairs total: 1105 [2021-03-25 04:46:32,738 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 04:46:32,738 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4467 [2021-03-25 04:46:32,738 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 630 flow [2021-03-25 04:46:32,739 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:46:32,739 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:32,739 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:46:32,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 04:46:32,739 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:46:32,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash -353317229, now seen corresponding path program 1 times [2021-03-25 04:46:32,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:32,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947775396] [2021-03-25 04:46:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:46:32,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:32,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:46:32,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:32,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:32,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:46:32,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:46:32,809 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:46:32,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947775396] [2021-03-25 04:46:32,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:46:32,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:46:32,810 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931176278] [2021-03-25 04:46:32,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:46:32,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:46:32,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:46:32,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:46:32,811 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 215 [2021-03-25 04:46:32,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 630 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 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:46:32,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:46:32,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 215 [2021-03-25 04:46:32,812 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:46:32,945 INFO L129 PetriNetUnfolder]: 460/970 cut-off events. [2021-03-25 04:46:32,945 INFO L130 PetriNetUnfolder]: For 4982/5776 co-relation queries the response was YES. [2021-03-25 04:46:32,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4332 conditions, 970 events. 460/970 cut-off events. For 4982/5776 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6396 event pairs, 16 based on Foata normal form. 88/997 useless extension candidates. Maximal degree in co-relation 4296. Up to 309 conditions per place. [2021-03-25 04:46:32,950 INFO L132 encePairwiseOnDemand]: 212/215 looper letters, 3 selfloop transitions, 1 changer transitions 26/73 dead transitions. [2021-03-25 04:46:32,950 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 73 transitions, 642 flow [2021-03-25 04:46:32,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:46:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:46:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 746 transitions. [2021-03-25 04:46:32,952 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8674418604651163 [2021-03-25 04:46:32,952 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 746 transitions. [2021-03-25 04:46:32,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 746 transitions. [2021-03-25 04:46:32,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:46:32,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 746 transitions. [2021-03-25 04:46:32,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.5) internal successors, (746), 4 states have internal predecessors, (746), 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:46:32,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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:46:32,956 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 215.0) internal successors, (1075), 5 states have internal predecessors, (1075), 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:46:32,956 INFO L185 Difference]: Start difference. First operand has 77 places, 72 transitions, 630 flow. Second operand 4 states and 746 transitions. [2021-03-25 04:46:32,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 73 transitions, 642 flow [2021-03-25 04:46:32,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 577 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-03-25 04:46:32,967 INFO L241 Difference]: Finished difference. Result has 72 places, 47 transitions, 343 flow [2021-03-25 04:46:32,967 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=343, PETRI_PLACES=72, PETRI_TRANSITIONS=47} [2021-03-25 04:46:32,967 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2021-03-25 04:46:32,968 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:46:32,968 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 47 transitions, 343 flow [2021-03-25 04:46:32,968 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 47 transitions, 343 flow [2021-03-25 04:46:32,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 47 transitions, 343 flow [2021-03-25 04:46:32,996 INFO L129 PetriNetUnfolder]: 194/430 cut-off events. [2021-03-25 04:46:32,996 INFO L130 PetriNetUnfolder]: For 2020/2340 co-relation queries the response was YES. [2021-03-25 04:46:32,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1764 conditions, 430 events. 194/430 cut-off events. For 2020/2340 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2399 event pairs, 8 based on Foata normal form. 10/409 useless extension candidates. Maximal degree in co-relation 1735. Up to 145 conditions per place. [2021-03-25 04:46:32,999 INFO L142 LiptonReduction]: Number of co-enabled transitions 430 [2021-03-25 04:46:33,000 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:46:33,000 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:46:33,001 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 04:46:33,001 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 343 flow [2021-03-25 04:46:33,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 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:46:33,001 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:46:33,001 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:46:33,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 04:46:33,001 INFO L428 AbstractCegarLoop]: === Iteration 18 === [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:46:33,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:46:33,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1810782433, now seen corresponding path program 1 times [2021-03-25 04:46:33,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:46:33,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190784810] [2021-03-25 04:46:33,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:46:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:46:33,031 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:46:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:46:33,063 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:46:33,104 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:46:33,105 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:46:33,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 04:46:33,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:46:33 BasicIcfg [2021-03-25 04:46:33,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:46:33,221 INFO L168 Benchmark]: Toolchain (without parser) took 29157.78 ms. Allocated memory was 255.9 MB in the beginning and 811.6 MB in the end (delta: 555.7 MB). Free memory was 234.8 MB in the beginning and 677.4 MB in the end (delta: -442.6 MB). Peak memory consumption was 114.3 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:33,221 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:46:33,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 544.48 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.4 MB in the beginning and 325.2 MB in the end (delta: -90.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:33,222 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.27 ms. Allocated memory is still 367.0 MB. Free memory was 325.2 MB in the beginning and 322.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:33,222 INFO L168 Benchmark]: Boogie Preprocessor took 44.51 ms. Allocated memory is still 367.0 MB. Free memory was 322.2 MB in the beginning and 319.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:33,222 INFO L168 Benchmark]: RCFGBuilder took 2235.62 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 319.5 MB in the beginning and 369.4 MB in the end (delta: -49.9 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:33,222 INFO L168 Benchmark]: TraceAbstraction took 26268.43 ms. Allocated memory was 440.4 MB in the beginning and 811.6 MB in the end (delta: 371.2 MB). Free memory was 368.3 MB in the beginning and 677.4 MB in the end (delta: -309.1 MB). Peak memory consumption was 63.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:46:33,223 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.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 544.48 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 234.4 MB in the beginning and 325.2 MB in the end (delta: -90.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.27 ms. Allocated memory is still 367.0 MB. Free memory was 325.2 MB in the beginning and 322.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.51 ms. Allocated memory is still 367.0 MB. Free memory was 322.2 MB in the beginning and 319.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2235.62 ms. Allocated memory was 367.0 MB in the beginning and 440.4 MB in the end (delta: 73.4 MB). Free memory was 319.5 MB in the beginning and 369.4 MB in the end (delta: -49.9 MB). Peak memory consumption was 58.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26268.43 ms. Allocated memory was 440.4 MB in the beginning and 811.6 MB in the end (delta: 371.2 MB). Free memory was 368.3 MB in the beginning and 677.4 MB in the end (delta: -309.1 MB). Peak memory consumption was 63.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7382.4ms, 126 PlacesBefore, 59 PlacesAfterwards, 115 TransitionsBefore, 47 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 5220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2439, positive: 2328, positive conditional: 0, positive unconditional: 2328, 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: 1368, positive: 1335, positive conditional: 0, positive unconditional: 1335, 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: 1368, positive: 1335, positive conditional: 0, positive unconditional: 1335, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2439, positive: 993, positive conditional: 0, positive unconditional: 993, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 1368, unknown conditional: 0, unknown unconditional: 1368] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4037.5ms, 55 PlacesBefore, 41 PlacesAfterwards, 41 TransitionsBefore, 30 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 524, positive: 405, positive conditional: 0, positive unconditional: 405, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 46, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 524, positive: 371, positive conditional: 0, positive unconditional: 371, negative: 107, negative conditional: 0, negative unconditional: 107, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 156, Positive cache size: 135, Positive conditional cache size: 0, Positive unconditional cache size: 135, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1359.4ms, 44 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 978 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 163, positive: 121, positive conditional: 0, positive unconditional: 121, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 163, positive: 118, positive conditional: 0, positive unconditional: 118, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 47.4ms, 45 PlacesBefore, 45 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 293 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 83, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 614 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 318 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 55, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 13, negative conditional: 0, negative unconditional: 13, 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: 55, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 135.2ms, 49 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 601 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 176, positive: 153, positive conditional: 0, positive unconditional: 153, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 176, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.4ms, 49 PlacesBefore, 49 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 420 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 15, negative conditional: 0, negative unconditional: 15, 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: 105, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 139, Positive conditional cache size: 0, Positive unconditional cache size: 139, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 132.7ms, 52 PlacesBefore, 52 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 491 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 144, positive conditional: 0, positive unconditional: 144, 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: 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: 160, positive: 142, positive conditional: 0, positive unconditional: 142, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 163, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 145.4ms, 54 PlacesBefore, 54 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 794 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 856 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 314, positive: 287, positive conditional: 0, positive unconditional: 287, negative: 27, negative conditional: 0, negative unconditional: 27, 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: 314, positive: 286, positive conditional: 0, positive unconditional: 286, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 153.8ms, 57 PlacesBefore, 57 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1080 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 462, positive: 431, positive conditional: 0, positive unconditional: 431, negative: 31, negative conditional: 0, negative unconditional: 31, 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: 462, positive: 429, positive conditional: 0, positive unconditional: 429, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 245.2ms, 61 PlacesBefore, 61 PlacesAfterwards, 69 TransitionsBefore, 69 TransitionsAfterwards, 948 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1114 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 472, positive: 442, positive conditional: 0, positive unconditional: 442, negative: 30, negative conditional: 0, negative unconditional: 30, 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: 472, positive: 442, positive conditional: 0, positive unconditional: 442, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 411.7ms, 67 PlacesBefore, 67 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1551 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 407, positive: 368, positive conditional: 0, positive unconditional: 368, negative: 39, negative conditional: 0, negative unconditional: 39, 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: 407, positive: 368, positive conditional: 0, positive unconditional: 368, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 606.1ms, 72 PlacesBefore, 72 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1003 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 354, positive: 333, positive conditional: 0, positive unconditional: 333, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 354, positive: 330, positive conditional: 0, positive unconditional: 330, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 169, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 314.2ms, 80 PlacesBefore, 80 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1094 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 464, positive: 442, positive conditional: 0, positive unconditional: 442, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 464, positive: 439, positive conditional: 0, positive unconditional: 439, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 334.5ms, 86 PlacesBefore, 86 PlacesAfterwards, 92 TransitionsBefore, 89 TransitionsAfterwards, 1882 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 2246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1002, positive: 962, positive conditional: 0, positive unconditional: 962, negative: 40, negative conditional: 0, negative unconditional: 40, 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: 1002, positive: 956, positive conditional: 0, positive unconditional: 956, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 216.0ms, 76 PlacesBefore, 76 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 354 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 8, negative conditional: 0, negative unconditional: 8, 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: 62, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4466.2ms, 83 PlacesBefore, 77 PlacesAfterwards, 77 TransitionsBefore, 72 TransitionsAfterwards, 994 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 1105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 406, positive: 379, positive conditional: 0, positive unconditional: 379, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 16, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 406, positive: 365, positive conditional: 0, positive unconditional: 365, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.6ms, 72 PlacesBefore, 67 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 117, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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] [L802] 3 y = 1 [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1] [L822] 4 z = 2 [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2] [L758] 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) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] 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) [L758] 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) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 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 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 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 [L788] 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) [L788] 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) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 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 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 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 [L808] 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) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] 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) [L808] 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) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 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 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 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 [L834] 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) [L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L834] 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) [L834] 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) [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L836] 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 [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 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 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] 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) [L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L869] 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) [L869] 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) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 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 [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 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 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] 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) [L880] 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) [L881] 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)) [L881] EXPR 0 !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) [L881] 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)) [L881] 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)) [L882] 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)) [L882] EXPR 0 !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) [L882] 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)) [L882] 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)) [L883] 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)) [L883] EXPR 0 !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) [L883] 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)) [L883] 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)) [L884] 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)) [L884] EXPR 0 !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) [L884] 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)) [L884] 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)) [L885] 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)) [L885] EXPR 0 !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) [L885] 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)) [L885] 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)) [L886] 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)) [L886] EXPR 0 !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) [L886] 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)) [L886] 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)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 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_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=51, weak$$choice2=0, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26048.5ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3614.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7464.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 73 SDtfs, 29 SDslu, 29 SDs, 0 SdLazy, 467 SolverSat, 137 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 556.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 453.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=14, InterpolantAutomatonStates: 78, 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: 60.0ms SsaConstructionTime, 627.8ms SatisfiabilityAnalysisTime, 1156.4ms InterpolantComputationTime, 316 NumberOfCodeBlocks, 316 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 1874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...