/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:15:10,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:15:10,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:15:10,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:15:10,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:15:10,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:15:10,629 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:15:10,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:15:10,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:15:10,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:15:10,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:15:10,641 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:15:10,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:15:10,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:15:10,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:15:10,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:15:10,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:15:10,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:15:10,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:15:10,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:15:10,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:15:10,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:15:10,651 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:15:10,652 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:15:10,654 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:15:10,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:15:10,655 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:15:10,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:15:10,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:15:10,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:15:10,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:15:10,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:15:10,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:15:10,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:15:10,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:15:10,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:15:10,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:15:10,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:15:10,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:15:10,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:15:10,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:15:10,663 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:15:10,683 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:15:10,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:15:10,684 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:15:10,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:15:10,685 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:15:10,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:15:10,685 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:15:10,686 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:15:10,686 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:15:10,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:15:10,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:15:10,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:15:10,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:15:10,687 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:15:10,687 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:15:10,687 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:15:10,687 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:15:10,687 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:15:10,688 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:15:10,688 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:15:10,688 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:15:10,688 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:15:10,688 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:15:10,689 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:15:10,689 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:15:10,689 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:15:10,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:15:10,689 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:15:10,689 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:15:10,689 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:15:10,690 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-26 10:15:10,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:15:10,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:15:10,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:15:11,000 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:15:11,001 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:15:11,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i [2021-03-26 10:15:11,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67ce6dea/7318937a07624465be42d57f75ac0978/FLAG7d9a33958 [2021-03-26 10:15:11,679 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:15:11,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc.i [2021-03-26 10:15:11,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67ce6dea/7318937a07624465be42d57f75ac0978/FLAG7d9a33958 [2021-03-26 10:15:12,073 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a67ce6dea/7318937a07624465be42d57f75ac0978 [2021-03-26 10:15:12,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:15:12,077 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:15:12,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:15:12,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:15:12,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:15:12,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9c1660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12, skipping insertion in model container [2021-03-26 10:15:12,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:15:12,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:15:12,287 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/mix057_power.oepc.i[951,964] [2021-03-26 10:15:12,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:15:12,497 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:15:12,506 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/mix057_power.oepc.i[951,964] [2021-03-26 10:15:12,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:15:12,627 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:15:12,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12 WrapperNode [2021-03-26 10:15:12,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:15:12,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:15:12,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:15:12,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:15:12,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:15:12,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:15:12,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:15:12,675 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:15:12,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (1/1) ... [2021-03-26 10:15:12,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:15:12,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:15:12,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:15:12,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:15:12,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (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-26 10:15:12,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:15:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:15:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:15:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:15:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:15:12,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:15:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:15:12,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:15:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:15:12,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:15:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:15:12,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:15:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:15:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:15:12,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:15:12,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:15:12,796 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:15:14,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:15:14,677 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:15:14,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:15:14 BoogieIcfgContainer [2021-03-26 10:15:14,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:15:14,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:15:14,681 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:15:14,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:15:14,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:15:12" (1/3) ... [2021-03-26 10:15:14,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b6cd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:15:14, skipping insertion in model container [2021-03-26 10:15:14,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:12" (2/3) ... [2021-03-26 10:15:14,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b6cd7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:15:14, skipping insertion in model container [2021-03-26 10:15:14,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:15:14" (3/3) ... [2021-03-26 10:15:14,685 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc.i [2021-03-26 10:15:14,691 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:15:14,694 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:15:14,695 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:15:14,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,739 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,739 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,741 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,745 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,750 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,750 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,750 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,750 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,755 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,756 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,756 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,767 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,768 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,778 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,779 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,780 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,781 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,783 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,784 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,785 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,786 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,787 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,789 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,789 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,792 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,792 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,792 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,793 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,798 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,799 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,799 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,799 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,800 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,802 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,803 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,803 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,803 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,804 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,805 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,808 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,808 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:14,809 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:15:14,827 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:15:14,847 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:15:14,848 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:15:14,848 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:15:14,848 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:15:14,848 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:15:14,848 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:15:14,848 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:15:14,848 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:15:14,865 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 248 flow [2021-03-26 10:15:14,905 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-26 10:15:14,906 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:14,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 83 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 10:15:14,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 248 flow [2021-03-26 10:15:14,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 110 transitions, 232 flow [2021-03-26 10:15:14,916 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:14,931 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 110 transitions, 232 flow [2021-03-26 10:15:14,934 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 110 transitions, 232 flow [2021-03-26 10:15:14,937 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 110 transitions, 232 flow [2021-03-26 10:15:14,968 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2021-03-26 10:15:14,968 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:14,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 86 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 10:15:14,973 INFO L142 LiptonReduction]: Number of co-enabled transitions 2672 [2021-03-26 10:15:16,486 WARN L205 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:15:16,895 WARN L205 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:15:17,021 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:15:18,609 INFO L154 LiptonReduction]: Checked pairs total: 4891 [2021-03-26 10:15:18,609 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 10:15:18,612 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3697 [2021-03-26 10:15:18,620 INFO L129 PetriNetUnfolder]: 0/11 cut-off events. [2021-03-26 10:15:18,620 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:18,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:18,621 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:18,621 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:18,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:18,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1028802545, now seen corresponding path program 1 times [2021-03-26 10:15:18,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:18,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626254685] [2021-03-26 10:15:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:18,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:18,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:18,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:18,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:18,836 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-26 10:15:18,836 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626254685] [2021-03-26 10:15:18,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:18,837 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:18,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811212423] [2021-03-26 10:15:18,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:18,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:18,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:18,861 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 188 [2021-03-26 10:15:18,866 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-26 10:15:18,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:18,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 188 [2021-03-26 10:15:18,867 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:19,002 INFO L129 PetriNetUnfolder]: 133/296 cut-off events. [2021-03-26 10:15:19,002 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:19,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 296 events. 133/296 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1435 event pairs, 110 based on Foata normal form. 33/316 useless extension candidates. Maximal degree in co-relation 496. Up to 153 conditions per place. [2021-03-26 10:15:19,007 INFO L132 encePairwiseOnDemand]: 184/188 looper letters, 11 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2021-03-26 10:15:19,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 132 flow [2021-03-26 10:15:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-03-26 10:15:19,027 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9113475177304965 [2021-03-26 10:15:19,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-03-26 10:15:19,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-03-26 10:15:19,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:19,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-03-26 10:15:19,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 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-26 10:15:19,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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-26 10:15:19,043 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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-26 10:15:19,045 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 514 transitions. [2021-03-26 10:15:19,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 132 flow [2021-03-26 10:15:19,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:19,049 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 96 flow [2021-03-26 10:15:19,051 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-26 10:15:19,052 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:15:19,052 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:19,052 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 10:15:19,053 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 96 flow [2021-03-26 10:15:19,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 96 flow [2021-03-26 10:15:19,062 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-03-26 10:15:19,062 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:19,062 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:15:19,065 INFO L142 LiptonReduction]: Number of co-enabled transitions 608 [2021-03-26 10:15:20,525 INFO L154 LiptonReduction]: Checked pairs total: 2552 [2021-03-26 10:15:20,525 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:15:20,525 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1473 [2021-03-26 10:15:20,526 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 74 flow [2021-03-26 10:15:20,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 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-26 10:15:20,527 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:20,527 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] [2021-03-26 10:15:20,531 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:15:20,532 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:20,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:20,532 INFO L82 PathProgramCache]: Analyzing trace with hash -135319801, now seen corresponding path program 1 times [2021-03-26 10:15:20,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:20,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609687818] [2021-03-26 10:15:20,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:20,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:20,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:20,668 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:15:20,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:15:20,677 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:15:20,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:15:20,681 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-26 10:15:20,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609687818] [2021-03-26 10:15:20,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:20,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:20,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193158635] [2021-03-26 10:15:20,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:20,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:20,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:20,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:20,685 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 199 [2021-03-26 10:15:20,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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-26 10:15:20,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:20,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 199 [2021-03-26 10:15:20,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:20,898 INFO L129 PetriNetUnfolder]: 523/1135 cut-off events. [2021-03-26 10:15:20,899 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:20,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1948 conditions, 1135 events. 523/1135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 7797 event pairs, 102 based on Foata normal form. 0/1058 useless extension candidates. Maximal degree in co-relation 1937. Up to 264 conditions per place. [2021-03-26 10:15:20,906 INFO L132 encePairwiseOnDemand]: 189/199 looper letters, 9 selfloop transitions, 8 changer transitions 17/53 dead transitions. [2021-03-26 10:15:20,906 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 184 flow [2021-03-26 10:15:20,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:20,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 799 transitions. [2021-03-26 10:15:20,909 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8030150753768844 [2021-03-26 10:15:20,909 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 799 transitions. [2021-03-26 10:15:20,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 799 transitions. [2021-03-26 10:15:20,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:20,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 799 transitions. [2021-03-26 10:15:20,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 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-26 10:15:20,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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-26 10:15:20,915 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 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-26 10:15:20,915 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 74 flow. Second operand 5 states and 799 transitions. [2021-03-26 10:15:20,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 184 flow [2021-03-26 10:15:20,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:15:20,916 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 142 flow [2021-03-26 10:15:20,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-26 10:15:20,917 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-26 10:15:20,917 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:20,917 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 142 flow [2021-03-26 10:15:20,918 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 142 flow [2021-03-26 10:15:20,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 36 transitions, 142 flow [2021-03-26 10:15:20,987 INFO L129 PetriNetUnfolder]: 284/702 cut-off events. [2021-03-26 10:15:20,987 INFO L130 PetriNetUnfolder]: For 227/248 co-relation queries the response was YES. [2021-03-26 10:15:20,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 702 events. 284/702 cut-off events. For 227/248 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4817 event pairs, 106 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 1577. Up to 263 conditions per place. [2021-03-26 10:15:20,995 INFO L142 LiptonReduction]: Number of co-enabled transitions 532 [2021-03-26 10:15:21,801 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 10:15:21,955 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:15:22,332 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 10:15:22,482 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:15:22,555 INFO L154 LiptonReduction]: Checked pairs total: 720 [2021-03-26 10:15:22,556 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:22,556 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1639 [2021-03-26 10:15:22,557 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 140 flow [2021-03-26 10:15:22,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 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-26 10:15:22,557 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:22,558 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:22,558 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:15:22,558 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:22,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1486756277, now seen corresponding path program 1 times [2021-03-26 10:15:22,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:22,559 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193513928] [2021-03-26 10:15:22,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:22,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:22,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:22,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:22,636 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-26 10:15:22,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193513928] [2021-03-26 10:15:22,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:22,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:22,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738190875] [2021-03-26 10:15:22,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:22,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:22,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:22,643 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 10:15:22,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 10:15:22,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:22,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 10:15:22,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:22,730 INFO L129 PetriNetUnfolder]: 239/599 cut-off events. [2021-03-26 10:15:22,731 INFO L130 PetriNetUnfolder]: For 357/466 co-relation queries the response was YES. [2021-03-26 10:15:22,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1490 conditions, 599 events. 239/599 cut-off events. For 357/466 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3809 event pairs, 71 based on Foata normal form. 8/592 useless extension candidates. Maximal degree in co-relation 1477. Up to 216 conditions per place. [2021-03-26 10:15:22,736 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2021-03-26 10:15:22,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 184 flow [2021-03-26 10:15:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 10:15:22,738 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2021-03-26 10:15:22,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 10:15:22,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 10:15:22,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:22,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 10:15:22,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-26 10:15:22,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:22,741 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:22,742 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 140 flow. Second operand 3 states and 532 transitions. [2021-03-26 10:15:22,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 184 flow [2021-03-26 10:15:22,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 146 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:22,749 INFO L241 Difference]: Finished difference. Result has 42 places, 39 transitions, 151 flow [2021-03-26 10:15:22,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2021-03-26 10:15:22,750 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -15 predicate places. [2021-03-26 10:15:22,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:22,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 39 transitions, 151 flow [2021-03-26 10:15:22,751 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 151 flow [2021-03-26 10:15:22,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 151 flow [2021-03-26 10:15:22,807 INFO L129 PetriNetUnfolder]: 239/597 cut-off events. [2021-03-26 10:15:22,807 INFO L130 PetriNetUnfolder]: For 81/141 co-relation queries the response was YES. [2021-03-26 10:15:22,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 597 events. 239/597 cut-off events. For 81/141 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4013 event pairs, 74 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 1142. Up to 216 conditions per place. [2021-03-26 10:15:22,814 INFO L142 LiptonReduction]: Number of co-enabled transitions 606 [2021-03-26 10:15:22,943 INFO L154 LiptonReduction]: Checked pairs total: 321 [2021-03-26 10:15:22,944 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:22,944 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 194 [2021-03-26 10:15:22,945 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 151 flow [2021-03-26 10:15:22,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 10:15:22,946 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:22,946 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:22,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:15:22,946 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:22,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:22,946 INFO L82 PathProgramCache]: Analyzing trace with hash 40114371, now seen corresponding path program 1 times [2021-03-26 10:15:22,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:22,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817664949] [2021-03-26 10:15:22,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:23,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:23,037 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-26 10:15:23,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817664949] [2021-03-26 10:15:23,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:23,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:15:23,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22715782] [2021-03-26 10:15:23,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:23,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:23,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:23,040 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 10:15:23,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 10:15:23,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:23,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 10:15:23,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:23,101 INFO L129 PetriNetUnfolder]: 213/552 cut-off events. [2021-03-26 10:15:23,101 INFO L130 PetriNetUnfolder]: For 240/413 co-relation queries the response was YES. [2021-03-26 10:15:23,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 552 events. 213/552 cut-off events. For 240/413 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3495 event pairs, 40 based on Foata normal form. 5/544 useless extension candidates. Maximal degree in co-relation 1182. Up to 193 conditions per place. [2021-03-26 10:15:23,105 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2021-03-26 10:15:23,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 187 flow [2021-03-26 10:15:23,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 10:15:23,107 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2021-03-26 10:15:23,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 10:15:23,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 10:15:23,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:23,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 10:15:23,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-26 10:15:23,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,111 INFO L185 Difference]: Start difference. First operand has 42 places, 39 transitions, 151 flow. Second operand 3 states and 532 transitions. [2021-03-26 10:15:23,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 187 flow [2021-03-26 10:15:23,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:23,114 INFO L241 Difference]: Finished difference. Result has 44 places, 43 transitions, 187 flow [2021-03-26 10:15:23,114 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2021-03-26 10:15:23,115 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -13 predicate places. [2021-03-26 10:15:23,115 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:23,115 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 43 transitions, 187 flow [2021-03-26 10:15:23,115 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 43 transitions, 187 flow [2021-03-26 10:15:23,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 187 flow [2021-03-26 10:15:23,167 INFO L129 PetriNetUnfolder]: 213/540 cut-off events. [2021-03-26 10:15:23,167 INFO L130 PetriNetUnfolder]: For 203/322 co-relation queries the response was YES. [2021-03-26 10:15:23,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1178 conditions, 540 events. 213/540 cut-off events. For 203/322 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3469 event pairs, 39 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 1166. Up to 193 conditions per place. [2021-03-26 10:15:23,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 686 [2021-03-26 10:15:23,237 INFO L154 LiptonReduction]: Checked pairs total: 452 [2021-03-26 10:15:23,238 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:23,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-03-26 10:15:23,238 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 187 flow [2021-03-26 10:15:23,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 10:15:23,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:23,239 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:23,239 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:15:23,239 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:23,240 INFO L82 PathProgramCache]: Analyzing trace with hash 363493826, now seen corresponding path program 1 times [2021-03-26 10:15:23,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:23,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651393555] [2021-03-26 10:15:23,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:23,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:23,304 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-26 10:15:23,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651393555] [2021-03-26 10:15:23,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:23,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:15:23,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676724644] [2021-03-26 10:15:23,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:23,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:23,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:23,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:23,305 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 10:15:23,306 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 10:15:23,306 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:23,306 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 10:15:23,306 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:23,405 INFO L129 PetriNetUnfolder]: 190/511 cut-off events. [2021-03-26 10:15:23,406 INFO L130 PetriNetUnfolder]: For 411/620 co-relation queries the response was YES. [2021-03-26 10:15:23,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 511 events. 190/511 cut-off events. For 411/620 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3194 event pairs, 25 based on Foata normal form. 3/505 useless extension candidates. Maximal degree in co-relation 1186. Up to 176 conditions per place. [2021-03-26 10:15:23,410 INFO L132 encePairwiseOnDemand]: 196/200 looper letters, 5 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2021-03-26 10:15:23,410 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 223 flow [2021-03-26 10:15:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2021-03-26 10:15:23,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8866666666666667 [2021-03-26 10:15:23,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 532 transitions. [2021-03-26 10:15:23,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 532 transitions. [2021-03-26 10:15:23,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:23,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 532 transitions. [2021-03-26 10:15:23,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-26 10:15:23,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,415 INFO L185 Difference]: Start difference. First operand has 44 places, 43 transitions, 187 flow. Second operand 3 states and 532 transitions. [2021-03-26 10:15:23,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 223 flow [2021-03-26 10:15:23,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:23,417 INFO L241 Difference]: Finished difference. Result has 46 places, 47 transitions, 223 flow [2021-03-26 10:15:23,417 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2021-03-26 10:15:23,418 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -11 predicate places. [2021-03-26 10:15:23,418 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:23,418 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 47 transitions, 223 flow [2021-03-26 10:15:23,418 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 47 transitions, 223 flow [2021-03-26 10:15:23,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 47 transitions, 223 flow [2021-03-26 10:15:23,463 INFO L129 PetriNetUnfolder]: 190/503 cut-off events. [2021-03-26 10:15:23,463 INFO L130 PetriNetUnfolder]: For 286/413 co-relation queries the response was YES. [2021-03-26 10:15:23,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 503 events. 190/503 cut-off events. For 286/413 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3113 event pairs, 28 based on Foata normal form. 2/496 useless extension candidates. Maximal degree in co-relation 1183. Up to 176 conditions per place. [2021-03-26 10:15:23,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 746 [2021-03-26 10:15:23,526 INFO L154 LiptonReduction]: Checked pairs total: 483 [2021-03-26 10:15:23,526 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:23,527 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 109 [2021-03-26 10:15:23,529 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 223 flow [2021-03-26 10:15:23,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-26 10:15:23,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:23,529 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:23,530 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:15:23,530 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 849396282, now seen corresponding path program 1 times [2021-03-26 10:15:23,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:23,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41672544] [2021-03-26 10:15:23,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:23,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:23,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:23,579 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-26 10:15:23,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41672544] [2021-03-26 10:15:23,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:23,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:23,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245852760] [2021-03-26 10:15:23,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:23,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:23,581 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 10:15:23,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-26 10:15:23,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:23,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 10:15:23,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:23,644 INFO L129 PetriNetUnfolder]: 190/572 cut-off events. [2021-03-26 10:15:23,644 INFO L130 PetriNetUnfolder]: For 607/792 co-relation queries the response was YES. [2021-03-26 10:15:23,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 572 events. 190/572 cut-off events. For 607/792 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3943 event pairs, 23 based on Foata normal form. 18/581 useless extension candidates. Maximal degree in co-relation 1379. Up to 178 conditions per place. [2021-03-26 10:15:23,648 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2021-03-26 10:15:23,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 243 flow [2021-03-26 10:15:23,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2021-03-26 10:15:23,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.885 [2021-03-26 10:15:23,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2021-03-26 10:15:23,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2021-03-26 10:15:23,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:23,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2021-03-26 10:15:23,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-26 10:15:23,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,654 INFO L185 Difference]: Start difference. First operand has 46 places, 47 transitions, 223 flow. Second operand 3 states and 531 transitions. [2021-03-26 10:15:23,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 243 flow [2021-03-26 10:15:23,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:23,656 INFO L241 Difference]: Finished difference. Result has 48 places, 47 transitions, 238 flow [2021-03-26 10:15:23,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2021-03-26 10:15:23,657 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2021-03-26 10:15:23,657 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:23,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 47 transitions, 238 flow [2021-03-26 10:15:23,657 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 47 transitions, 238 flow [2021-03-26 10:15:23,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 47 transitions, 238 flow [2021-03-26 10:15:23,711 INFO L129 PetriNetUnfolder]: 190/554 cut-off events. [2021-03-26 10:15:23,711 INFO L130 PetriNetUnfolder]: For 538/675 co-relation queries the response was YES. [2021-03-26 10:15:23,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1340 conditions, 554 events. 190/554 cut-off events. For 538/675 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3757 event pairs, 37 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 1325. Up to 178 conditions per place. [2021-03-26 10:15:23,719 INFO L142 LiptonReduction]: Number of co-enabled transitions 746 [2021-03-26 10:15:23,763 INFO L154 LiptonReduction]: Checked pairs total: 491 [2021-03-26 10:15:23,763 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:23,763 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 10:15:23,768 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 238 flow [2021-03-26 10:15:23,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-26 10:15:23,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:23,769 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:23,769 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:15:23,769 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:23,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:23,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1616939159, now seen corresponding path program 1 times [2021-03-26 10:15:23,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:23,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077358182] [2021-03-26 10:15:23,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:23,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:23,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:23,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:23,827 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-26 10:15:23,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077358182] [2021-03-26 10:15:23,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:23,828 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:23,828 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273790486] [2021-03-26 10:15:23,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:23,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:23,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:23,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 200 [2021-03-26 10:15:23,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-26 10:15:23,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:23,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 200 [2021-03-26 10:15:23,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:23,910 INFO L129 PetriNetUnfolder]: 186/649 cut-off events. [2021-03-26 10:15:23,911 INFO L130 PetriNetUnfolder]: For 896/1046 co-relation queries the response was YES. [2021-03-26 10:15:23,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 649 events. 186/649 cut-off events. For 896/1046 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4895 event pairs, 24 based on Foata normal form. 11/651 useless extension candidates. Maximal degree in co-relation 1567. Up to 189 conditions per place. [2021-03-26 10:15:23,916 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 4 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2021-03-26 10:15:23,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 258 flow [2021-03-26 10:15:23,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:23,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2021-03-26 10:15:23,917 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.885 [2021-03-26 10:15:23,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2021-03-26 10:15:23,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2021-03-26 10:15:23,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:23,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2021-03-26 10:15:23,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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-26 10:15:23,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-26 10:15:23,920 INFO L185 Difference]: Start difference. First operand has 48 places, 47 transitions, 238 flow. Second operand 3 states and 531 transitions. [2021-03-26 10:15:23,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 258 flow [2021-03-26 10:15:23,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 248 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:23,924 INFO L241 Difference]: Finished difference. Result has 50 places, 47 transitions, 248 flow [2021-03-26 10:15:23,924 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2021-03-26 10:15:23,924 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-26 10:15:23,925 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:23,925 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 47 transitions, 248 flow [2021-03-26 10:15:23,925 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 47 transitions, 248 flow [2021-03-26 10:15:23,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 47 transitions, 248 flow [2021-03-26 10:15:23,986 INFO L129 PetriNetUnfolder]: 186/643 cut-off events. [2021-03-26 10:15:23,986 INFO L130 PetriNetUnfolder]: For 723/834 co-relation queries the response was YES. [2021-03-26 10:15:23,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 643 events. 186/643 cut-off events. For 723/834 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4929 event pairs, 43 based on Foata normal form. 2/636 useless extension candidates. Maximal degree in co-relation 1533. Up to 189 conditions per place. [2021-03-26 10:15:23,994 INFO L142 LiptonReduction]: Number of co-enabled transitions 746 [2021-03-26 10:15:24,051 INFO L154 LiptonReduction]: Checked pairs total: 455 [2021-03-26 10:15:24,051 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:24,052 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 127 [2021-03-26 10:15:24,052 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 248 flow [2021-03-26 10:15:24,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-26 10:15:24,053 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:24,053 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:24,053 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:15:24,053 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:24,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:24,053 INFO L82 PathProgramCache]: Analyzing trace with hash 111802655, now seen corresponding path program 1 times [2021-03-26 10:15:24,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:24,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440599137] [2021-03-26 10:15:24,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:24,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:24,118 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:15:24,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:15:24,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:24,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:24,126 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-26 10:15:24,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440599137] [2021-03-26 10:15:24,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:24,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:24,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909698923] [2021-03-26 10:15:24,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:24,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:24,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:24,128 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 10:15:24,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 248 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 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-26 10:15:24,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:24,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 10:15:24,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:24,531 INFO L129 PetriNetUnfolder]: 2081/3931 cut-off events. [2021-03-26 10:15:24,531 INFO L130 PetriNetUnfolder]: For 1989/2548 co-relation queries the response was YES. [2021-03-26 10:15:24,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8558 conditions, 3931 events. 2081/3931 cut-off events. For 1989/2548 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 34174 event pairs, 947 based on Foata normal form. 266/3475 useless extension candidates. Maximal degree in co-relation 8540. Up to 2770 conditions per place. [2021-03-26 10:15:24,570 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 12 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2021-03-26 10:15:24,570 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 61 transitions, 320 flow [2021-03-26 10:15:24,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 839 transitions. [2021-03-26 10:15:24,573 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.839 [2021-03-26 10:15:24,573 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 839 transitions. [2021-03-26 10:15:24,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 839 transitions. [2021-03-26 10:15:24,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:24,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 839 transitions. [2021-03-26 10:15:24,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-26 10:15:24,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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-26 10:15:24,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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-26 10:15:24,577 INFO L185 Difference]: Start difference. First operand has 50 places, 47 transitions, 248 flow. Second operand 5 states and 839 transitions. [2021-03-26 10:15:24,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 61 transitions, 320 flow [2021-03-26 10:15:24,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 310 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:24,580 INFO L241 Difference]: Finished difference. Result has 56 places, 56 transitions, 313 flow [2021-03-26 10:15:24,581 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2021-03-26 10:15:24,581 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2021-03-26 10:15:24,581 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:24,581 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 56 transitions, 313 flow [2021-03-26 10:15:24,581 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 56 transitions, 313 flow [2021-03-26 10:15:24,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 56 transitions, 313 flow [2021-03-26 10:15:24,842 INFO L129 PetriNetUnfolder]: 1583/3171 cut-off events. [2021-03-26 10:15:24,842 INFO L130 PetriNetUnfolder]: For 3528/4418 co-relation queries the response was YES. [2021-03-26 10:15:24,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9269 conditions, 3171 events. 1583/3171 cut-off events. For 3528/4418 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 27771 event pairs, 711 based on Foata normal form. 29/2914 useless extension candidates. Maximal degree in co-relation 9249. Up to 2155 conditions per place. [2021-03-26 10:15:24,888 INFO L142 LiptonReduction]: Number of co-enabled transitions 1128 [2021-03-26 10:15:26,745 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-26 10:15:26,745 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:26,745 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2164 [2021-03-26 10:15:26,746 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 307 flow [2021-03-26 10:15:26,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 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-26 10:15:26,746 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:26,746 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:26,746 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:15:26,746 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:26,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:26,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1395256338, now seen corresponding path program 1 times [2021-03-26 10:15:26,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:26,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63904433] [2021-03-26 10:15:26,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:26,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:26,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:26,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:26,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:26,793 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.0 percent of original size [2021-03-26 10:15:26,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:15:26,802 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-26 10:15:26,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63904433] [2021-03-26 10:15:26,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:26,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:26,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268083006] [2021-03-26 10:15:26,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:26,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:26,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:26,804 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 200 [2021-03-26 10:15:26,805 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 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-26 10:15:26,805 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:26,805 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 200 [2021-03-26 10:15:26,805 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:27,217 INFO L129 PetriNetUnfolder]: 2001/3820 cut-off events. [2021-03-26 10:15:27,217 INFO L130 PetriNetUnfolder]: For 5506/7843 co-relation queries the response was YES. [2021-03-26 10:15:27,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 3820 events. 2001/3820 cut-off events. For 5506/7843 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 32410 event pairs, 1006 based on Foata normal form. 113/3534 useless extension candidates. Maximal degree in co-relation 11441. Up to 2719 conditions per place. [2021-03-26 10:15:27,253 INFO L132 encePairwiseOnDemand]: 191/200 looper letters, 27 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2021-03-26 10:15:27,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 67 transitions, 477 flow [2021-03-26 10:15:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:27,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 651 transitions. [2021-03-26 10:15:27,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.81375 [2021-03-26 10:15:27,256 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 651 transitions. [2021-03-26 10:15:27,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 651 transitions. [2021-03-26 10:15:27,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:27,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 651 transitions. [2021-03-26 10:15:27,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 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-26 10:15:27,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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-26 10:15:27,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 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-26 10:15:27,260 INFO L185 Difference]: Start difference. First operand has 56 places, 55 transitions, 307 flow. Second operand 4 states and 651 transitions. [2021-03-26 10:15:27,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 67 transitions, 477 flow [2021-03-26 10:15:27,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 67 transitions, 470 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:15:27,303 INFO L241 Difference]: Finished difference. Result has 58 places, 60 transitions, 424 flow [2021-03-26 10:15:27,304 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=424, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2021-03-26 10:15:27,304 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places. [2021-03-26 10:15:27,304 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:27,304 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 424 flow [2021-03-26 10:15:27,304 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 424 flow [2021-03-26 10:15:27,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 424 flow [2021-03-26 10:15:27,729 INFO L129 PetriNetUnfolder]: 1991/3812 cut-off events. [2021-03-26 10:15:27,729 INFO L130 PetriNetUnfolder]: For 4455/5389 co-relation queries the response was YES. [2021-03-26 10:15:27,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10973 conditions, 3812 events. 1991/3812 cut-off events. For 4455/5389 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 32823 event pairs, 998 based on Foata normal form. 9/3457 useless extension candidates. Maximal degree in co-relation 10950. Up to 2712 conditions per place. [2021-03-26 10:15:27,783 INFO L142 LiptonReduction]: Number of co-enabled transitions 1098 [2021-03-26 10:15:29,757 INFO L154 LiptonReduction]: Checked pairs total: 654 [2021-03-26 10:15:29,757 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:29,757 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2453 [2021-03-26 10:15:29,758 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 424 flow [2021-03-26 10:15:29,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 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-26 10:15:29,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:29,758 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:29,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:15:29,759 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -957705454, now seen corresponding path program 1 times [2021-03-26 10:15:29,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:29,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533267517] [2021-03-26 10:15:29,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:29,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:29,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:29,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:29,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:29,803 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:15:29,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:15:29,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:29,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:29,811 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-26 10:15:29,811 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533267517] [2021-03-26 10:15:29,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:29,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:29,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276304514] [2021-03-26 10:15:29,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:29,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:29,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:29,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:29,813 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 10:15:29,814 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 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-26 10:15:29,814 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:29,814 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 10:15:29,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:30,288 INFO L129 PetriNetUnfolder]: 2322/4409 cut-off events. [2021-03-26 10:15:30,289 INFO L130 PetriNetUnfolder]: For 4745/8734 co-relation queries the response was YES. [2021-03-26 10:15:30,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15775 conditions, 4409 events. 2322/4409 cut-off events. For 4745/8734 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 37320 event pairs, 309 based on Foata normal form. 676/4663 useless extension candidates. Maximal degree in co-relation 15750. Up to 3230 conditions per place. [2021-03-26 10:15:30,331 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 13 selfloop transitions, 14 changer transitions 0/75 dead transitions. [2021-03-26 10:15:30,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 558 flow [2021-03-26 10:15:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:15:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:15:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1007 transitions. [2021-03-26 10:15:30,333 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391666666666666 [2021-03-26 10:15:30,333 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1007 transitions. [2021-03-26 10:15:30,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1007 transitions. [2021-03-26 10:15:30,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:30,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1007 transitions. [2021-03-26 10:15:30,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.83333333333334) internal successors, (1007), 6 states have internal predecessors, (1007), 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-26 10:15:30,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-26 10:15:30,340 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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-26 10:15:30,340 INFO L185 Difference]: Start difference. First operand has 58 places, 60 transitions, 424 flow. Second operand 6 states and 1007 transitions. [2021-03-26 10:15:30,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 558 flow [2021-03-26 10:15:30,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 75 transitions, 554 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 10:15:30,347 INFO L241 Difference]: Finished difference. Result has 66 places, 69 transitions, 540 flow [2021-03-26 10:15:30,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=66, PETRI_TRANSITIONS=69} [2021-03-26 10:15:30,347 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2021-03-26 10:15:30,348 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:30,348 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 69 transitions, 540 flow [2021-03-26 10:15:30,348 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 69 transitions, 540 flow [2021-03-26 10:15:30,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 69 transitions, 540 flow [2021-03-26 10:15:30,601 INFO L129 PetriNetUnfolder]: 1559/3270 cut-off events. [2021-03-26 10:15:30,601 INFO L130 PetriNetUnfolder]: For 8475/10370 co-relation queries the response was YES. [2021-03-26 10:15:30,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14428 conditions, 3270 events. 1559/3270 cut-off events. For 8475/10370 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 29184 event pairs, 292 based on Foata normal form. 71/3174 useless extension candidates. Maximal degree in co-relation 14400. Up to 2467 conditions per place. [2021-03-26 10:15:30,643 INFO L142 LiptonReduction]: Number of co-enabled transitions 1536 [2021-03-26 10:15:34,906 INFO L154 LiptonReduction]: Checked pairs total: 1805 [2021-03-26 10:15:34,906 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:34,906 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4558 [2021-03-26 10:15:34,907 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 532 flow [2021-03-26 10:15:34,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 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-26 10:15:34,907 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:34,907 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] [2021-03-26 10:15:34,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:15:34,907 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash -341577538, now seen corresponding path program 1 times [2021-03-26 10:15:34,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:34,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356325581] [2021-03-26 10:15:34,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:34,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:34,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:34,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:34,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:34,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:34,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:34,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:34,961 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:15:34,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:15:34,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:34,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:34,969 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-26 10:15:34,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356325581] [2021-03-26 10:15:34,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:34,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:15:34,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061873886] [2021-03-26 10:15:34,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:34,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:34,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:34,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:34,971 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 10:15:34,972 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 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-26 10:15:34,972 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:34,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 10:15:34,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:35,356 INFO L129 PetriNetUnfolder]: 1620/3156 cut-off events. [2021-03-26 10:15:35,356 INFO L130 PetriNetUnfolder]: For 8296/12337 co-relation queries the response was YES. [2021-03-26 10:15:35,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15148 conditions, 3156 events. 1620/3156 cut-off events. For 8296/12337 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 24989 event pairs, 45 based on Foata normal form. 693/3514 useless extension candidates. Maximal degree in co-relation 15118. Up to 2224 conditions per place. [2021-03-26 10:15:35,381 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 10 selfloop transitions, 18 changer transitions 4/80 dead transitions. [2021-03-26 10:15:35,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 688 flow [2021-03-26 10:15:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:15:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:15:35,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1175 transitions. [2021-03-26 10:15:35,385 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8392857142857143 [2021-03-26 10:15:35,385 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1175 transitions. [2021-03-26 10:15:35,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1175 transitions. [2021-03-26 10:15:35,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:35,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1175 transitions. [2021-03-26 10:15:35,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.85714285714286) internal successors, (1175), 7 states have internal predecessors, (1175), 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-26 10:15:35,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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-26 10:15:35,390 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 200.0) internal successors, (1600), 8 states have internal predecessors, (1600), 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-26 10:15:35,390 INFO L185 Difference]: Start difference. First operand has 66 places, 68 transitions, 532 flow. Second operand 7 states and 1175 transitions. [2021-03-26 10:15:35,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 688 flow [2021-03-26 10:15:35,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 626 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:35,506 INFO L241 Difference]: Finished difference. Result has 69 places, 73 transitions, 592 flow [2021-03-26 10:15:35,506 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=592, PETRI_PLACES=69, PETRI_TRANSITIONS=73} [2021-03-26 10:15:35,506 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2021-03-26 10:15:35,506 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:35,507 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 73 transitions, 592 flow [2021-03-26 10:15:35,507 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 73 transitions, 592 flow [2021-03-26 10:15:35,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 73 transitions, 592 flow [2021-03-26 10:15:35,660 INFO L129 PetriNetUnfolder]: 813/1952 cut-off events. [2021-03-26 10:15:35,660 INFO L130 PetriNetUnfolder]: For 5108/5490 co-relation queries the response was YES. [2021-03-26 10:15:35,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8569 conditions, 1952 events. 813/1952 cut-off events. For 5108/5490 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 16326 event pairs, 49 based on Foata normal form. 3/1866 useless extension candidates. Maximal degree in co-relation 8540. Up to 1286 conditions per place. [2021-03-26 10:15:35,685 INFO L142 LiptonReduction]: Number of co-enabled transitions 1416 [2021-03-26 10:15:37,469 INFO L154 LiptonReduction]: Checked pairs total: 2272 [2021-03-26 10:15:37,470 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:37,470 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1964 [2021-03-26 10:15:37,471 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 72 transitions, 582 flow [2021-03-26 10:15:37,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 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-26 10:15:37,472 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:37,472 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-26 10:15:37,472 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:15:37,472 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1506267925, now seen corresponding path program 1 times [2021-03-26 10:15:37,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:37,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698218311] [2021-03-26 10:15:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:37,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:37,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:37,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:37,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:37,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:37,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:37,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:37,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:37,572 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:15:37,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:15:37,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:37,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:37,582 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-26 10:15:37,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698218311] [2021-03-26 10:15:37,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:37,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:15:37,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019322205] [2021-03-26 10:15:37,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:15:37,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:37,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:15:37,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:15:37,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 200 [2021-03-26 10:15:37,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 72 transitions, 582 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 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-26 10:15:37,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:37,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 200 [2021-03-26 10:15:37,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:37,873 INFO L129 PetriNetUnfolder]: 1330/2514 cut-off events. [2021-03-26 10:15:37,873 INFO L130 PetriNetUnfolder]: For 6671/9320 co-relation queries the response was YES. [2021-03-26 10:15:37,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11231 conditions, 2514 events. 1330/2514 cut-off events. For 6671/9320 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 18479 event pairs, 13 based on Foata normal form. 387/2584 useless extension candidates. Maximal degree in co-relation 11200. Up to 1448 conditions per place. [2021-03-26 10:15:37,890 INFO L132 encePairwiseOnDemand]: 193/200 looper letters, 6 selfloop transitions, 18 changer transitions 6/77 dead transitions. [2021-03-26 10:15:37,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 77 transitions, 648 flow [2021-03-26 10:15:37,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:15:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:15:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1335 transitions. [2021-03-26 10:15:37,893 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.834375 [2021-03-26 10:15:37,893 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1335 transitions. [2021-03-26 10:15:37,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1335 transitions. [2021-03-26 10:15:37,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:37,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1335 transitions. [2021-03-26 10:15:37,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 166.875) internal successors, (1335), 8 states have internal predecessors, (1335), 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-26 10:15:37,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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-26 10:15:37,899 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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-26 10:15:37,899 INFO L185 Difference]: Start difference. First operand has 69 places, 72 transitions, 582 flow. Second operand 8 states and 1335 transitions. [2021-03-26 10:15:37,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 77 transitions, 648 flow [2021-03-26 10:15:37,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 601 flow, removed 17 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:37,988 INFO L241 Difference]: Finished difference. Result has 73 places, 68 transitions, 541 flow [2021-03-26 10:15:37,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=541, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2021-03-26 10:15:37,988 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2021-03-26 10:15:37,988 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:37,988 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 68 transitions, 541 flow [2021-03-26 10:15:37,988 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 68 transitions, 541 flow [2021-03-26 10:15:37,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 68 transitions, 541 flow [2021-03-26 10:15:38,084 INFO L129 PetriNetUnfolder]: 522/1309 cut-off events. [2021-03-26 10:15:38,084 INFO L130 PetriNetUnfolder]: For 3200/3481 co-relation queries the response was YES. [2021-03-26 10:15:38,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5316 conditions, 1309 events. 522/1309 cut-off events. For 3200/3481 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 10248 event pairs, 19 based on Foata normal form. 3/1235 useless extension candidates. Maximal degree in co-relation 5285. Up to 492 conditions per place. [2021-03-26 10:15:38,099 INFO L142 LiptonReduction]: Number of co-enabled transitions 1120 [2021-03-26 10:15:38,607 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:15:38,781 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:15:39,186 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:15:39,419 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:15:39,549 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:15:39,783 INFO L154 LiptonReduction]: Checked pairs total: 2514 [2021-03-26 10:15:39,783 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:15:39,783 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1795 [2021-03-26 10:15:39,783 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 525 flow [2021-03-26 10:15:39,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 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-26 10:15:39,784 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:39,784 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-26 10:15:39,784 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:15:39,784 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:39,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1467684863, now seen corresponding path program 1 times [2021-03-26 10:15:39,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:39,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306308933] [2021-03-26 10:15:39,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:15:39,831 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:15:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:15:39,890 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:15:39,918 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:15:39,918 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:15:39,918 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:15:40,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:15:40 BasicIcfg [2021-03-26 10:15:40,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:15:40,031 INFO L168 Benchmark]: Toolchain (without parser) took 27954.03 ms. Allocated memory was 255.9 MB in the beginning and 736.1 MB in the end (delta: 480.2 MB). Free memory was 234.0 MB in the beginning and 526.7 MB in the end (delta: -292.6 MB). Peak memory consumption was 186.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:40,032 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 178.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:15:40,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.88 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.0 MB in the beginning and 329.2 MB in the end (delta: -95.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:40,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.19 ms. Allocated memory is still 371.2 MB. Free memory was 329.1 MB in the beginning and 326.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:40,032 INFO L168 Benchmark]: Boogie Preprocessor took 49.55 ms. Allocated memory is still 371.2 MB. Free memory was 326.3 MB in the beginning and 324.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:40,032 INFO L168 Benchmark]: RCFGBuilder took 1954.40 ms. Allocated memory is still 371.2 MB. Free memory was 324.2 MB in the beginning and 192.3 MB in the end (delta: 131.9 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:40,033 INFO L168 Benchmark]: TraceAbstraction took 25350.27 ms. Allocated memory was 371.2 MB in the beginning and 736.1 MB in the end (delta: 364.9 MB). Free memory was 192.3 MB in the beginning and 526.7 MB in the end (delta: -334.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:15:40,034 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.27 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 178.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 549.88 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.0 MB in the beginning and 329.2 MB in the end (delta: -95.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.19 ms. Allocated memory is still 371.2 MB. Free memory was 329.1 MB in the beginning and 326.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 49.55 ms. Allocated memory is still 371.2 MB. Free memory was 326.3 MB in the beginning and 324.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1954.40 ms. Allocated memory is still 371.2 MB. Free memory was 324.2 MB in the beginning and 192.3 MB in the end (delta: 131.9 MB). Peak memory consumption was 134.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 25350.27 ms. Allocated memory was 371.2 MB in the beginning and 736.1 MB in the end (delta: 364.9 MB). Free memory was 192.3 MB in the beginning and 526.7 MB in the end (delta: -334.4 MB). Peak memory consumption was 30.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3675.7ms, 121 PlacesBefore, 57 PlacesAfterwards, 110 TransitionsBefore, 45 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 5 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4891 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2553, positive: 2449, positive conditional: 2449, positive unconditional: 0, negative: 104, negative conditional: 104, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2553, positive: 2449, positive conditional: 0, positive unconditional: 2449, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2553, positive: 2449, positive conditional: 0, positive unconditional: 2449, negative: 104, negative conditional: 0, negative unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1836, positive: 1788, positive conditional: 0, positive unconditional: 1788, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1836, positive: 1777, positive conditional: 0, positive unconditional: 1777, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 59, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 641, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 604, negative conditional: 0, negative unconditional: 604, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2553, positive: 661, positive conditional: 0, positive unconditional: 661, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 1836, unknown conditional: 0, unknown unconditional: 1836] , Statistics on independence cache: Total cache size (in pairs): 1836, Positive cache size: 1788, Positive conditional cache size: 0, Positive unconditional cache size: 1788, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1471.6ms, 53 PlacesBefore, 42 PlacesAfterwards, 42 TransitionsBefore, 31 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 2552 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 740, positive: 622, positive conditional: 622, positive unconditional: 0, negative: 118, negative conditional: 118, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 740, positive: 622, positive conditional: 41, positive unconditional: 581, negative: 118, negative conditional: 38, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 740, positive: 622, positive conditional: 41, positive unconditional: 581, negative: 118, negative conditional: 38, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 229, positive: 195, positive conditional: 14, positive unconditional: 181, negative: 34, negative conditional: 8, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 229, positive: 184, positive conditional: 0, positive unconditional: 184, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 34, negative conditional: 8, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 432, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 391, negative conditional: 158, negative unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 740, positive: 427, positive conditional: 27, positive unconditional: 400, negative: 84, negative conditional: 30, negative unconditional: 54, unknown: 229, unknown conditional: 22, unknown unconditional: 207] , Statistics on independence cache: Total cache size (in pairs): 2065, Positive cache size: 1983, Positive conditional cache size: 14, Positive unconditional cache size: 1969, Negative cache size: 82, Negative conditional cache size: 8, Negative unconditional cache size: 74, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1637.9ms, 48 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 532 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 720 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 237, positive: 207, positive conditional: 207, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 237, positive: 207, positive conditional: 0, positive unconditional: 207, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 237, positive: 207, positive conditional: 0, positive unconditional: 207, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 253, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 253, negative conditional: 0, negative unconditional: 253, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 237, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 2084, Positive cache size: 1995, Positive conditional cache size: 14, Positive unconditional cache size: 1981, Negative cache size: 89, Negative conditional cache size: 8, Negative unconditional cache size: 81, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 192.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 606 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 321 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 64, positive conditional: 0, positive unconditional: 64, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2088, Positive cache size: 1996, Positive conditional cache size: 14, Positive unconditional cache size: 1982, Negative cache size: 92, Negative conditional cache size: 8, Negative unconditional cache size: 84, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.4ms, 44 PlacesBefore, 44 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 686 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 452 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2089, Positive cache size: 1996, Positive conditional cache size: 14, Positive unconditional cache size: 1982, Negative cache size: 93, Negative conditional cache size: 8, Negative unconditional cache size: 85, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 108.5ms, 46 PlacesBefore, 46 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 483 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2094, Positive cache size: 2000, Positive conditional cache size: 14, Positive unconditional cache size: 1986, Negative cache size: 94, Negative conditional cache size: 8, Negative unconditional cache size: 86, Eliminated conditions: 37 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 106.0ms, 48 PlacesBefore, 48 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 491 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 105, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 105, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 105, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2095, Positive cache size: 2001, Positive conditional cache size: 14, Positive unconditional cache size: 1987, Negative cache size: 94, Negative conditional cache size: 8, Negative unconditional cache size: 86, Eliminated conditions: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 126.6ms, 50 PlacesBefore, 50 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 746 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 455 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 109, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 109, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ 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] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 109, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2096, Positive cache size: 2002, Positive conditional cache size: 14, Positive unconditional cache size: 1988, Negative cache size: 94, Negative conditional cache size: 8, Negative unconditional cache size: 86, Eliminated conditions: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2164.0ms, 56 PlacesBefore, 56 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 1128 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, positive: 101, positive conditional: 33, positive unconditional: 68, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, positive: 101, positive conditional: 33, positive unconditional: 68, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 8, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 131, positive: 92, positive conditional: 25, positive unconditional: 67, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 9, unknown conditional: 8, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2105, Positive cache size: 2011, Positive conditional cache size: 22, Positive unconditional cache size: 1989, Negative cache size: 94, Negative conditional cache size: 8, Negative unconditional cache size: 86, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2452.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1098 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 654 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 69, positive conditional: 69, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 86, positive: 69, positive conditional: 16, positive unconditional: 53, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 69, positive conditional: 16, positive unconditional: 53, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 68, positive conditional: 16, positive unconditional: 52, 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): 2107, Positive cache size: 2012, Positive conditional cache size: 22, Positive unconditional cache size: 1990, Negative cache size: 95, Negative conditional cache size: 8, Negative unconditional cache size: 87, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4558.0ms, 66 PlacesBefore, 66 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1536 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1805 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, positive: 365, positive conditional: 365, positive unconditional: 0, negative: 40, negative conditional: 40, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 405, positive: 365, positive conditional: 174, positive unconditional: 191, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 405, positive: 365, positive conditional: 174, positive unconditional: 191, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 13, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 405, positive: 340, positive conditional: 161, positive unconditional: 179, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 25, unknown conditional: 13, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 2132, Positive cache size: 2037, Positive conditional cache size: 35, Positive unconditional cache size: 2002, Negative cache size: 95, Negative conditional cache size: 8, Negative unconditional cache size: 87, Eliminated conditions: 81 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1962.9ms, 69 PlacesBefore, 69 PlacesAfterwards, 73 TransitionsBefore, 72 TransitionsAfterwards, 1416 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2272 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 419, positive: 369, positive conditional: 369, positive unconditional: 0, negative: 50, negative conditional: 50, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 419, positive: 369, positive conditional: 135, positive unconditional: 234, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 419, positive: 369, positive conditional: 135, positive unconditional: 234, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 419, positive: 360, positive conditional: 126, positive unconditional: 234, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2141, Positive cache size: 2046, Positive conditional cache size: 44, Positive unconditional cache size: 2002, Negative cache size: 95, Negative conditional cache size: 8, Negative unconditional cache size: 87, Eliminated conditions: 98 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1794.7ms, 73 PlacesBefore, 69 PlacesAfterwards, 68 TransitionsBefore, 65 TransitionsAfterwards, 1120 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 2514 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 370, positive: 304, positive conditional: 304, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 370, positive: 304, positive conditional: 99, positive unconditional: 205, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 370, positive: 304, positive conditional: 99, positive unconditional: 205, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ 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: 370, positive: 294, positive conditional: 89, positive unconditional: 205, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2151, Positive cache size: 2056, Positive conditional cache size: 54, Positive unconditional cache size: 2002, Negative cache size: 95, Negative conditional cache size: 8, Negative unconditional cache size: 87, Eliminated conditions: 73 - 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_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L796] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L816] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L824] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L824] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L825] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L825] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L826] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L827] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L828] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L829] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2] [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L802] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L802] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L802] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L835] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L835] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L835] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L870] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L870] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L871] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L872] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L874] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 113 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 25074.6ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3331.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3769.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 75 SDtfs, 45 SDslu, 36 SDs, 0 SdLazy, 224 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 231.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 137.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=11, InterpolantAutomatonStates: 53, 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: 38.6ms SsaConstructionTime, 331.8ms SatisfiabilityAnalysisTime, 599.1ms InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 691 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...