/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:13:49,424 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:13:49,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:13:49,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:13:49,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:13:49,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:13:49,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:13:49,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:13:49,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:13:49,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:13:49,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:13:49,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:13:49,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:13:49,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:13:49,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:13:49,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:13:49,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:13:49,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:13:49,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:13:49,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:13:49,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:13:49,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:13:49,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:13:49,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:13:49,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:13:49,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:13:49,513 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:13:49,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:13:49,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:13:49,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:13:49,515 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:13:49,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:13:49,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:13:49,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:13:49,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:13:49,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:13:49,519 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:13:49,519 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:13:49,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:13:49,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:13:49,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:13:49,522 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-RepeatedSemanticLbe.epf [2021-06-11 06:13:49,556 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:13:49,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:13:49,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:13:49,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:13:49,559 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:13:49,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:13:49,559 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:13:49,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:13:49,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:13:49,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:13:49,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:13:49,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:13:49,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:13:49,561 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:13:49,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:13:49,561 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:13:49,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:13:49,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:13:49,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:13:49,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:13:49,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:13:49,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:13:49,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:13:49,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:13:49,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:13:49,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:13:49,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:13:49,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:13:49,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:13:49,563 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-06-11 06:13:49,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:13:49,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:13:49,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:13:49,875 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:13:49,875 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:13:49,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_rmo.opt.i [2021-06-11 06:13:49,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b0ca679/0abb0a190aaa428784a8c2dd80d43673/FLAGff9ec643d [2021-06-11 06:13:50,339 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:13:50,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_rmo.opt.i [2021-06-11 06:13:50,350 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b0ca679/0abb0a190aaa428784a8c2dd80d43673/FLAGff9ec643d [2021-06-11 06:13:50,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27b0ca679/0abb0a190aaa428784a8c2dd80d43673 [2021-06-11 06:13:50,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:13:50,695 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:13:50,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:13:50,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:13:50,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:13:50,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:13:50" (1/1) ... [2021-06-11 06:13:50,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2235c4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:50, skipping insertion in model container [2021-06-11 06:13:50,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:13:50" (1/1) ... [2021-06-11 06:13:50,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:13:50,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:13:50,900 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/mix033_rmo.opt.i[948,961] [2021-06-11 06:13:51,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:13:51,050 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:13:51,059 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/mix033_rmo.opt.i[948,961] [2021-06-11 06:13:51,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:13:51,160 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:13:51,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51 WrapperNode [2021-06-11 06:13:51,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:13:51,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:13:51,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:13:51,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:13:51,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:13:51,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:13:51,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:13:51,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:13:51,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,214 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (1/1) ... [2021-06-11 06:13:51,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:13:51,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:13:51,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:13:51,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:13:51,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (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-06-11 06:13:51,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:13:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:13:51,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:13:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:13:51,315 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:13:51,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:13:51,316 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:13:51,316 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:13:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 06:13:51,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 06:13:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:13:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:13:51,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:13:51,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:13:51,319 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:13:52,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:13:52,937 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:13:52,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:13:52 BoogieIcfgContainer [2021-06-11 06:13:52,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:13:52,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:13:52,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:13:52,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:13:52,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:13:50" (1/3) ... [2021-06-11 06:13:52,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c77c82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:13:52, skipping insertion in model container [2021-06-11 06:13:52,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:13:51" (2/3) ... [2021-06-11 06:13:52,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c77c82b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:13:52, skipping insertion in model container [2021-06-11 06:13:52,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:13:52" (3/3) ... [2021-06-11 06:13:52,949 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_rmo.opt.i [2021-06-11 06:13:52,957 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:13:52,961 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:13:52,961 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:13:52,995 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,996 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,996 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,997 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,997 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,997 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,998 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,998 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:52,999 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,000 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,001 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,003 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,009 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,010 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,012 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,013 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,019 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,024 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,025 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,025 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,025 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,026 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,027 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,028 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,030 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,034 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,034 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,034 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,035 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,036 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,037 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:13:53,038 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:13:53,054 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 06:13:53,070 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:13:53,071 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:13:53,071 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:13:53,071 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:13:53,071 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:13:53,071 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:13:53,071 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:13:53,071 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:13:53,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-06-11 06:13:53,113 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-06-11 06:13:53,113 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:13:53,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-11 06:13:53,116 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-06-11 06:13:53,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-06-11 06:13:53,121 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:13:53,131 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 101 transitions, 211 flow [2021-06-11 06:13:53,134 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 101 transitions, 211 flow [2021-06-11 06:13:53,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 211 flow [2021-06-11 06:13:53,154 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-06-11 06:13:53,155 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:13:53,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-06-11 06:13:53,158 INFO L151 LiptonReduction]: Number of co-enabled transitions 1832 [2021-06-11 06:13:53,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,397 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:13:53,397 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:13:53,427 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:53,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:53,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:54,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:54,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:54,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:54,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:54,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:54,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,322 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:54,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:54,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:54,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,540 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:13:54,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:54,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:54,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:55,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:55,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:55,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:55,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:55,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:55,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:55,313 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:13:55,748 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 06:13:55,879 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 06:13:55,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:55,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:13:55,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:55,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,905 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:13:55,905 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:13:55,908 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,910 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 06:13:55,910 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:55,912 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 06:13:55,913 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 06:13:55,913 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:13:55,915 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,917 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 06:13:55,918 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 06:13:55,918 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:13:55,920 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,925 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 06:13:55,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:55,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:55,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:55,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:56,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:56,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:56,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:56,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:56,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:56,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:56,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:56,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:56,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:56,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:56,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:56,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:56,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,616 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:13:56,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:56,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,807 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 06:13:56,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:56,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:57,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:57,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:57,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:57,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:57,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:57,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:57,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,621 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:57,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:57,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:57,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:57,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,990 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:57,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:13:57,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:57,993 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:57,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,995 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:57,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:57,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 06:13:57,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 06:13:57,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:58,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:58,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 06:13:58,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 06:13:58,372 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 06:13:58,526 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 06:13:58,897 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-06-11 06:13:59,035 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-06-11 06:13:59,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:59,049 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:13:59,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:59,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:13:59,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:13:59,065 INFO L163 LiptonReduction]: Checked pairs total: 4955 [2021-06-11 06:13:59,065 INFO L165 LiptonReduction]: Total number of compositions: 93 [2021-06-11 06:13:59,068 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5948 [2021-06-11 06:13:59,075 INFO L129 PetriNetUnfolder]: 0/13 cut-off events. [2021-06-11 06:13:59,076 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:13:59,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:13:59,076 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:13:59,077 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:13:59,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:13:59,081 INFO L82 PathProgramCache]: Analyzing trace with hash 460211571, now seen corresponding path program 1 times [2021-06-11 06:13:59,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:13:59,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117353939] [2021-06-11 06:13:59,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:13:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:13:59,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:59,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:13:59,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:13:59,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117353939] [2021-06-11 06:13:59,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:13:59,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:13:59,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990523123] [2021-06-11 06:13:59,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:13:59,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:13:59,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:13:59,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:13:59,320 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 197 [2021-06-11 06:13:59,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-06-11 06:13:59,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:13:59,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 197 [2021-06-11 06:13:59,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:13:59,393 INFO L129 PetriNetUnfolder]: 9/50 cut-off events. [2021-06-11 06:13:59,393 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:13:59,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 50 events. 9/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 142 event pairs, 1 based on Foata normal form. 12/60 useless extension candidates. Maximal degree in co-relation 72. Up to 17 conditions per place. [2021-06-11 06:13:59,395 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 5 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-06-11 06:13:59,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 75 flow [2021-06-11 06:13:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:13:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:13:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2021-06-11 06:13:59,408 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.868020304568528 [2021-06-11 06:13:59,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2021-06-11 06:13:59,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2021-06-11 06:13:59,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:13:59,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2021-06-11 06:13:59,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-06-11 06:13:59,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:13:59,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:13:59,425 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 513 transitions. [2021-06-11 06:13:59,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 75 flow [2021-06-11 06:13:59,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 72 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 06:13:59,428 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2021-06-11 06:13:59,430 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2021-06-11 06:13:59,430 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 06:13:59,430 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:13:59,431 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 58 flow [2021-06-11 06:13:59,431 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 58 flow [2021-06-11 06:13:59,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 58 flow [2021-06-11 06:13:59,436 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-06-11 06:13:59,436 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:13:59,437 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:13:59,437 INFO L151 LiptonReduction]: Number of co-enabled transitions 278 [2021-06-11 06:13:59,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:13:59,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:13:59,814 INFO L163 LiptonReduction]: Checked pairs total: 652 [2021-06-11 06:13:59,815 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:13:59,815 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 385 [2021-06-11 06:13:59,816 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-06-11 06:13:59,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-06-11 06:13:59,816 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:13:59,816 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:13:59,816 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:13:59,817 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:13:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:13:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 629455488, now seen corresponding path program 1 times [2021-06-11 06:13:59,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:13:59,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292127510] [2021-06-11 06:13:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:13:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:13:59,903 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:13:59,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:13:59,917 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 06:13:59,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 06:13:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:13:59,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292127510] [2021-06-11 06:13:59,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:13:59,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:13:59,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140036838] [2021-06-11 06:13:59,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:13:59,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:13:59,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:13:59,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:13:59,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 199 [2021-06-11 06:13:59,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 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-06-11 06:13:59,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:13:59,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 199 [2021-06-11 06:13:59,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:00,052 INFO L129 PetriNetUnfolder]: 148/347 cut-off events. [2021-06-11 06:14:00,052 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:14:00,054 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 347 events. 148/347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1886 event pairs, 34 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 611. Up to 117 conditions per place. [2021-06-11 06:14:00,055 INFO L132 encePairwiseOnDemand]: 190/199 looper letters, 7 selfloop transitions, 7 changer transitions 14/42 dead transitions. [2021-06-11 06:14:00,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 150 flow [2021-06-11 06:14:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:14:00,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:14:00,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 749 transitions. [2021-06-11 06:14:00,060 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7527638190954774 [2021-06-11 06:14:00,060 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 749 transitions. [2021-06-11 06:14:00,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 749 transitions. [2021-06-11 06:14:00,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:00,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 749 transitions. [2021-06-11 06:14:00,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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-06-11 06:14:00,065 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-06-11 06:14:00,066 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-06-11 06:14:00,066 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 749 transitions. [2021-06-11 06:14:00,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 150 flow [2021-06-11 06:14:00,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:14:00,068 INFO L241 Difference]: Finished difference. Result has 38 places, 28 transitions, 116 flow [2021-06-11 06:14:00,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2021-06-11 06:14:00,069 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2021-06-11 06:14:00,069 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:00,069 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 28 transitions, 116 flow [2021-06-11 06:14:00,069 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 28 transitions, 116 flow [2021-06-11 06:14:00,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 116 flow [2021-06-11 06:14:00,093 INFO L129 PetriNetUnfolder]: 72/193 cut-off events. [2021-06-11 06:14:00,093 INFO L130 PetriNetUnfolder]: For 52/63 co-relation queries the response was YES. [2021-06-11 06:14:00,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 193 events. 72/193 cut-off events. For 52/63 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 975 event pairs, 38 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 451. Up to 117 conditions per place. [2021-06-11 06:14:00,096 INFO L151 LiptonReduction]: Number of co-enabled transitions 280 [2021-06-11 06:14:00,100 INFO L163 LiptonReduction]: Checked pairs total: 148 [2021-06-11 06:14:00,100 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:00,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-06-11 06:14:00,102 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 116 flow [2021-06-11 06:14:00,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 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-06-11 06:14:00,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:00,102 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:14:00,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:14:00,102 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:00,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:00,103 INFO L82 PathProgramCache]: Analyzing trace with hash -427628767, now seen corresponding path program 1 times [2021-06-11 06:14:00,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:00,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841049239] [2021-06-11 06:14:00,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:00,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:00,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:00,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841049239] [2021-06-11 06:14:00,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:00,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:14:00,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402347789] [2021-06-11 06:14:00,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:14:00,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:00,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:14:00,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:14:00,152 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 199 [2021-06-11 06:14:00,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-06-11 06:14:00,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:00,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 199 [2021-06-11 06:14:00,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:00,182 INFO L129 PetriNetUnfolder]: 57/166 cut-off events. [2021-06-11 06:14:00,183 INFO L130 PetriNetUnfolder]: For 88/100 co-relation queries the response was YES. [2021-06-11 06:14:00,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 166 events. 57/166 cut-off events. For 88/100 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 781 event pairs, 24 based on Foata normal form. 2/163 useless extension candidates. Maximal degree in co-relation 409. Up to 96 conditions per place. [2021-06-11 06:14:00,185 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 1 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-06-11 06:14:00,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 124 flow [2021-06-11 06:14:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:14:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:14:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-06-11 06:14:00,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8609715242881072 [2021-06-11 06:14:00,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-06-11 06:14:00,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-06-11 06:14:00,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:00,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-06-11 06:14:00,189 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-06-11 06:14:00,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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-06-11 06:14:00,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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-06-11 06:14:00,191 INFO L185 Difference]: Start difference. First operand has 35 places, 28 transitions, 116 flow. Second operand 3 states and 514 transitions. [2021-06-11 06:14:00,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 124 flow [2021-06-11 06:14:00,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 98 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-06-11 06:14:00,194 INFO L241 Difference]: Finished difference. Result has 34 places, 28 transitions, 101 flow [2021-06-11 06:14:00,195 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2021-06-11 06:14:00,195 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2021-06-11 06:14:00,195 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:00,195 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 101 flow [2021-06-11 06:14:00,195 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 101 flow [2021-06-11 06:14:00,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 101 flow [2021-06-11 06:14:00,212 INFO L129 PetriNetUnfolder]: 57/160 cut-off events. [2021-06-11 06:14:00,213 INFO L130 PetriNetUnfolder]: For 26/31 co-relation queries the response was YES. [2021-06-11 06:14:00,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 160 events. 57/160 cut-off events. For 26/31 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 768 event pairs, 28 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 315. Up to 96 conditions per place. [2021-06-11 06:14:00,215 INFO L151 LiptonReduction]: Number of co-enabled transitions 278 [2021-06-11 06:14:00,217 INFO L163 LiptonReduction]: Checked pairs total: 146 [2021-06-11 06:14:00,217 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:00,218 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-06-11 06:14:00,218 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 101 flow [2021-06-11 06:14:00,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-06-11 06:14:00,219 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:00,219 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:14:00,219 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:14:00,219 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:00,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:00,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2003873701, now seen corresponding path program 1 times [2021-06-11 06:14:00,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:00,220 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880936279] [2021-06-11 06:14:00,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:00,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:00,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:00,263 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:14:00,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:14:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:00,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880936279] [2021-06-11 06:14:00,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:00,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:14:00,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130639532] [2021-06-11 06:14:00,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:14:00,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:00,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:14:00,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:14:00,276 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 199 [2021-06-11 06:14:00,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 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-06-11 06:14:00,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:00,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 199 [2021-06-11 06:14:00,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:00,317 INFO L129 PetriNetUnfolder]: 51/168 cut-off events. [2021-06-11 06:14:00,317 INFO L130 PetriNetUnfolder]: For 46/90 co-relation queries the response was YES. [2021-06-11 06:14:00,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 168 events. 51/168 cut-off events. For 46/90 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 817 event pairs, 23 based on Foata normal form. 7/171 useless extension candidates. Maximal degree in co-relation 416. Up to 88 conditions per place. [2021-06-11 06:14:00,319 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 8 selfloop transitions, 11 changer transitions 0/33 dead transitions. [2021-06-11 06:14:00,319 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 162 flow [2021-06-11 06:14:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:14:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:14:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2021-06-11 06:14:00,321 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7864321608040201 [2021-06-11 06:14:00,321 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 626 transitions. [2021-06-11 06:14:00,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 626 transitions. [2021-06-11 06:14:00,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:00,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 626 transitions. [2021-06-11 06:14:00,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 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-06-11 06:14:00,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:14:00,325 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:14:00,326 INFO L185 Difference]: Start difference. First operand has 34 places, 28 transitions, 101 flow. Second operand 4 states and 626 transitions. [2021-06-11 06:14:00,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 162 flow [2021-06-11 06:14:00,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:14:00,327 INFO L241 Difference]: Finished difference. Result has 37 places, 32 transitions, 153 flow [2021-06-11 06:14:00,327 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2021-06-11 06:14:00,328 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2021-06-11 06:14:00,328 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:00,328 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 32 transitions, 153 flow [2021-06-11 06:14:00,328 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 153 flow [2021-06-11 06:14:00,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 153 flow [2021-06-11 06:14:00,342 INFO L129 PetriNetUnfolder]: 51/148 cut-off events. [2021-06-11 06:14:00,343 INFO L130 PetriNetUnfolder]: For 90/101 co-relation queries the response was YES. [2021-06-11 06:14:00,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 148 events. 51/148 cut-off events. For 90/101 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 707 event pairs, 21 based on Foata normal form. 1/145 useless extension candidates. Maximal degree in co-relation 374. Up to 88 conditions per place. [2021-06-11 06:14:00,344 INFO L151 LiptonReduction]: Number of co-enabled transitions 316 [2021-06-11 06:14:00,347 INFO L163 LiptonReduction]: Checked pairs total: 197 [2021-06-11 06:14:00,347 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:00,348 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-06-11 06:14:00,348 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 153 flow [2021-06-11 06:14:00,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 152.75) internal successors, (611), 4 states have internal predecessors, (611), 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-06-11 06:14:00,349 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:00,349 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:14:00,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:14:00,349 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:00,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:00,350 INFO L82 PathProgramCache]: Analyzing trace with hash -681444253, now seen corresponding path program 1 times [2021-06-11 06:14:00,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:00,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765378234] [2021-06-11 06:14:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:00,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:00,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:00,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765378234] [2021-06-11 06:14:00,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:00,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:14:00,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308008130] [2021-06-11 06:14:00,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:14:00,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:00,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:14:00,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:14:00,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 199 [2021-06-11 06:14:00,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-06-11 06:14:00,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:00,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 199 [2021-06-11 06:14:00,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:00,411 INFO L129 PetriNetUnfolder]: 39/132 cut-off events. [2021-06-11 06:14:00,412 INFO L130 PetriNetUnfolder]: For 134/149 co-relation queries the response was YES. [2021-06-11 06:14:00,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 132 events. 39/132 cut-off events. For 134/149 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 577 event pairs, 16 based on Foata normal form. 8/136 useless extension candidates. Maximal degree in co-relation 333. Up to 70 conditions per place. [2021-06-11 06:14:00,413 INFO L132 encePairwiseOnDemand]: 196/199 looper letters, 1 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-06-11 06:14:00,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 161 flow [2021-06-11 06:14:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:14:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:14:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-06-11 06:14:00,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8609715242881072 [2021-06-11 06:14:00,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-06-11 06:14:00,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-06-11 06:14:00,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:00,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-06-11 06:14:00,416 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-06-11 06:14:00,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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-06-11 06:14:00,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 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-06-11 06:14:00,418 INFO L185 Difference]: Start difference. First operand has 37 places, 32 transitions, 153 flow. Second operand 3 states and 514 transitions. [2021-06-11 06:14:00,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 161 flow [2021-06-11 06:14:00,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 161 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:14:00,421 INFO L241 Difference]: Finished difference. Result has 40 places, 32 transitions, 164 flow [2021-06-11 06:14:00,421 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2021-06-11 06:14:00,421 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2021-06-11 06:14:00,421 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:00,421 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 32 transitions, 164 flow [2021-06-11 06:14:00,422 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 32 transitions, 164 flow [2021-06-11 06:14:00,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 32 transitions, 164 flow [2021-06-11 06:14:00,435 INFO L129 PetriNetUnfolder]: 39/122 cut-off events. [2021-06-11 06:14:00,435 INFO L130 PetriNetUnfolder]: For 87/98 co-relation queries the response was YES. [2021-06-11 06:14:00,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 347 conditions, 122 events. 39/122 cut-off events. For 87/98 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 527 event pairs, 14 based on Foata normal form. 1/119 useless extension candidates. Maximal degree in co-relation 332. Up to 70 conditions per place. [2021-06-11 06:14:00,437 INFO L151 LiptonReduction]: Number of co-enabled transitions 316 [2021-06-11 06:14:00,439 INFO L163 LiptonReduction]: Checked pairs total: 197 [2021-06-11 06:14:00,440 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:00,440 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-06-11 06:14:00,440 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 164 flow [2021-06-11 06:14:00,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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-06-11 06:14:00,441 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:00,441 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:14:00,441 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:14:00,441 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:00,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:00,441 INFO L82 PathProgramCache]: Analyzing trace with hash 369724822, now seen corresponding path program 1 times [2021-06-11 06:14:00,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:00,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288338643] [2021-06-11 06:14:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:00,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:00,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:00,487 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:14:00,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:14:00,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:00,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:00,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:00,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288338643] [2021-06-11 06:14:00,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:00,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:14:00,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523893603] [2021-06-11 06:14:00,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:14:00,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:00,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:14:00,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:14:00,497 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 199 [2021-06-11 06:14:00,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-06-11 06:14:00,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:00,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 199 [2021-06-11 06:14:00,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:00,570 INFO L129 PetriNetUnfolder]: 215/503 cut-off events. [2021-06-11 06:14:00,570 INFO L130 PetriNetUnfolder]: For 165/176 co-relation queries the response was YES. [2021-06-11 06:14:00,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1158 conditions, 503 events. 215/503 cut-off events. For 165/176 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 3388 event pairs, 64 based on Foata normal form. 43/449 useless extension candidates. Maximal degree in co-relation 1141. Up to 226 conditions per place. [2021-06-11 06:14:00,574 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 8 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2021-06-11 06:14:00,575 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 222 flow [2021-06-11 06:14:00,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:14:00,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:14:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 810 transitions. [2021-06-11 06:14:00,577 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8140703517587939 [2021-06-11 06:14:00,577 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 810 transitions. [2021-06-11 06:14:00,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 810 transitions. [2021-06-11 06:14:00,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:00,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 810 transitions. [2021-06-11 06:14:00,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 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-06-11 06:14:00,581 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-06-11 06:14:00,582 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-06-11 06:14:00,582 INFO L185 Difference]: Start difference. First operand has 40 places, 32 transitions, 164 flow. Second operand 5 states and 810 transitions. [2021-06-11 06:14:00,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 222 flow [2021-06-11 06:14:00,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 43 transitions, 214 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 06:14:00,585 INFO L241 Difference]: Finished difference. Result has 45 places, 40 transitions, 225 flow [2021-06-11 06:14:00,585 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2021-06-11 06:14:00,585 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2021-06-11 06:14:00,585 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:00,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 40 transitions, 225 flow [2021-06-11 06:14:00,585 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 40 transitions, 225 flow [2021-06-11 06:14:00,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 225 flow [2021-06-11 06:14:00,621 INFO L129 PetriNetUnfolder]: 166/413 cut-off events. [2021-06-11 06:14:00,621 INFO L130 PetriNetUnfolder]: For 334/442 co-relation queries the response was YES. [2021-06-11 06:14:00,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 413 events. 166/413 cut-off events. For 334/442 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2732 event pairs, 61 based on Foata normal form. 8/367 useless extension candidates. Maximal degree in co-relation 1195. Up to 232 conditions per place. [2021-06-11 06:14:00,627 INFO L151 LiptonReduction]: Number of co-enabled transitions 480 [2021-06-11 06:14:00,649 INFO L163 LiptonReduction]: Checked pairs total: 201 [2021-06-11 06:14:00,649 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:00,649 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-06-11 06:14:00,650 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 225 flow [2021-06-11 06:14:00,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-06-11 06:14:00,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:00,650 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:14:00,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:14:00,650 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:00,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:00,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1637026141, now seen corresponding path program 1 times [2021-06-11 06:14:00,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:00,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455177473] [2021-06-11 06:14:00,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:00,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:00,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:00,741 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-06-11 06:14:00,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:14:00,745 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:14:00,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:14:00,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:00,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:00,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455177473] [2021-06-11 06:14:00,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:00,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:14:00,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991821105] [2021-06-11 06:14:00,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:14:00,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:00,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:14:00,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:14:00,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 199 [2021-06-11 06:14:00,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 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-06-11 06:14:00,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:00,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 199 [2021-06-11 06:14:00,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:00,890 INFO L129 PetriNetUnfolder]: 148/425 cut-off events. [2021-06-11 06:14:00,890 INFO L130 PetriNetUnfolder]: For 673/1253 co-relation queries the response was YES. [2021-06-11 06:14:00,892 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1540 conditions, 425 events. 148/425 cut-off events. For 673/1253 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2922 event pairs, 15 based on Foata normal form. 168/546 useless extension candidates. Maximal degree in co-relation 1520. Up to 232 conditions per place. [2021-06-11 06:14:00,894 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 5 selfloop transitions, 18 changer transitions 3/51 dead transitions. [2021-06-11 06:14:00,894 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 340 flow [2021-06-11 06:14:00,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:14:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:14:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1134 transitions. [2021-06-11 06:14:00,897 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8140703517587939 [2021-06-11 06:14:00,897 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1134 transitions. [2021-06-11 06:14:00,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1134 transitions. [2021-06-11 06:14:00,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:00,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1134 transitions. [2021-06-11 06:14:00,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 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-06-11 06:14:00,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 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-06-11 06:14:00,903 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 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-06-11 06:14:00,903 INFO L185 Difference]: Start difference. First operand has 45 places, 40 transitions, 225 flow. Second operand 7 states and 1134 transitions. [2021-06-11 06:14:00,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 340 flow [2021-06-11 06:14:00,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:14:00,907 INFO L241 Difference]: Finished difference. Result has 54 places, 48 transitions, 338 flow [2021-06-11 06:14:00,907 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=338, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2021-06-11 06:14:00,907 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2021-06-11 06:14:00,908 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:00,908 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 338 flow [2021-06-11 06:14:00,908 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 338 flow [2021-06-11 06:14:00,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 338 flow [2021-06-11 06:14:00,940 INFO L129 PetriNetUnfolder]: 122/358 cut-off events. [2021-06-11 06:14:00,940 INFO L130 PetriNetUnfolder]: For 1201/1506 co-relation queries the response was YES. [2021-06-11 06:14:00,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 358 events. 122/358 cut-off events. For 1201/1506 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2441 event pairs, 13 based on Foata normal form. 1/314 useless extension candidates. Maximal degree in co-relation 1450. Up to 188 conditions per place. [2021-06-11 06:14:00,946 INFO L151 LiptonReduction]: Number of co-enabled transitions 582 [2021-06-11 06:14:00,967 INFO L163 LiptonReduction]: Checked pairs total: 289 [2021-06-11 06:14:00,967 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:00,967 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-06-11 06:14:00,968 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 338 flow [2021-06-11 06:14:00,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 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-06-11 06:14:00,968 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:00,968 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:14:00,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:14:00,968 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:00,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1124298556, now seen corresponding path program 1 times [2021-06-11 06:14:00,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:00,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921656994] [2021-06-11 06:14:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:01,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:01,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:01,074 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-06-11 06:14:01,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:14:01,079 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 06:14:01,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:14:01,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:01,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:01,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921656994] [2021-06-11 06:14:01,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:01,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:14:01,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066116014] [2021-06-11 06:14:01,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:14:01,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:01,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:14:01,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:14:01,089 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 199 [2021-06-11 06:14:01,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 338 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 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-06-11 06:14:01,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:01,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 199 [2021-06-11 06:14:01,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:01,196 INFO L129 PetriNetUnfolder]: 123/374 cut-off events. [2021-06-11 06:14:01,196 INFO L130 PetriNetUnfolder]: For 1933/3151 co-relation queries the response was YES. [2021-06-11 06:14:01,199 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 374 events. 123/374 cut-off events. For 1933/3151 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2610 event pairs, 8 based on Foata normal form. 156/484 useless extension candidates. Maximal degree in co-relation 1796. Up to 206 conditions per place. [2021-06-11 06:14:01,201 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 22 changer transitions 7/56 dead transitions. [2021-06-11 06:14:01,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 468 flow [2021-06-11 06:14:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 06:14:01,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 06:14:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1452 transitions. [2021-06-11 06:14:01,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8107202680067002 [2021-06-11 06:14:01,205 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1452 transitions. [2021-06-11 06:14:01,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1452 transitions. [2021-06-11 06:14:01,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:01,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1452 transitions. [2021-06-11 06:14:01,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.33333333333334) internal successors, (1452), 9 states have internal predecessors, (1452), 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-06-11 06:14:01,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 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-06-11 06:14:01,214 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 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-06-11 06:14:01,214 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 338 flow. Second operand 9 states and 1452 transitions. [2021-06-11 06:14:01,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 56 transitions, 468 flow [2021-06-11 06:14:01,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 401 flow, removed 21 selfloop flow, removed 5 redundant places. [2021-06-11 06:14:01,227 INFO L241 Difference]: Finished difference. Result has 60 places, 49 transitions, 353 flow [2021-06-11 06:14:01,228 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=353, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2021-06-11 06:14:01,228 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2021-06-11 06:14:01,228 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:01,228 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 49 transitions, 353 flow [2021-06-11 06:14:01,228 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 49 transitions, 353 flow [2021-06-11 06:14:01,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 49 transitions, 353 flow [2021-06-11 06:14:01,256 INFO L129 PetriNetUnfolder]: 109/336 cut-off events. [2021-06-11 06:14:01,256 INFO L130 PetriNetUnfolder]: For 1118/1220 co-relation queries the response was YES. [2021-06-11 06:14:01,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 336 events. 109/336 cut-off events. For 1118/1220 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2420 event pairs, 8 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 1356. Up to 112 conditions per place. [2021-06-11 06:14:01,261 INFO L151 LiptonReduction]: Number of co-enabled transitions 544 [2021-06-11 06:14:01,267 INFO L163 LiptonReduction]: Checked pairs total: 270 [2021-06-11 06:14:01,267 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:01,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-06-11 06:14:01,268 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 353 flow [2021-06-11 06:14:01,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 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-06-11 06:14:01,269 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:01,269 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] [2021-06-11 06:14:01,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:14:01,269 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:01,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:01,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1065225166, now seen corresponding path program 1 times [2021-06-11 06:14:01,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:01,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864390570] [2021-06-11 06:14:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:01,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:01,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:01,353 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:14:01,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:14:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:01,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864390570] [2021-06-11 06:14:01,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:01,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:14:01,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665520089] [2021-06-11 06:14:01,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:14:01,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:14:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:14:01,365 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2021-06-11 06:14:01,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 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-06-11 06:14:01,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:01,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2021-06-11 06:14:01,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:01,451 INFO L129 PetriNetUnfolder]: 160/486 cut-off events. [2021-06-11 06:14:01,451 INFO L130 PetriNetUnfolder]: For 1635/1890 co-relation queries the response was YES. [2021-06-11 06:14:01,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 486 events. 160/486 cut-off events. For 1635/1890 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 3535 event pairs, 8 based on Foata normal form. 9/434 useless extension candidates. Maximal degree in co-relation 2010. Up to 152 conditions per place. [2021-06-11 06:14:01,456 INFO L132 encePairwiseOnDemand]: 190/199 looper letters, 15 selfloop transitions, 18 changer transitions 0/63 dead transitions. [2021-06-11 06:14:01,457 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 493 flow [2021-06-11 06:14:01,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:14:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:14:01,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2021-06-11 06:14:01,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7678391959798995 [2021-06-11 06:14:01,459 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2021-06-11 06:14:01,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2021-06-11 06:14:01,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:01,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2021-06-11 06:14:01,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 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-06-11 06:14:01,463 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-06-11 06:14:01,463 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-06-11 06:14:01,464 INFO L185 Difference]: Start difference. First operand has 59 places, 49 transitions, 353 flow. Second operand 5 states and 764 transitions. [2021-06-11 06:14:01,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 493 flow [2021-06-11 06:14:01,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 427 flow, removed 13 selfloop flow, removed 8 redundant places. [2021-06-11 06:14:01,487 INFO L241 Difference]: Finished difference. Result has 57 places, 59 transitions, 422 flow [2021-06-11 06:14:01,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=422, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2021-06-11 06:14:01,488 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2021-06-11 06:14:01,488 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:01,488 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 59 transitions, 422 flow [2021-06-11 06:14:01,488 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 59 transitions, 422 flow [2021-06-11 06:14:01,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 59 transitions, 422 flow [2021-06-11 06:14:01,526 INFO L129 PetriNetUnfolder]: 151/471 cut-off events. [2021-06-11 06:14:01,526 INFO L130 PetriNetUnfolder]: For 772/801 co-relation queries the response was YES. [2021-06-11 06:14:01,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 471 events. 151/471 cut-off events. For 772/801 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3486 event pairs, 8 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 1698. Up to 152 conditions per place. [2021-06-11 06:14:01,532 INFO L151 LiptonReduction]: Number of co-enabled transitions 704 [2021-06-11 06:14:01,542 INFO L163 LiptonReduction]: Checked pairs total: 245 [2021-06-11 06:14:01,542 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:01,542 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 54 [2021-06-11 06:14:01,545 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 422 flow [2021-06-11 06:14:01,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 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-06-11 06:14:01,545 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:01,545 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] [2021-06-11 06:14:01,545 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 06:14:01,545 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:01,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:01,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1906038862, now seen corresponding path program 2 times [2021-06-11 06:14:01,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:01,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606708254] [2021-06-11 06:14:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:01,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:01,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:01,623 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-06-11 06:14:01,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:14:01,637 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-06-11 06:14:01,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 06:14:01,653 INFO L142 QuantifierPusher]: treesize reduction 14, result has 39.1 percent of original size [2021-06-11 06:14:01,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-11 06:14:01,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:01,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:14:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:01,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606708254] [2021-06-11 06:14:01,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:01,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 06:14:01,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62281513] [2021-06-11 06:14:01,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 06:14:01,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 06:14:01,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 06:14:01,677 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 199 [2021-06-11 06:14:01,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 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-06-11 06:14:01,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:01,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 199 [2021-06-11 06:14:01,678 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:01,954 INFO L129 PetriNetUnfolder]: 408/1156 cut-off events. [2021-06-11 06:14:01,954 INFO L130 PetriNetUnfolder]: For 3278/3606 co-relation queries the response was YES. [2021-06-11 06:14:01,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4463 conditions, 1156 events. 408/1156 cut-off events. For 3278/3606 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 10254 event pairs, 14 based on Foata normal form. 150/1169 useless extension candidates. Maximal degree in co-relation 4438. Up to 360 conditions per place. [2021-06-11 06:14:01,965 INFO L132 encePairwiseOnDemand]: 188/199 looper letters, 28 selfloop transitions, 26 changer transitions 31/112 dead transitions. [2021-06-11 06:14:01,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 112 transitions, 1028 flow [2021-06-11 06:14:01,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 06:14:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 06:14:01,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1244 transitions. [2021-06-11 06:14:01,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6945840312674484 [2021-06-11 06:14:01,969 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1244 transitions. [2021-06-11 06:14:01,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1244 transitions. [2021-06-11 06:14:01,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:01,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1244 transitions. [2021-06-11 06:14:01,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.22222222222223) internal successors, (1244), 9 states have internal predecessors, (1244), 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-06-11 06:14:01,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 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-06-11 06:14:01,978 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 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-06-11 06:14:01,978 INFO L185 Difference]: Start difference. First operand has 57 places, 59 transitions, 422 flow. Second operand 9 states and 1244 transitions. [2021-06-11 06:14:01,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 112 transitions, 1028 flow [2021-06-11 06:14:02,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 112 transitions, 1026 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-06-11 06:14:02,026 INFO L241 Difference]: Finished difference. Result has 71 places, 70 transitions, 623 flow [2021-06-11 06:14:02,026 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=623, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2021-06-11 06:14:02,026 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 35 predicate places. [2021-06-11 06:14:02,026 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:02,027 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 70 transitions, 623 flow [2021-06-11 06:14:02,027 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 70 transitions, 623 flow [2021-06-11 06:14:02,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 70 transitions, 623 flow [2021-06-11 06:14:02,121 INFO L129 PetriNetUnfolder]: 226/706 cut-off events. [2021-06-11 06:14:02,122 INFO L130 PetriNetUnfolder]: For 1588/1643 co-relation queries the response was YES. [2021-06-11 06:14:02,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 706 events. 226/706 cut-off events. For 1588/1643 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5777 event pairs, 10 based on Foata normal form. 9/631 useless extension candidates. Maximal degree in co-relation 2771. Up to 216 conditions per place. [2021-06-11 06:14:02,132 INFO L151 LiptonReduction]: Number of co-enabled transitions 848 [2021-06-11 06:14:02,149 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:14:02,149 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:02,149 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-06-11 06:14:02,150 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 623 flow [2021-06-11 06:14:02,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 133.71428571428572) internal successors, (936), 7 states have internal predecessors, (936), 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-06-11 06:14:02,150 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:02,150 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] [2021-06-11 06:14:02,150 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:14:02,151 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:02,151 INFO L82 PathProgramCache]: Analyzing trace with hash 855335334, now seen corresponding path program 3 times [2021-06-11 06:14:02,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:02,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572532233] [2021-06-11 06:14:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:02,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:02,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:02,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:02,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:02,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:02,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:02,208 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:14:02,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:14:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:02,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572532233] [2021-06-11 06:14:02,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:02,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:14:02,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144893919] [2021-06-11 06:14:02,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:14:02,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:02,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:14:02,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:14:02,221 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 199 [2021-06-11 06:14:02,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 623 flow. Second operand has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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-06-11 06:14:02,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:02,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 199 [2021-06-11 06:14:02,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:02,362 INFO L129 PetriNetUnfolder]: 334/943 cut-off events. [2021-06-11 06:14:02,362 INFO L130 PetriNetUnfolder]: For 1995/2078 co-relation queries the response was YES. [2021-06-11 06:14:02,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 943 events. 334/943 cut-off events. For 1995/2078 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 7916 event pairs, 11 based on Foata normal form. 9/830 useless extension candidates. Maximal degree in co-relation 3797. Up to 334 conditions per place. [2021-06-11 06:14:02,369 INFO L132 encePairwiseOnDemand]: 190/199 looper letters, 8 selfloop transitions, 9 changer transitions 35/80 dead transitions. [2021-06-11 06:14:02,369 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 80 transitions, 824 flow [2021-06-11 06:14:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:14:02,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:14:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 916 transitions. [2021-06-11 06:14:02,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7671691792294807 [2021-06-11 06:14:02,371 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 916 transitions. [2021-06-11 06:14:02,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 916 transitions. [2021-06-11 06:14:02,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:02,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 916 transitions. [2021-06-11 06:14:02,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.66666666666666) internal successors, (916), 6 states have internal predecessors, (916), 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-06-11 06:14:02,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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-06-11 06:14:02,376 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 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-06-11 06:14:02,376 INFO L185 Difference]: Start difference. First operand has 70 places, 70 transitions, 623 flow. Second operand 6 states and 916 transitions. [2021-06-11 06:14:02,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 80 transitions, 824 flow [2021-06-11 06:14:02,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 80 transitions, 809 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 06:14:02,413 INFO L241 Difference]: Finished difference. Result has 72 places, 43 transitions, 335 flow [2021-06-11 06:14:02,413 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2021-06-11 06:14:02,413 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 36 predicate places. [2021-06-11 06:14:02,413 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:02,413 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 43 transitions, 335 flow [2021-06-11 06:14:02,413 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 43 transitions, 335 flow [2021-06-11 06:14:02,414 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 43 transitions, 335 flow [2021-06-11 06:14:02,439 INFO L129 PetriNetUnfolder]: 69/300 cut-off events. [2021-06-11 06:14:02,439 INFO L130 PetriNetUnfolder]: For 691/716 co-relation queries the response was YES. [2021-06-11 06:14:02,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 300 events. 69/300 cut-off events. For 691/716 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2188 event pairs, 4 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 1171. Up to 87 conditions per place. [2021-06-11 06:14:02,443 INFO L151 LiptonReduction]: Number of co-enabled transitions 362 [2021-06-11 06:14:02,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:02,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:02,504 INFO L163 LiptonReduction]: Checked pairs total: 38 [2021-06-11 06:14:02,504 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:14:02,504 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 91 [2021-06-11 06:14:02,504 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 42 transitions, 328 flow [2021-06-11 06:14:02,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 149.8) internal successors, (749), 5 states have internal predecessors, (749), 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-06-11 06:14:02,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:02,505 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] [2021-06-11 06:14:02,505 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 06:14:02,505 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:02,505 INFO L82 PathProgramCache]: Analyzing trace with hash 214434438, now seen corresponding path program 4 times [2021-06-11 06:14:02,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:02,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716740185] [2021-06-11 06:14:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:14:02,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:02,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:14:02,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:14:02,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:14:02,550 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:14:02,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:14:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:14:02,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716740185] [2021-06-11 06:14:02,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:14:02,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:14:02,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268582857] [2021-06-11 06:14:02,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:14:02,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:14:02,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:14:02,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:14:02,561 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 201 [2021-06-11 06:14:02,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 42 transitions, 328 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-06-11 06:14:02,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:14:02,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 201 [2021-06-11 06:14:02,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:14:02,619 INFO L129 PetriNetUnfolder]: 79/346 cut-off events. [2021-06-11 06:14:02,619 INFO L130 PetriNetUnfolder]: For 988/1012 co-relation queries the response was YES. [2021-06-11 06:14:02,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 346 events. 79/346 cut-off events. For 988/1012 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2542 event pairs, 6 based on Foata normal form. 7/320 useless extension candidates. Maximal degree in co-relation 1386. Up to 100 conditions per place. [2021-06-11 06:14:02,622 INFO L132 encePairwiseOnDemand]: 195/201 looper letters, 5 selfloop transitions, 4 changer transitions 7/44 dead transitions. [2021-06-11 06:14:02,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 44 transitions, 374 flow [2021-06-11 06:14:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:14:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:14:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2021-06-11 06:14:02,624 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7761194029850746 [2021-06-11 06:14:02,624 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2021-06-11 06:14:02,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2021-06-11 06:14:02,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:14:02,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2021-06-11 06:14:02,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-06-11 06:14:02,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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-06-11 06:14:02,627 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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-06-11 06:14:02,627 INFO L185 Difference]: Start difference. First operand has 67 places, 42 transitions, 328 flow. Second operand 4 states and 624 transitions. [2021-06-11 06:14:02,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 44 transitions, 374 flow [2021-06-11 06:14:02,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 44 transitions, 313 flow, removed 8 selfloop flow, removed 11 redundant places. [2021-06-11 06:14:02,638 INFO L241 Difference]: Finished difference. Result has 60 places, 37 transitions, 239 flow [2021-06-11 06:14:02,638 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2021-06-11 06:14:02,638 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2021-06-11 06:14:02,639 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:14:02,639 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 37 transitions, 239 flow [2021-06-11 06:14:02,640 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 37 transitions, 239 flow [2021-06-11 06:14:02,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 37 transitions, 239 flow [2021-06-11 06:14:02,652 INFO L129 PetriNetUnfolder]: 26/129 cut-off events. [2021-06-11 06:14:02,652 INFO L130 PetriNetUnfolder]: For 217/220 co-relation queries the response was YES. [2021-06-11 06:14:02,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 129 events. 26/129 cut-off events. For 217/220 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 657 event pairs, 5 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 436. Up to 34 conditions per place. [2021-06-11 06:14:02,654 INFO L151 LiptonReduction]: Number of co-enabled transitions 158 [2021-06-11 06:14:02,656 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:14:02,656 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:14:02,656 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-06-11 06:14:02,658 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 239 flow [2021-06-11 06:14:02,658 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-06-11 06:14:02,659 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:14:02,659 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-06-11 06:14:02,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 06:14:02,659 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:14:02,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:14:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1585671697, now seen corresponding path program 1 times [2021-06-11 06:14:02,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:14:02,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750762613] [2021-06-11 06:14:02,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:14:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:14:02,696 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:14:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:14:02,734 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:14:02,772 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:14:02,772 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:14:02,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 06:14:02,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:14:02 BasicIcfg [2021-06-11 06:14:02,871 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:14:02,871 INFO L168 Benchmark]: Toolchain (without parser) took 12176.71 ms. Allocated memory was 346.0 MB in the beginning and 587.2 MB in the end (delta: 241.2 MB). Free memory was 308.4 MB in the beginning and 305.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 244.3 MB. Max. memory is 16.0 GB. [2021-06-11 06:14:02,871 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 346.0 MB. Free memory is still 326.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:14:02,872 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.83 ms. Allocated memory is still 346.0 MB. Free memory was 308.3 MB in the beginning and 305.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-11 06:14:02,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.23 ms. Allocated memory is still 346.0 MB. Free memory was 305.5 MB in the beginning and 303.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:14:02,872 INFO L168 Benchmark]: Boogie Preprocessor took 29.12 ms. Allocated memory is still 346.0 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:14:02,872 INFO L168 Benchmark]: RCFGBuilder took 1706.20 ms. Allocated memory is still 346.0 MB. Free memory was 301.3 MB in the beginning and 288.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 152.5 MB. Max. memory is 16.0 GB. [2021-06-11 06:14:02,872 INFO L168 Benchmark]: TraceAbstraction took 9928.70 ms. Allocated memory was 346.0 MB in the beginning and 587.2 MB in the end (delta: 241.2 MB). Free memory was 288.3 MB in the beginning and 305.6 MB in the end (delta: -17.3 MB). Peak memory consumption was 222.8 MB. Max. memory is 16.0 GB. [2021-06-11 06:14:02,873 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.13 ms. Allocated memory is still 346.0 MB. Free memory is still 326.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 462.83 ms. Allocated memory is still 346.0 MB. Free memory was 308.3 MB in the beginning and 305.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.23 ms. Allocated memory is still 346.0 MB. Free memory was 305.5 MB in the beginning and 303.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.12 ms. Allocated memory is still 346.0 MB. Free memory was 303.4 MB in the beginning and 301.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1706.20 ms. Allocated memory is still 346.0 MB. Free memory was 301.3 MB in the beginning and 288.3 MB in the end (delta: 13.1 MB). Peak memory consumption was 152.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 9928.70 ms. Allocated memory was 346.0 MB in the beginning and 587.2 MB in the end (delta: 241.2 MB). Free memory was 288.3 MB in the beginning and 305.6 MB in the end (delta: -17.3 MB). Peak memory consumption was 222.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5931.4ms, 109 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1832 CoEnabledTransitionPairs, 8 FixpointIterations, 40 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4955 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2456, positive: 2285, positive conditional: 0, positive unconditional: 2285, negative: 171, negative conditional: 0, negative unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1334, positive: 1295, positive conditional: 0, positive unconditional: 1295, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1334, positive: 1295, positive conditional: 0, positive unconditional: 1295, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1334, positive: 1276, positive conditional: 0, positive unconditional: 1276, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 422, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 380, negative conditional: 0, negative unconditional: 380, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2456, positive: 990, positive conditional: 0, positive unconditional: 990, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 1334, unknown conditional: 0, unknown unconditional: 1334] , Statistics on independence cache: Total cache size (in pairs): 2490, Positive cache size: 2451, Positive conditional cache size: 0, Positive unconditional cache size: 2451, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 383.6ms, 33 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 652 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 164, positive conditional: 0, positive unconditional: 164, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 210, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 184, negative conditional: 0, negative unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, positive: 129, positive conditional: 0, positive unconditional: 129, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 46, unknown conditional: 0, unknown unconditional: 46] , Statistics on independence cache: Total cache size (in pairs): 2576, Positive cache size: 2526, Positive conditional cache size: 0, Positive unconditional cache size: 2526, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.4ms, 38 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 148 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 59, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2582, Positive cache size: 2532, Positive conditional cache size: 0, Positive unconditional cache size: 2532, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.1ms, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 146 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 41, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2584, Positive cache size: 2534, Positive conditional cache size: 0, Positive unconditional cache size: 2534, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.4ms, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 197 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 56, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2585, Positive cache size: 2535, Positive conditional cache size: 0, Positive unconditional cache size: 2535, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 316 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 197 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 56, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2585, Positive cache size: 2535, Positive conditional cache size: 0, Positive unconditional cache size: 2535, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.4ms, 45 PlacesBefore, 45 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 201 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 48, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2586, Positive cache size: 2536, Positive conditional cache size: 0, Positive unconditional cache size: 2536, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.3ms, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 101, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2537, Positive conditional cache size: 0, Positive unconditional cache size: 2537, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.2ms, 60 PlacesBefore, 59 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 60, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2537, Positive conditional cache size: 0, Positive unconditional cache size: 2537, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54.4ms, 57 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 704 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 245 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 69, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 69, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2537, Positive conditional cache size: 0, Positive unconditional cache size: 2537, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 122.4ms, 71 PlacesBefore, 70 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 848 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2537, Positive conditional cache size: 0, Positive unconditional cache size: 2537, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.6ms, 72 PlacesBefore, 67 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 38 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 38, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2784, Positive cache size: 2733, Positive conditional cache size: 0, Positive unconditional cache size: 2733, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8ms, 60 PlacesBefore, 60 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2784, Positive cache size: 2733, Positive conditional cache size: 0, Positive unconditional cache size: 2733, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t888; [L844] FCALL, FORK 0 pthread_create(&t888, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t889; [L846] FCALL, FORK 0 pthread_create(&t889, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t890; [L848] FCALL, FORK 0 pthread_create(&t890, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 a = 1 [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 b = 1 [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 9706.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1501.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6001.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 122 SDtfs, 76 SDslu, 95 SDs, 0 SdLazy, 249 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 279.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 281.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=623occurred in iteration=10, InterpolantAutomatonStates: 63, 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: 35.4ms SsaConstructionTime, 357.1ms SatisfiabilityAnalysisTime, 649.9ms InterpolantComputationTime, 200 NumberOfCodeBlocks, 200 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 168 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112 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...