/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:42:01,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:42:01,111 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:42:01,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:42:01,149 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:42:01,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:42:01,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:42:01,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:42:01,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:42:01,165 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:42:01,166 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:42:01,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:42:01,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:42:01,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:42:01,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:42:01,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:42:01,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:42:01,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:42:01,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:42:01,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:42:01,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:42:01,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:42:01,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:42:01,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:42:01,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:42:01,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:42:01,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:42:01,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:42:01,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:42:01,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:42:01,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:42:01,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:42:01,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:42:01,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:42:01,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:42:01,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:42:01,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:42:01,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:42:01,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:42:01,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:42:01,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:42:01,207 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:42:01,243 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:42:01,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:42:01,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:42:01,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:42:01,247 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:42:01,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:42:01,248 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:42:01,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:42:01,248 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:42:01,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:42:01,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:42:01,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:42:01,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:42:01,249 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:42:01,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:42:01,250 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:42:01,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:42:01,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:42:01,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:42:01,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:42:01,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:42:01,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:42:01,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:42:01,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:42:01,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:42:01,251 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:42:01,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:42:01,251 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:42:01,251 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:42:01,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:42:01,252 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:42:01,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:42:01,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:42:01,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:42:01,580 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:42:01,582 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:42:01,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2021-03-26 10:42:01,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3871d8fc0/075e0ba7b18a492792cd752e33d22bb6/FLAGcdc4cf97e [2021-03-26 10:42:02,230 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:42:02,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.opt.i [2021-03-26 10:42:02,252 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3871d8fc0/075e0ba7b18a492792cd752e33d22bb6/FLAGcdc4cf97e [2021-03-26 10:42:02,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3871d8fc0/075e0ba7b18a492792cd752e33d22bb6 [2021-03-26 10:42:02,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:42:02,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:42:02,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:42:02,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:42:02,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:42:02,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:42:02" (1/1) ... [2021-03-26 10:42:02,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681584f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:02, skipping insertion in model container [2021-03-26 10:42:02,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:42:02" (1/1) ... [2021-03-26 10:42:02,658 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:42:02,718 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:42:02,889 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/safe032_power.opt.i[994,1007] [2021-03-26 10:42:03,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:42:03,094 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:42:03,106 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/safe032_power.opt.i[994,1007] [2021-03-26 10:42:03,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:42:03,214 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:42:03,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03 WrapperNode [2021-03-26 10:42:03,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:42:03,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:42:03,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:42:03,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:42:03,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:42:03,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:42:03,264 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:42:03,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:42:03,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... [2021-03-26 10:42:03,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:42:03,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:42:03,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:42:03,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:42:03,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:42:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:42:03,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:42:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:42:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:42:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:42:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:42:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:42:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:42:03,406 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:42:03,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:42:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:42:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:42:03,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:42:03,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:42:03,409 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:42:06,109 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:42:06,110 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:42:06,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:42:06 BoogieIcfgContainer [2021-03-26 10:42:06,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:42:06,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:42:06,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:42:06,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:42:06,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:42:02" (1/3) ... [2021-03-26 10:42:06,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408999c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:42:06, skipping insertion in model container [2021-03-26 10:42:06,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:42:03" (2/3) ... [2021-03-26 10:42:06,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408999c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:42:06, skipping insertion in model container [2021-03-26 10:42:06,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:42:06" (3/3) ... [2021-03-26 10:42:06,118 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.opt.i [2021-03-26 10:42:06,123 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:42:06,127 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:42:06,128 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:42:06,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,167 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,167 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,167 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,168 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,169 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,170 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,171 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,172 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,173 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,174 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,175 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,176 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,177 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,194 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,195 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,197 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,200 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,201 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,202 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,205 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,206 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,212 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,212 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:42:06,213 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:42:06,229 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:42:06,246 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:42:06,246 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:42:06,246 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:42:06,246 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:42:06,246 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:42:06,247 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:42:06,247 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:42:06,247 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:42:06,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:42:06,288 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:42:06,289 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:06,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:42:06,292 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:42:06,296 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:06,297 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:06,308 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:06,310 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:06,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:42:06,328 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:42:06,329 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:06,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:42:06,332 INFO L142 LiptonReduction]: Number of co-enabled transitions 1668 [2021-03-26 10:42:07,316 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:42:07,671 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-26 10:42:07,787 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:42:09,504 WARN L205 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 10:42:09,845 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:42:11,204 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:42:11,778 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:42:12,550 INFO L154 LiptonReduction]: Checked pairs total: 3146 [2021-03-26 10:42:12,550 INFO L156 LiptonReduction]: Total number of compositions: 65 [2021-03-26 10:42:12,552 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6256 [2021-03-26 10:42:12,561 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:42:12,562 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:12,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:12,563 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:12,563 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:12,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -281805230, now seen corresponding path program 1 times [2021-03-26 10:42:12,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:12,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979905475] [2021-03-26 10:42:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:12,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:12,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:12,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:12,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:12,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979905475] [2021-03-26 10:42:12,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:12,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:12,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548607722] [2021-03-26 10:42:12,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:12,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:12,873 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 162 [2021-03-26 10:42:12,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:12,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:12,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 162 [2021-03-26 10:42:12,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:13,027 INFO L129 PetriNetUnfolder]: 115/301 cut-off events. [2021-03-26 10:42:13,027 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:13,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 301 events. 115/301 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1513 event pairs, 39 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 479. Up to 141 conditions per place. [2021-03-26 10:42:13,032 INFO L132 encePairwiseOnDemand]: 158/162 looper letters, 13 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2021-03-26 10:42:13,032 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 121 flow [2021-03-26 10:42:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2021-03-26 10:42:13,052 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827160493827161 [2021-03-26 10:42:13,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2021-03-26 10:42:13,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2021-03-26 10:42:13,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:13,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2021-03-26 10:42:13,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:13,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:13,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:13,081 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 429 transitions. [2021-03-26 10:42:13,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 121 flow [2021-03-26 10:42:13,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 41 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:13,086 INFO L241 Difference]: Finished difference. Result has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:13,087 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2021-03-26 10:42:13,088 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2021-03-26 10:42:13,088 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:13,088 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:13,090 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:13,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 35 transitions, 80 flow [2021-03-26 10:42:13,100 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 10:42:13,100 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:42:13,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:42:13,101 INFO L142 LiptonReduction]: Number of co-enabled transitions 306 [2021-03-26 10:42:13,572 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:42:13,912 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:42:14,569 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:42:15,195 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:42:15,833 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:42:15,959 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:42:16,345 WARN L205 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 10:42:16,751 WARN L205 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-03-26 10:42:17,722 WARN L205 SmtUtils]: Spent 968.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 10:42:18,591 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification that was a NOOP. DAG size: 285 [2021-03-26 10:42:19,038 INFO L154 LiptonReduction]: Checked pairs total: 1174 [2021-03-26 10:42:19,039 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:42:19,039 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5951 [2021-03-26 10:42:19,040 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:42:19,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,040 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:19,040 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-03-26 10:42:19,041 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:42:19,041 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:19,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:19,041 INFO L82 PathProgramCache]: Analyzing trace with hash 557731296, now seen corresponding path program 1 times [2021-03-26 10:42:19,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:19,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026940394] [2021-03-26 10:42:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:19,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:19,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:19,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:19,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:19,229 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:42:19,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:42:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:19,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026940394] [2021-03-26 10:42:19,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:19,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:19,235 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456148305] [2021-03-26 10:42:19,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:42:19,236 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:19,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:42:19,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:42:19,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 174 [2021-03-26 10:42:19,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:19,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 174 [2021-03-26 10:42:19,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:19,289 INFO L129 PetriNetUnfolder]: 7/41 cut-off events. [2021-03-26 10:42:19,289 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:42:19,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 41 events. 7/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 95 event pairs, 1 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2021-03-26 10:42:19,291 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 3 selfloop transitions, 3 changer transitions 6/31 dead transitions. [2021-03-26 10:42:19,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 96 flow [2021-03-26 10:42:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 743 transitions. [2021-03-26 10:42:19,293 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8540229885057471 [2021-03-26 10:42:19,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 743 transitions. [2021-03-26 10:42:19,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 743 transitions. [2021-03-26 10:42:19,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:19,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 743 transitions. [2021-03-26 10:42:19,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,298 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:19,298 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 743 transitions. [2021-03-26 10:42:19,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 96 flow [2021-03-26 10:42:19,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:19,299 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 75 flow [2021-03-26 10:42:19,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-26 10:42:19,300 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -10 predicate places. [2021-03-26 10:42:19,300 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:19,300 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 10:42:19,301 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 75 flow [2021-03-26 10:42:19,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 25 transitions, 75 flow [2021-03-26 10:42:19,306 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 10:42:19,306 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 10:42:19,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 33 events. 3/33 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-26 10:42:19,310 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 10:42:19,468 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-03-26 10:42:19,991 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:42:20,134 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:42:20,432 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:42:20,572 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:42:20,576 INFO L154 LiptonReduction]: Checked pairs total: 753 [2021-03-26 10:42:20,577 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:42:20,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1277 [2021-03-26 10:42:20,578 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 71 flow [2021-03-26 10:42:20,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:20,579 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:20,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:42:20,579 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -93592942, now seen corresponding path program 1 times [2021-03-26 10:42:20,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:20,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144752760] [2021-03-26 10:42:20,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:20,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:20,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:20,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144752760] [2021-03-26 10:42:20,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:20,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:20,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127466313] [2021-03-26 10:42:20,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:20,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:20,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:20,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:20,650 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 176 [2021-03-26 10:42:20,650 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:20,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 176 [2021-03-26 10:42:20,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:20,672 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:42:20,672 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-03-26 10:42:20,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 31 events. 3/31 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 62 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-26 10:42:20,673 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 10:42:20,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 77 flow [2021-03-26 10:42:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 10:42:20,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882575757575758 [2021-03-26 10:42:20,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 10:42:20,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 10:42:20,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:20,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 10:42:20,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,681 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,681 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 71 flow. Second operand 3 states and 469 transitions. [2021-03-26 10:42:20,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 77 flow [2021-03-26 10:42:20,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:20,683 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 10:42:20,683 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -14 predicate places. [2021-03-26 10:42:20,683 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:20,684 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,684 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,690 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:42:20,690 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:42:20,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 3/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 60 event pairs, 1 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-26 10:42:20,690 INFO L142 LiptonReduction]: Number of co-enabled transitions 226 [2021-03-26 10:42:20,692 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-26 10:42:20,692 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:20,692 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-26 10:42:20,696 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-26 10:42:20,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:20,696 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:20,696 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:20,696 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:42:20,696 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:20,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1386441617, now seen corresponding path program 1 times [2021-03-26 10:42:20,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:20,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315245124] [2021-03-26 10:42:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:20,883 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 10:42:20,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:42:20,922 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 10:42:20,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 10:42:20,932 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-26 10:42:20,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-26 10:42:20,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:20,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:20,989 INFO L142 QuantifierPusher]: treesize reduction 7, result has 75.9 percent of original size [2021-03-26 10:42:20,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:21,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:21,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315245124] [2021-03-26 10:42:21,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:21,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:21,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186475436] [2021-03-26 10:42:21,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:21,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:21,011 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 176 [2021-03-26 10:42:21,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:21,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 176 [2021-03-26 10:42:21,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:21,217 INFO L129 PetriNetUnfolder]: 181/375 cut-off events. [2021-03-26 10:42:21,217 INFO L130 PetriNetUnfolder]: For 94/95 co-relation queries the response was YES. [2021-03-26 10:42:21,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 375 events. 181/375 cut-off events. For 94/95 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1979 event pairs, 7 based on Foata normal form. 17/384 useless extension candidates. Maximal degree in co-relation 776. Up to 192 conditions per place. [2021-03-26 10:42:21,220 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 20 selfloop transitions, 14 changer transitions 0/47 dead transitions. [2021-03-26 10:42:21,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 201 flow [2021-03-26 10:42:21,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:21,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 781 transitions. [2021-03-26 10:42:21,223 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2021-03-26 10:42:21,223 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 781 transitions. [2021-03-26 10:42:21,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 781 transitions. [2021-03-26 10:42:21,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:21,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 781 transitions. [2021-03-26 10:42:21,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,228 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,228 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 6 states and 781 transitions. [2021-03-26 10:42:21,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 201 flow [2021-03-26 10:42:21,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:21,231 INFO L241 Difference]: Finished difference. Result has 40 places, 35 transitions, 165 flow [2021-03-26 10:42:21,231 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2021-03-26 10:42:21,231 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, -7 predicate places. [2021-03-26 10:42:21,231 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:21,231 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 35 transitions, 165 flow [2021-03-26 10:42:21,232 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 35 transitions, 165 flow [2021-03-26 10:42:21,232 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 165 flow [2021-03-26 10:42:21,306 INFO L129 PetriNetUnfolder]: 62/171 cut-off events. [2021-03-26 10:42:21,307 INFO L130 PetriNetUnfolder]: For 161/174 co-relation queries the response was YES. [2021-03-26 10:42:21,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 171 events. 62/171 cut-off events. For 161/174 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 882 event pairs, 14 based on Foata normal form. 2/167 useless extension candidates. Maximal degree in co-relation 448. Up to 89 conditions per place. [2021-03-26 10:42:21,310 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-26 10:42:21,365 INFO L154 LiptonReduction]: Checked pairs total: 76 [2021-03-26 10:42:21,365 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:21,365 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-03-26 10:42:21,366 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 165 flow [2021-03-26 10:42:21,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,367 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:21,367 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:21,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:42:21,367 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:21,368 INFO L82 PathProgramCache]: Analyzing trace with hash -19147117, now seen corresponding path program 1 times [2021-03-26 10:42:21,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:21,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578114787] [2021-03-26 10:42:21,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:21,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:42:21,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:42:21,522 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.6 percent of original size [2021-03-26 10:42:21,526 INFO L147 QuantifierPusher]: treesize reduction 9, result has 82.0 percent of original size 41 [2021-03-26 10:42:21,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:42:21,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:21,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:42:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:21,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578114787] [2021-03-26 10:42:21,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:21,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:21,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707946359] [2021-03-26 10:42:21,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:21,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:21,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:21,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:21,583 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 176 [2021-03-26 10:42:21,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:21,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 176 [2021-03-26 10:42:21,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:21,894 INFO L129 PetriNetUnfolder]: 221/456 cut-off events. [2021-03-26 10:42:21,895 INFO L130 PetriNetUnfolder]: For 497/509 co-relation queries the response was YES. [2021-03-26 10:42:21,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 456 events. 221/456 cut-off events. For 497/509 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2557 event pairs, 11 based on Foata normal form. 19/455 useless extension candidates. Maximal degree in co-relation 1414. Up to 214 conditions per place. [2021-03-26 10:42:21,899 INFO L132 encePairwiseOnDemand]: 166/176 looper letters, 19 selfloop transitions, 11 changer transitions 22/65 dead transitions. [2021-03-26 10:42:21,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 399 flow [2021-03-26 10:42:21,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 995 transitions. [2021-03-26 10:42:21,902 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7066761363636364 [2021-03-26 10:42:21,903 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 995 transitions. [2021-03-26 10:42:21,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 995 transitions. [2021-03-26 10:42:21,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:21,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 995 transitions. [2021-03-26 10:42:21,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.375) internal successors, (995), 8 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,909 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,909 INFO L185 Difference]: Start difference. First operand has 40 places, 35 transitions, 165 flow. Second operand 8 states and 995 transitions. [2021-03-26 10:42:21,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 399 flow [2021-03-26 10:42:21,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 399 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:42:21,917 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 235 flow [2021-03-26 10:42:21,917 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2021-03-26 10:42:21,917 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-26 10:42:21,917 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:21,918 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 235 flow [2021-03-26 10:42:21,918 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 235 flow [2021-03-26 10:42:21,918 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 235 flow [2021-03-26 10:42:21,962 INFO L129 PetriNetUnfolder]: 130/298 cut-off events. [2021-03-26 10:42:21,962 INFO L130 PetriNetUnfolder]: For 479/492 co-relation queries the response was YES. [2021-03-26 10:42:21,964 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 298 events. 130/298 cut-off events. For 479/492 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1611 event pairs, 49 based on Foata normal form. 6/286 useless extension candidates. Maximal degree in co-relation 1037. Up to 156 conditions per place. [2021-03-26 10:42:21,967 INFO L142 LiptonReduction]: Number of co-enabled transitions 330 [2021-03-26 10:42:21,984 INFO L154 LiptonReduction]: Checked pairs total: 111 [2021-03-26 10:42:21,985 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:21,985 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 68 [2021-03-26 10:42:21,989 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 235 flow [2021-03-26 10:42:21,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:21,990 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:21,990 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:21,990 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:42:21,990 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:21,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash 586033743, now seen corresponding path program 1 times [2021-03-26 10:42:21,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:21,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565866942] [2021-03-26 10:42:21,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:22,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:22,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:22,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:22,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:22,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:22,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:22,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565866942] [2021-03-26 10:42:22,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:22,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:22,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517358335] [2021-03-26 10:42:22,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:22,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:22,179 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 10:42:22,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:22,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 10:42:22,180 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:22,419 INFO L129 PetriNetUnfolder]: 176/365 cut-off events. [2021-03-26 10:42:22,420 INFO L130 PetriNetUnfolder]: For 857/890 co-relation queries the response was YES. [2021-03-26 10:42:22,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 365 events. 176/365 cut-off events. For 857/890 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1883 event pairs, 5 based on Foata normal form. 29/380 useless extension candidates. Maximal degree in co-relation 1482. Up to 206 conditions per place. [2021-03-26 10:42:22,424 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 21 selfloop transitions, 23 changer transitions 0/57 dead transitions. [2021-03-26 10:42:22,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 448 flow [2021-03-26 10:42:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1038 transitions. [2021-03-26 10:42:22,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7372159090909091 [2021-03-26 10:42:22,428 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1038 transitions. [2021-03-26 10:42:22,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1038 transitions. [2021-03-26 10:42:22,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:22,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1038 transitions. [2021-03-26 10:42:22,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.75) internal successors, (1038), 8 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,433 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,433 INFO L185 Difference]: Start difference. First operand has 48 places, 38 transitions, 235 flow. Second operand 8 states and 1038 transitions. [2021-03-26 10:42:22,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 448 flow [2021-03-26 10:42:22,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 419 flow, removed 6 selfloop flow, removed 5 redundant places. [2021-03-26 10:42:22,439 INFO L241 Difference]: Finished difference. Result has 51 places, 45 transitions, 322 flow [2021-03-26 10:42:22,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=322, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2021-03-26 10:42:22,440 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2021-03-26 10:42:22,440 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:22,440 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 322 flow [2021-03-26 10:42:22,440 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 322 flow [2021-03-26 10:42:22,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 322 flow [2021-03-26 10:42:22,490 INFO L129 PetriNetUnfolder]: 164/352 cut-off events. [2021-03-26 10:42:22,490 INFO L130 PetriNetUnfolder]: For 761/845 co-relation queries the response was YES. [2021-03-26 10:42:22,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 352 events. 164/352 cut-off events. For 761/845 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1865 event pairs, 34 based on Foata normal form. 22/356 useless extension candidates. Maximal degree in co-relation 1284. Up to 178 conditions per place. [2021-03-26 10:42:22,495 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-26 10:42:22,513 INFO L154 LiptonReduction]: Checked pairs total: 71 [2021-03-26 10:42:22,513 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:22,513 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 73 [2021-03-26 10:42:22,514 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 322 flow [2021-03-26 10:42:22,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,515 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:22,515 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:22,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:42:22,515 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash 76142003, now seen corresponding path program 2 times [2021-03-26 10:42:22,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:22,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654709851] [2021-03-26 10:42:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:22,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:22,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:22,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:22,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:22,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 10:42:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:22,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654709851] [2021-03-26 10:42:22,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:22,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:22,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932163062] [2021-03-26 10:42:22,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:22,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:22,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:22,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:22,646 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 176 [2021-03-26 10:42:22,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,647 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:22,647 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 176 [2021-03-26 10:42:22,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:22,843 INFO L129 PetriNetUnfolder]: 185/389 cut-off events. [2021-03-26 10:42:22,844 INFO L130 PetriNetUnfolder]: For 1078/1117 co-relation queries the response was YES. [2021-03-26 10:42:22,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 389 events. 185/389 cut-off events. For 1078/1117 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2083 event pairs, 12 based on Foata normal form. 26/401 useless extension candidates. Maximal degree in co-relation 1678. Up to 223 conditions per place. [2021-03-26 10:42:22,848 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 24 selfloop transitions, 26 changer transitions 0/63 dead transitions. [2021-03-26 10:42:22,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 556 flow [2021-03-26 10:42:22,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:22,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2021-03-26 10:42:22,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7357954545454546 [2021-03-26 10:42:22,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2021-03-26 10:42:22,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2021-03-26 10:42:22,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:22,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2021-03-26 10:42:22,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,855 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,855 INFO L185 Difference]: Start difference. First operand has 51 places, 45 transitions, 322 flow. Second operand 6 states and 777 transitions. [2021-03-26 10:42:22,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 556 flow [2021-03-26 10:42:22,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 521 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:42:22,861 INFO L241 Difference]: Finished difference. Result has 55 places, 57 transitions, 507 flow [2021-03-26 10:42:22,861 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=55, PETRI_TRANSITIONS=57} [2021-03-26 10:42:22,861 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2021-03-26 10:42:22,861 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:22,861 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 57 transitions, 507 flow [2021-03-26 10:42:22,862 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 57 transitions, 507 flow [2021-03-26 10:42:22,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 57 transitions, 507 flow [2021-03-26 10:42:22,917 INFO L129 PetriNetUnfolder]: 175/363 cut-off events. [2021-03-26 10:42:22,917 INFO L130 PetriNetUnfolder]: For 1175/1245 co-relation queries the response was YES. [2021-03-26 10:42:22,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 363 events. 175/363 cut-off events. For 1175/1245 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1855 event pairs, 15 based on Foata normal form. 33/383 useless extension candidates. Maximal degree in co-relation 1562. Up to 186 conditions per place. [2021-03-26 10:42:22,922 INFO L142 LiptonReduction]: Number of co-enabled transitions 422 [2021-03-26 10:42:22,956 INFO L154 LiptonReduction]: Checked pairs total: 287 [2021-03-26 10:42:22,956 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:22,956 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-26 10:42:22,957 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 507 flow [2021-03-26 10:42:22,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:22,957 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:22,957 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:22,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:42:22,957 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash -843686623, now seen corresponding path program 1 times [2021-03-26 10:42:22,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:22,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830266905] [2021-03-26 10:42:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:23,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:23,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:23,143 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.0 percent of original size [2021-03-26 10:42:23,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:42:23,185 INFO L142 QuantifierPusher]: treesize reduction 12, result has 80.0 percent of original size [2021-03-26 10:42:23,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:42:23,192 INFO L142 QuantifierPusher]: treesize reduction 44, result has 64.8 percent of original size [2021-03-26 10:42:23,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 81 [2021-03-26 10:42:23,238 INFO L142 QuantifierPusher]: treesize reduction 43, result has 68.1 percent of original size [2021-03-26 10:42:23,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 92 [2021-03-26 10:42:23,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:23,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:42:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:23,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830266905] [2021-03-26 10:42:23,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:23,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:23,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083352524] [2021-03-26 10:42:23,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:23,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:23,324 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 176 [2021-03-26 10:42:23,325 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 507 flow. Second operand has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:23,325 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:23,325 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 176 [2021-03-26 10:42:23,325 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:23,633 INFO L129 PetriNetUnfolder]: 199/416 cut-off events. [2021-03-26 10:42:23,633 INFO L130 PetriNetUnfolder]: For 1923/1996 co-relation queries the response was YES. [2021-03-26 10:42:23,635 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 416 events. 199/416 cut-off events. For 1923/1996 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2264 event pairs, 15 based on Foata normal form. 48/448 useless extension candidates. Maximal degree in co-relation 2078. Up to 198 conditions per place. [2021-03-26 10:42:23,638 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 45 selfloop transitions, 22 changer transitions 0/80 dead transitions. [2021-03-26 10:42:23,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 855 flow [2021-03-26 10:42:23,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 999 transitions. [2021-03-26 10:42:23,642 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7095170454545454 [2021-03-26 10:42:23,642 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 999 transitions. [2021-03-26 10:42:23,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 999 transitions. [2021-03-26 10:42:23,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:23,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 999 transitions. [2021-03-26 10:42:23,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.875) internal successors, (999), 8 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:23,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:23,648 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:23,649 INFO L185 Difference]: Start difference. First operand has 55 places, 57 transitions, 507 flow. Second operand 8 states and 999 transitions. [2021-03-26 10:42:23,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 855 flow [2021-03-26 10:42:23,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 819 flow, removed 14 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:23,655 INFO L241 Difference]: Finished difference. Result has 62 places, 68 transitions, 666 flow [2021-03-26 10:42:23,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=666, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2021-03-26 10:42:23,656 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 15 predicate places. [2021-03-26 10:42:23,656 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:23,656 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 68 transitions, 666 flow [2021-03-26 10:42:23,656 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 68 transitions, 666 flow [2021-03-26 10:42:23,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 68 transitions, 666 flow [2021-03-26 10:42:23,718 INFO L129 PetriNetUnfolder]: 186/399 cut-off events. [2021-03-26 10:42:23,718 INFO L130 PetriNetUnfolder]: For 1842/1920 co-relation queries the response was YES. [2021-03-26 10:42:23,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 399 events. 186/399 cut-off events. For 1842/1920 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2214 event pairs, 13 based on Foata normal form. 41/425 useless extension candidates. Maximal degree in co-relation 1826. Up to 200 conditions per place. [2021-03-26 10:42:23,724 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-26 10:42:23,772 INFO L154 LiptonReduction]: Checked pairs total: 331 [2021-03-26 10:42:23,772 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:23,772 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-03-26 10:42:23,773 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 666 flow [2021-03-26 10:42:23,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.14285714285714) internal successors, (855), 7 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:23,773 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:23,773 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:23,773 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:42:23,773 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:23,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:23,774 INFO L82 PathProgramCache]: Analyzing trace with hash 528409171, now seen corresponding path program 2 times [2021-03-26 10:42:23,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:23,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681668554] [2021-03-26 10:42:23,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:23,898 INFO L142 QuantifierPusher]: treesize reduction 30, result has 45.5 percent of original size [2021-03-26 10:42:23,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 10:42:23,914 INFO L142 QuantifierPusher]: treesize reduction 30, result has 48.3 percent of original size [2021-03-26 10:42:23,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:42:23,940 INFO L142 QuantifierPusher]: treesize reduction 71, result has 63.2 percent of original size [2021-03-26 10:42:23,942 INFO L147 QuantifierPusher]: treesize reduction 9, result has 92.6 percent of original size 113 [2021-03-26 10:42:24,018 INFO L142 QuantifierPusher]: treesize reduction 21, result has 78.1 percent of original size [2021-03-26 10:42:24,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 75 [2021-03-26 10:42:24,074 INFO L142 QuantifierPusher]: treesize reduction 21, result has 77.4 percent of original size [2021-03-26 10:42:24,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 10:42:24,132 INFO L142 QuantifierPusher]: treesize reduction 31, result has 77.9 percent of original size [2021-03-26 10:42:24,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 109 [2021-03-26 10:42:24,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:42:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:24,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681668554] [2021-03-26 10:42:24,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:24,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 10:42:24,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566851388] [2021-03-26 10:42:24,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 10:42:24,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:24,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 10:42:24,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-03-26 10:42:24,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 176 [2021-03-26 10:42:24,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 666 flow. Second operand has 9 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:24,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 176 [2021-03-26 10:42:24,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:24,495 INFO L129 PetriNetUnfolder]: 221/465 cut-off events. [2021-03-26 10:42:24,496 INFO L130 PetriNetUnfolder]: For 2613/2762 co-relation queries the response was YES. [2021-03-26 10:42:24,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 465 events. 221/465 cut-off events. For 2613/2762 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2635 event pairs, 6 based on Foata normal form. 103/551 useless extension candidates. Maximal degree in co-relation 2426. Up to 256 conditions per place. [2021-03-26 10:42:24,501 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 24 selfloop transitions, 45 changer transitions 0/82 dead transitions. [2021-03-26 10:42:24,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 82 transitions, 943 flow [2021-03-26 10:42:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:42:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:42:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2021-03-26 10:42:24,505 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7007575757575758 [2021-03-26 10:42:24,505 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 740 transitions. [2021-03-26 10:42:24,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions. [2021-03-26 10:42:24,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:24,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions. [2021-03-26 10:42:24,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,509 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,509 INFO L185 Difference]: Start difference. First operand has 62 places, 68 transitions, 666 flow. Second operand 6 states and 740 transitions. [2021-03-26 10:42:24,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 82 transitions, 943 flow [2021-03-26 10:42:24,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 82 transitions, 877 flow, removed 11 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:24,517 INFO L241 Difference]: Finished difference. Result has 66 places, 76 transitions, 820 flow [2021-03-26 10:42:24,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=820, PETRI_PLACES=66, PETRI_TRANSITIONS=76} [2021-03-26 10:42:24,517 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2021-03-26 10:42:24,517 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:24,517 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 76 transitions, 820 flow [2021-03-26 10:42:24,517 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 76 transitions, 820 flow [2021-03-26 10:42:24,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 76 transitions, 820 flow [2021-03-26 10:42:24,586 INFO L129 PetriNetUnfolder]: 204/432 cut-off events. [2021-03-26 10:42:24,586 INFO L130 PetriNetUnfolder]: For 2596/2801 co-relation queries the response was YES. [2021-03-26 10:42:24,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 432 events. 204/432 cut-off events. For 2596/2801 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2424 event pairs, 27 based on Foata normal form. 91/502 useless extension candidates. Maximal degree in co-relation 2122. Up to 216 conditions per place. [2021-03-26 10:42:24,592 INFO L142 LiptonReduction]: Number of co-enabled transitions 534 [2021-03-26 10:42:24,625 INFO L154 LiptonReduction]: Checked pairs total: 570 [2021-03-26 10:42:24,625 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:24,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-26 10:42:24,625 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 76 transitions, 820 flow [2021-03-26 10:42:24,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 118.88888888888889) internal successors, (1070), 9 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:24,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:24,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:42:24,626 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash 158424233, now seen corresponding path program 1 times [2021-03-26 10:42:24,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:24,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808902841] [2021-03-26 10:42:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:24,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:24,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:42:24,739 INFO L142 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size [2021-03-26 10:42:24,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:42:24,771 INFO L142 QuantifierPusher]: treesize reduction 15, result has 65.9 percent of original size [2021-03-26 10:42:24,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:42:24,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:24,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:42:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:24,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808902841] [2021-03-26 10:42:24,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:24,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:24,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265173158] [2021-03-26 10:42:24,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:24,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:24,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 176 [2021-03-26 10:42:24,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 76 transitions, 820 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:24,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:24,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 176 [2021-03-26 10:42:24,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:25,182 INFO L129 PetriNetUnfolder]: 222/469 cut-off events. [2021-03-26 10:42:25,182 INFO L130 PetriNetUnfolder]: For 3018/3167 co-relation queries the response was YES. [2021-03-26 10:42:25,184 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2625 conditions, 469 events. 222/469 cut-off events. For 3018/3167 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2701 event pairs, 4 based on Foata normal form. 127/577 useless extension candidates. Maximal degree in co-relation 2598. Up to 276 conditions per place. [2021-03-26 10:42:25,188 INFO L132 encePairwiseOnDemand]: 167/176 looper letters, 35 selfloop transitions, 54 changer transitions 0/102 dead transitions. [2021-03-26 10:42:25,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 102 transitions, 1268 flow [2021-03-26 10:42:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2021-03-26 10:42:25,191 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7102272727272727 [2021-03-26 10:42:25,192 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2021-03-26 10:42:25,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2021-03-26 10:42:25,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:25,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2021-03-26 10:42:25,194 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,197 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,197 INFO L185 Difference]: Start difference. First operand has 66 places, 76 transitions, 820 flow. Second operand 7 states and 875 transitions. [2021-03-26 10:42:25,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 102 transitions, 1268 flow [2021-03-26 10:42:25,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 102 transitions, 1206 flow, removed 7 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:25,207 INFO L241 Difference]: Finished difference. Result has 72 places, 93 transitions, 1140 flow [2021-03-26 10:42:25,207 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1140, PETRI_PLACES=72, PETRI_TRANSITIONS=93} [2021-03-26 10:42:25,208 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2021-03-26 10:42:25,208 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:25,208 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 93 transitions, 1140 flow [2021-03-26 10:42:25,208 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 93 transitions, 1140 flow [2021-03-26 10:42:25,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 93 transitions, 1140 flow [2021-03-26 10:42:25,279 INFO L129 PetriNetUnfolder]: 204/433 cut-off events. [2021-03-26 10:42:25,279 INFO L130 PetriNetUnfolder]: For 3023/3125 co-relation queries the response was YES. [2021-03-26 10:42:25,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 433 events. 204/433 cut-off events. For 3023/3125 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2407 event pairs, 14 based on Foata normal form. 64/478 useless extension candidates. Maximal degree in co-relation 2270. Up to 217 conditions per place. [2021-03-26 10:42:25,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 604 [2021-03-26 10:42:25,326 INFO L154 LiptonReduction]: Checked pairs total: 697 [2021-03-26 10:42:25,326 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:25,326 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-26 10:42:25,327 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 93 transitions, 1140 flow [2021-03-26 10:42:25,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:25,327 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:25,328 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:42:25,328 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:25,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash 975100131, now seen corresponding path program 3 times [2021-03-26 10:42:25,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:25,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118791940] [2021-03-26 10:42:25,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:25,445 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 10:42:25,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:42:25,475 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 10:42:25,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 10:42:25,477 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 10:42:25,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:42:25,515 INFO L142 QuantifierPusher]: treesize reduction 37, result has 50.7 percent of original size [2021-03-26 10:42:25,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 10:42:25,551 INFO L142 QuantifierPusher]: treesize reduction 54, result has 56.8 percent of original size [2021-03-26 10:42:25,552 INFO L147 QuantifierPusher]: treesize reduction 9, result has 87.3 percent of original size 62 [2021-03-26 10:42:25,602 INFO L142 QuantifierPusher]: treesize reduction 19, result has 79.1 percent of original size [2021-03-26 10:42:25,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-03-26 10:42:25,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:25,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:42:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:25,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118791940] [2021-03-26 10:42:25,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:25,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:42:25,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91624793] [2021-03-26 10:42:25,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:42:25,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:25,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:42:25,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:42:25,673 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 176 [2021-03-26 10:42:25,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 93 transitions, 1140 flow. Second operand has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:25,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:25,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 176 [2021-03-26 10:42:25,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:26,083 INFO L129 PetriNetUnfolder]: 241/502 cut-off events. [2021-03-26 10:42:26,084 INFO L130 PetriNetUnfolder]: For 3631/3824 co-relation queries the response was YES. [2021-03-26 10:42:26,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 502 events. 241/502 cut-off events. For 3631/3824 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2873 event pairs, 10 based on Foata normal form. 70/549 useless extension candidates. Maximal degree in co-relation 2953. Up to 267 conditions per place. [2021-03-26 10:42:26,090 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 44 selfloop transitions, 51 changer transitions 0/108 dead transitions. [2021-03-26 10:42:26,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 108 transitions, 1477 flow [2021-03-26 10:42:26,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:42:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:42:26,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 956 transitions. [2021-03-26 10:42:26,094 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6789772727272727 [2021-03-26 10:42:26,094 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 956 transitions. [2021-03-26 10:42:26,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 956 transitions. [2021-03-26 10:42:26,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:26,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 956 transitions. [2021-03-26 10:42:26,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.5) internal successors, (956), 8 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,099 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,099 INFO L185 Difference]: Start difference. First operand has 72 places, 93 transitions, 1140 flow. Second operand 8 states and 956 transitions. [2021-03-26 10:42:26,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 108 transitions, 1477 flow [2021-03-26 10:42:26,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 1465 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-03-26 10:42:26,113 INFO L241 Difference]: Finished difference. Result has 81 places, 100 transitions, 1358 flow [2021-03-26 10:42:26,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1358, PETRI_PLACES=81, PETRI_TRANSITIONS=100} [2021-03-26 10:42:26,114 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2021-03-26 10:42:26,114 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:26,114 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 100 transitions, 1358 flow [2021-03-26 10:42:26,114 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 100 transitions, 1358 flow [2021-03-26 10:42:26,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 100 transitions, 1358 flow [2021-03-26 10:42:26,190 INFO L129 PetriNetUnfolder]: 223/463 cut-off events. [2021-03-26 10:42:26,191 INFO L130 PetriNetUnfolder]: For 4170/4256 co-relation queries the response was YES. [2021-03-26 10:42:26,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2768 conditions, 463 events. 223/463 cut-off events. For 4170/4256 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2563 event pairs, 40 based on Foata normal form. 56/490 useless extension candidates. Maximal degree in co-relation 2736. Up to 232 conditions per place. [2021-03-26 10:42:26,201 INFO L142 LiptonReduction]: Number of co-enabled transitions 652 [2021-03-26 10:42:26,246 INFO L154 LiptonReduction]: Checked pairs total: 1002 [2021-03-26 10:42:26,246 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:26,246 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 132 [2021-03-26 10:42:26,248 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 100 transitions, 1358 flow [2021-03-26 10:42:26,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,249 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:26,249 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:26,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:42:26,249 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:26,250 INFO L82 PathProgramCache]: Analyzing trace with hash -610313881, now seen corresponding path program 2 times [2021-03-26 10:42:26,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:26,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64444364] [2021-03-26 10:42:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:26,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:26,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:42:26,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:26,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:26,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64444364] [2021-03-26 10:42:26,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:26,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:26,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417281212] [2021-03-26 10:42:26,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:26,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:26,331 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 176 [2021-03-26 10:42:26,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 100 transitions, 1358 flow. Second operand has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:26,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 176 [2021-03-26 10:42:26,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:26,591 INFO L129 PetriNetUnfolder]: 245/535 cut-off events. [2021-03-26 10:42:26,591 INFO L130 PetriNetUnfolder]: For 4999/5132 co-relation queries the response was YES. [2021-03-26 10:42:26,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 535 events. 245/535 cut-off events. For 4999/5132 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3232 event pairs, 46 based on Foata normal form. 55/568 useless extension candidates. Maximal degree in co-relation 3380. Up to 341 conditions per place. [2021-03-26 10:42:26,598 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 64 selfloop transitions, 29 changer transitions 0/106 dead transitions. [2021-03-26 10:42:26,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 106 transitions, 1610 flow [2021-03-26 10:42:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:42:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:42:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2021-03-26 10:42:26,601 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.765625 [2021-03-26 10:42:26,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2021-03-26 10:42:26,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2021-03-26 10:42:26,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:26,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2021-03-26 10:42:26,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,605 INFO L185 Difference]: Start difference. First operand has 81 places, 100 transitions, 1358 flow. Second operand 4 states and 539 transitions. [2021-03-26 10:42:26,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 106 transitions, 1610 flow [2021-03-26 10:42:26,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 106 transitions, 1569 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-26 10:42:26,619 INFO L241 Difference]: Finished difference. Result has 82 places, 105 transitions, 1474 flow [2021-03-26 10:42:26,619 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1474, PETRI_PLACES=82, PETRI_TRANSITIONS=105} [2021-03-26 10:42:26,620 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2021-03-26 10:42:26,620 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:26,620 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 105 transitions, 1474 flow [2021-03-26 10:42:26,620 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 105 transitions, 1474 flow [2021-03-26 10:42:26,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 105 transitions, 1474 flow [2021-03-26 10:42:26,699 INFO L129 PetriNetUnfolder]: 224/489 cut-off events. [2021-03-26 10:42:26,699 INFO L130 PetriNetUnfolder]: For 4540/4632 co-relation queries the response was YES. [2021-03-26 10:42:26,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 489 events. 224/489 cut-off events. For 4540/4632 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2825 event pairs, 43 based on Foata normal form. 50/512 useless extension candidates. Maximal degree in co-relation 2952. Up to 233 conditions per place. [2021-03-26 10:42:26,707 INFO L142 LiptonReduction]: Number of co-enabled transitions 686 [2021-03-26 10:42:26,764 INFO L154 LiptonReduction]: Checked pairs total: 1553 [2021-03-26 10:42:26,764 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:26,764 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-26 10:42:26,765 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 105 transitions, 1474 flow [2021-03-26 10:42:26,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:26,765 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:26,765 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:26,765 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:42:26,765 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:26,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:26,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1733256449, now seen corresponding path program 4 times [2021-03-26 10:42:26,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:26,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177130555] [2021-03-26 10:42:26,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:26,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:26,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:42:26,877 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-26 10:42:26,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 10:42:26,907 INFO L142 QuantifierPusher]: treesize reduction 3, result has 91.4 percent of original size [2021-03-26 10:42:26,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 10:42:26,945 INFO L142 QuantifierPusher]: treesize reduction 55, result has 61.8 percent of original size [2021-03-26 10:42:26,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 89 [2021-03-26 10:42:27,025 INFO L142 QuantifierPusher]: treesize reduction 33, result has 74.8 percent of original size [2021-03-26 10:42:27,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-03-26 10:42:27,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:27,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177130555] [2021-03-26 10:42:27,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:27,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:42:27,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422968943] [2021-03-26 10:42:27,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:42:27,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:27,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:42:27,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:42:27,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 176 [2021-03-26 10:42:27,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 105 transitions, 1474 flow. Second operand has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 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-03-26 10:42:27,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:27,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 176 [2021-03-26 10:42:27,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:27,529 INFO L129 PetriNetUnfolder]: 247/556 cut-off events. [2021-03-26 10:42:27,529 INFO L130 PetriNetUnfolder]: For 5333/5448 co-relation queries the response was YES. [2021-03-26 10:42:27,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3655 conditions, 556 events. 247/556 cut-off events. For 5333/5448 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3445 event pairs, 21 based on Foata normal form. 48/584 useless extension candidates. Maximal degree in co-relation 3620. Up to 260 conditions per place. [2021-03-26 10:42:27,536 INFO L132 encePairwiseOnDemand]: 168/176 looper letters, 56 selfloop transitions, 48 changer transitions 5/122 dead transitions. [2021-03-26 10:42:27,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 122 transitions, 1902 flow [2021-03-26 10:42:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2021-03-26 10:42:27,540 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6834415584415584 [2021-03-26 10:42:27,540 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2021-03-26 10:42:27,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2021-03-26 10:42:27,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:27,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2021-03-26 10:42:27,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,544 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 176.0) internal successors, (1408), 8 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,544 INFO L185 Difference]: Start difference. First operand has 82 places, 105 transitions, 1474 flow. Second operand 7 states and 842 transitions. [2021-03-26 10:42:27,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 122 transitions, 1902 flow [2021-03-26 10:42:27,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 122 transitions, 1899 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:42:27,564 INFO L241 Difference]: Finished difference. Result has 90 places, 112 transitions, 1759 flow [2021-03-26 10:42:27,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1759, PETRI_PLACES=90, PETRI_TRANSITIONS=112} [2021-03-26 10:42:27,565 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2021-03-26 10:42:27,565 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:27,565 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 112 transitions, 1759 flow [2021-03-26 10:42:27,565 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 112 transitions, 1759 flow [2021-03-26 10:42:27,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 112 transitions, 1759 flow [2021-03-26 10:42:27,657 INFO L129 PetriNetUnfolder]: 222/536 cut-off events. [2021-03-26 10:42:27,658 INFO L130 PetriNetUnfolder]: For 6323/6382 co-relation queries the response was YES. [2021-03-26 10:42:27,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 536 events. 222/536 cut-off events. For 6323/6382 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3439 event pairs, 13 based on Foata normal form. 42/560 useless extension candidates. Maximal degree in co-relation 3425. Up to 237 conditions per place. [2021-03-26 10:42:27,667 INFO L142 LiptonReduction]: Number of co-enabled transitions 706 [2021-03-26 10:42:27,727 INFO L154 LiptonReduction]: Checked pairs total: 1598 [2021-03-26 10:42:27,727 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:42:27,727 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 162 [2021-03-26 10:42:27,728 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 112 transitions, 1759 flow [2021-03-26 10:42:27,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.0) internal successors, (936), 8 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-03-26 10:42:27,729 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:27,729 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:27,729 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:42:27,729 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:27,729 INFO L82 PathProgramCache]: Analyzing trace with hash -654119609, now seen corresponding path program 1 times [2021-03-26 10:42:27,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:27,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95935655] [2021-03-26 10:42:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:27,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:27,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:27,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:27,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95935655] [2021-03-26 10:42:27,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:27,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:42:27,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872969066] [2021-03-26 10:42:27,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:42:27,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:27,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:42:27,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:42:27,777 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 176 [2021-03-26 10:42:27,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 112 transitions, 1759 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:27,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 176 [2021-03-26 10:42:27,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:27,964 INFO L129 PetriNetUnfolder]: 264/654 cut-off events. [2021-03-26 10:42:27,965 INFO L130 PetriNetUnfolder]: For 8610/8723 co-relation queries the response was YES. [2021-03-26 10:42:27,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4338 conditions, 654 events. 264/654 cut-off events. For 8610/8723 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4559 event pairs, 58 based on Foata normal form. 71/696 useless extension candidates. Maximal degree in co-relation 4299. Up to 302 conditions per place. [2021-03-26 10:42:27,971 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 3 selfloop transitions, 3 changer transitions 14/112 dead transitions. [2021-03-26 10:42:27,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 112 transitions, 1771 flow [2021-03-26 10:42:27,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:42:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:42:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-03-26 10:42:27,974 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8693181818181818 [2021-03-26 10:42:27,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-03-26 10:42:27,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-03-26 10:42:27,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:27,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-03-26 10:42:27,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:27,977 INFO L185 Difference]: Start difference. First operand has 90 places, 112 transitions, 1759 flow. Second operand 3 states and 459 transitions. [2021-03-26 10:42:27,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 112 transitions, 1771 flow [2021-03-26 10:42:27,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 112 transitions, 1743 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-26 10:42:28,001 INFO L241 Difference]: Finished difference. Result has 91 places, 98 transitions, 1508 flow [2021-03-26 10:42:28,001 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=91, PETRI_TRANSITIONS=98} [2021-03-26 10:42:28,001 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 44 predicate places. [2021-03-26 10:42:28,001 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:28,001 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 98 transitions, 1508 flow [2021-03-26 10:42:28,002 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 98 transitions, 1508 flow [2021-03-26 10:42:28,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 98 transitions, 1508 flow [2021-03-26 10:42:28,126 INFO L129 PetriNetUnfolder]: 225/573 cut-off events. [2021-03-26 10:42:28,126 INFO L130 PetriNetUnfolder]: For 6662/6757 co-relation queries the response was YES. [2021-03-26 10:42:28,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3700 conditions, 573 events. 225/573 cut-off events. For 6662/6757 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3926 event pairs, 3 based on Foata normal form. 71/619 useless extension candidates. Maximal degree in co-relation 3662. Up to 258 conditions per place. [2021-03-26 10:42:28,136 INFO L142 LiptonReduction]: Number of co-enabled transitions 566 [2021-03-26 10:42:29,119 WARN L205 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 10:42:29,369 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:42:30,751 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2021-03-26 10:42:31,340 WARN L205 SmtUtils]: Spent 585.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:42:31,463 INFO L154 LiptonReduction]: Checked pairs total: 1767 [2021-03-26 10:42:31,463 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:42:31,463 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3462 [2021-03-26 10:42:31,463 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 98 transitions, 1530 flow [2021-03-26 10:42:31,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:31,464 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:31,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:42:31,464 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:31,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 435133709, now seen corresponding path program 1 times [2021-03-26 10:42:31,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:31,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222490451] [2021-03-26 10:42:31,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:31,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:31,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:31,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:31,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:31,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:31,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:42:31,605 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-03-26 10:42:31,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:42:31,621 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-03-26 10:42:31,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:42:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:31,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222490451] [2021-03-26 10:42:31,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:31,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:42:31,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733262527] [2021-03-26 10:42:31,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:42:31,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:42:31,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:42:31,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 177 [2021-03-26 10:42:31,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 98 transitions, 1530 flow. Second operand has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:31,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:31,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 177 [2021-03-26 10:42:31,639 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:32,047 INFO L129 PetriNetUnfolder]: 176/544 cut-off events. [2021-03-26 10:42:32,048 INFO L130 PetriNetUnfolder]: For 6898/7005 co-relation queries the response was YES. [2021-03-26 10:42:32,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4014 conditions, 544 events. 176/544 cut-off events. For 6898/7005 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3916 event pairs, 0 based on Foata normal form. 63/577 useless extension candidates. Maximal degree in co-relation 3974. Up to 272 conditions per place. [2021-03-26 10:42:32,053 INFO L132 encePairwiseOnDemand]: 167/177 looper letters, 58 selfloop transitions, 42 changer transitions 14/127 dead transitions. [2021-03-26 10:42:32,053 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 127 transitions, 2199 flow [2021-03-26 10:42:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 10:42:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 10:42:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1253 transitions. [2021-03-26 10:42:32,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.707909604519774 [2021-03-26 10:42:32,057 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1253 transitions. [2021-03-26 10:42:32,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1253 transitions. [2021-03-26 10:42:32,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:32,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1253 transitions. [2021-03-26 10:42:32,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 125.3) internal successors, (1253), 10 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:32,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:32,076 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:32,076 INFO L185 Difference]: Start difference. First operand has 89 places, 98 transitions, 1530 flow. Second operand 10 states and 1253 transitions. [2021-03-26 10:42:32,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 127 transitions, 2199 flow [2021-03-26 10:42:32,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 127 transitions, 2044 flow, removed 49 selfloop flow, removed 4 redundant places. [2021-03-26 10:42:32,097 INFO L241 Difference]: Finished difference. Result has 97 places, 108 transitions, 1722 flow [2021-03-26 10:42:32,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1722, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2021-03-26 10:42:32,097 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 50 predicate places. [2021-03-26 10:42:32,097 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:32,098 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 108 transitions, 1722 flow [2021-03-26 10:42:32,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 108 transitions, 1722 flow [2021-03-26 10:42:32,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 108 transitions, 1722 flow [2021-03-26 10:42:32,181 INFO L129 PetriNetUnfolder]: 152/462 cut-off events. [2021-03-26 10:42:32,181 INFO L130 PetriNetUnfolder]: For 6352/6463 co-relation queries the response was YES. [2021-03-26 10:42:32,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3179 conditions, 462 events. 152/462 cut-off events. For 6352/6463 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3128 event pairs, 1 based on Foata normal form. 76/516 useless extension candidates. Maximal degree in co-relation 3138. Up to 224 conditions per place. [2021-03-26 10:42:32,188 INFO L142 LiptonReduction]: Number of co-enabled transitions 556 [2021-03-26 10:42:33,497 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-03-26 10:42:34,316 WARN L205 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-03-26 10:42:36,906 WARN L205 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 377 DAG size of output: 316 [2021-03-26 10:42:37,998 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 307 [2021-03-26 10:42:38,219 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:42:38,749 WARN L205 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2021-03-26 10:42:38,936 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 10:42:39,001 INFO L154 LiptonReduction]: Checked pairs total: 2288 [2021-03-26 10:42:39,002 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:42:39,002 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6905 [2021-03-26 10:42:39,002 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 1737 flow [2021-03-26 10:42:39,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:39,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:39,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:42:39,003 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:39,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:39,003 INFO L82 PathProgramCache]: Analyzing trace with hash -755495946, now seen corresponding path program 1 times [2021-03-26 10:42:39,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:39,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146706962] [2021-03-26 10:42:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:39,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:39,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:39,067 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:39,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:39,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:39,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:39,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:39,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146706962] [2021-03-26 10:42:39,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:39,078 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:42:39,078 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59972433] [2021-03-26 10:42:39,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:42:39,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:39,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:42:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:42:39,079 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 179 [2021-03-26 10:42:39,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 1737 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:39,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 179 [2021-03-26 10:42:39,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:39,244 INFO L129 PetriNetUnfolder]: 255/653 cut-off events. [2021-03-26 10:42:39,244 INFO L130 PetriNetUnfolder]: For 6698/6881 co-relation queries the response was YES. [2021-03-26 10:42:39,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 653 events. 255/653 cut-off events. For 6698/6881 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 4716 event pairs, 69 based on Foata normal form. 92/699 useless extension candidates. Maximal degree in co-relation 2652. Up to 347 conditions per place. [2021-03-26 10:42:39,250 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 10 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2021-03-26 10:42:39,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 89 transitions, 1253 flow [2021-03-26 10:42:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:42:39,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:42:39,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 766 transitions. [2021-03-26 10:42:39,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8558659217877095 [2021-03-26 10:42:39,253 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 766 transitions. [2021-03-26 10:42:39,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 766 transitions. [2021-03-26 10:42:39,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:39,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 766 transitions. [2021-03-26 10:42:39,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.2) internal successors, (766), 5 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,257 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:39,257 INFO L185 Difference]: Start difference. First operand has 97 places, 108 transitions, 1737 flow. Second operand 5 states and 766 transitions. [2021-03-26 10:42:39,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 89 transitions, 1253 flow [2021-03-26 10:42:39,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 89 transitions, 1161 flow, removed 13 selfloop flow, removed 10 redundant places. [2021-03-26 10:42:39,270 INFO L241 Difference]: Finished difference. Result has 93 places, 85 transitions, 1152 flow [2021-03-26 10:42:39,270 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=1105, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1152, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2021-03-26 10:42:39,270 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2021-03-26 10:42:39,271 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:39,271 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 85 transitions, 1152 flow [2021-03-26 10:42:39,271 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 85 transitions, 1152 flow [2021-03-26 10:42:39,272 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 1152 flow [2021-03-26 10:42:39,344 INFO L129 PetriNetUnfolder]: 251/642 cut-off events. [2021-03-26 10:42:39,344 INFO L130 PetriNetUnfolder]: For 4904/5112 co-relation queries the response was YES. [2021-03-26 10:42:39,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 642 events. 251/642 cut-off events. For 4904/5112 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 4646 event pairs, 71 based on Foata normal form. 51/638 useless extension candidates. Maximal degree in co-relation 2912. Up to 399 conditions per place. [2021-03-26 10:42:39,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 600 [2021-03-26 10:42:40,388 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 264 DAG size of output: 167 [2021-03-26 10:42:40,658 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:42:42,853 WARN L205 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 391 DAG size of output: 261 [2021-03-26 10:42:43,543 WARN L205 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 10:42:44,569 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-26 10:42:44,877 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:42:47,138 WARN L205 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 377 DAG size of output: 236 [2021-03-26 10:42:47,870 WARN L205 SmtUtils]: Spent 730.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2021-03-26 10:42:48,945 WARN L205 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-26 10:42:49,223 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-26 10:42:51,611 WARN L205 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 377 DAG size of output: 236 [2021-03-26 10:42:52,436 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 218 [2021-03-26 10:42:52,896 WARN L205 SmtUtils]: Spent 453.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 10:42:53,319 WARN L205 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 10:42:54,341 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:42:55,328 WARN L205 SmtUtils]: Spent 985.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 10:42:55,664 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-03-26 10:42:55,974 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 10:42:56,740 WARN L205 SmtUtils]: Spent 762.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2021-03-26 10:42:57,515 WARN L205 SmtUtils]: Spent 773.00 ms on a formula simplification that was a NOOP. DAG size: 224 [2021-03-26 10:42:57,522 INFO L154 LiptonReduction]: Checked pairs total: 21 [2021-03-26 10:42:57,522 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:42:57,522 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18251 [2021-03-26 10:42:57,522 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 1173 flow [2021-03-26 10:42:57,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:57,523 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:57,523 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:57,523 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:42:57,523 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1618600213, now seen corresponding path program 1 times [2021-03-26 10:42:57,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:57,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085283889] [2021-03-26 10:42:57,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:57,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:57,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:57,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:57,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:57,600 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:57,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:57,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:57,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:42:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:57,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085283889] [2021-03-26 10:42:57,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:57,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:57,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11340401] [2021-03-26 10:42:57,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:42:57,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:57,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:42:57,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:42:57,623 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 184 [2021-03-26 10:42:57,624 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 1173 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:57,624 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:57,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 184 [2021-03-26 10:42:57,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:57,815 INFO L129 PetriNetUnfolder]: 204/590 cut-off events. [2021-03-26 10:42:57,815 INFO L130 PetriNetUnfolder]: For 6313/7291 co-relation queries the response was YES. [2021-03-26 10:42:57,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 590 events. 204/590 cut-off events. For 6313/7291 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 4451 event pairs, 7 based on Foata normal form. 333/883 useless extension candidates. Maximal degree in co-relation 2939. Up to 383 conditions per place. [2021-03-26 10:42:57,821 INFO L132 encePairwiseOnDemand]: 177/184 looper letters, 5 selfloop transitions, 15 changer transitions 3/88 dead transitions. [2021-03-26 10:42:57,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 88 transitions, 1169 flow [2021-03-26 10:42:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:57,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1104 transitions. [2021-03-26 10:42:57,826 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-03-26 10:42:57,826 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1104 transitions. [2021-03-26 10:42:57,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1104 transitions. [2021-03-26 10:42:57,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:57,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1104 transitions. [2021-03-26 10:42:57,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.71428571428572) internal successors, (1104), 7 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:57,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:57,833 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:57,833 INFO L185 Difference]: Start difference. First operand has 93 places, 85 transitions, 1173 flow. Second operand 7 states and 1104 transitions. [2021-03-26 10:42:57,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 88 transitions, 1169 flow [2021-03-26 10:42:57,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 1119 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-03-26 10:42:57,847 INFO L241 Difference]: Finished difference. Result has 93 places, 85 transitions, 1114 flow [2021-03-26 10:42:57,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=1015, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1114, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2021-03-26 10:42:57,849 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2021-03-26 10:42:57,849 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:57,849 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 85 transitions, 1114 flow [2021-03-26 10:42:57,849 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 85 transitions, 1114 flow [2021-03-26 10:42:57,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 85 transitions, 1114 flow [2021-03-26 10:42:57,916 INFO L129 PetriNetUnfolder]: 180/548 cut-off events. [2021-03-26 10:42:57,916 INFO L130 PetriNetUnfolder]: For 4164/4477 co-relation queries the response was YES. [2021-03-26 10:42:57,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 548 events. 180/548 cut-off events. For 4164/4477 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 4204 event pairs, 7 based on Foata normal form. 24/546 useless extension candidates. Maximal degree in co-relation 2904. Up to 343 conditions per place. [2021-03-26 10:42:57,926 INFO L142 LiptonReduction]: Number of co-enabled transitions 644 [2021-03-26 10:42:57,936 INFO L154 LiptonReduction]: Checked pairs total: 89 [2021-03-26 10:42:57,936 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:42:57,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-03-26 10:42:57,937 INFO L480 AbstractCegarLoop]: Abstraction has has 93 places, 83 transitions, 1098 flow [2021-03-26 10:42:57,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:57,937 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:42:57,938 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:42:57,938 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:42:57,938 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:42:57,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:42:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash -912063063, now seen corresponding path program 1 times [2021-03-26 10:42:57,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:42:57,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301711755] [2021-03-26 10:42:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:42:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:42:57,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:57,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:57,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:57,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:57,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:42:57,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:42:58,010 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:42:58,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:42:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:42:58,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301711755] [2021-03-26 10:42:58,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:42:58,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:42:58,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706153688] [2021-03-26 10:42:58,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:42:58,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:42:58,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:42:58,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:42:58,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 184 [2021-03-26 10:42:58,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 83 transitions, 1098 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:58,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:42:58,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 184 [2021-03-26 10:42:58,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:42:58,175 INFO L129 PetriNetUnfolder]: 109/328 cut-off events. [2021-03-26 10:42:58,175 INFO L130 PetriNetUnfolder]: For 3252/3420 co-relation queries the response was YES. [2021-03-26 10:42:58,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 328 events. 109/328 cut-off events. For 3252/3420 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1948 event pairs, 0 based on Foata normal form. 86/399 useless extension candidates. Maximal degree in co-relation 1983. Up to 177 conditions per place. [2021-03-26 10:42:58,178 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 2 selfloop transitions, 11 changer transitions 8/81 dead transitions. [2021-03-26 10:42:58,178 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 81 transitions, 1103 flow [2021-03-26 10:42:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:42:58,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:42:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1096 transitions. [2021-03-26 10:42:58,183 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8509316770186336 [2021-03-26 10:42:58,183 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1096 transitions. [2021-03-26 10:42:58,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1096 transitions. [2021-03-26 10:42:58,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:42:58,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1096 transitions. [2021-03-26 10:42:58,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:58,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:58,187 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:42:58,187 INFO L185 Difference]: Start difference. First operand has 93 places, 83 transitions, 1098 flow. Second operand 7 states and 1096 transitions. [2021-03-26 10:42:58,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 81 transitions, 1103 flow [2021-03-26 10:42:58,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 1068 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-03-26 10:42:58,199 INFO L241 Difference]: Finished difference. Result has 92 places, 73 transitions, 986 flow [2021-03-26 10:42:58,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=986, PETRI_PLACES=92, PETRI_TRANSITIONS=73} [2021-03-26 10:42:58,199 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2021-03-26 10:42:58,199 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:42:58,200 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 73 transitions, 986 flow [2021-03-26 10:42:58,200 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 73 transitions, 986 flow [2021-03-26 10:42:58,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 73 transitions, 986 flow [2021-03-26 10:42:58,242 INFO L129 PetriNetUnfolder]: 91/296 cut-off events. [2021-03-26 10:42:58,242 INFO L130 PetriNetUnfolder]: For 2167/2225 co-relation queries the response was YES. [2021-03-26 10:42:58,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1777 conditions, 296 events. 91/296 cut-off events. For 2167/2225 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1797 event pairs, 0 based on Foata normal form. 13/300 useless extension candidates. Maximal degree in co-relation 1738. Up to 97 conditions per place. [2021-03-26 10:42:58,246 INFO L142 LiptonReduction]: Number of co-enabled transitions 314 [2021-03-26 10:42:58,760 WARN L205 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:42:59,207 WARN L205 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:43:00,077 WARN L205 SmtUtils]: Spent 866.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:43:01,044 WARN L205 SmtUtils]: Spent 965.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:43:01,049 INFO L154 LiptonReduction]: Checked pairs total: 11 [2021-03-26 10:43:01,050 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:43:01,050 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2851 [2021-03-26 10:43:01,050 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 71 transitions, 974 flow [2021-03-26 10:43:01,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:01,051 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:01,051 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:43:01,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 10:43:01,051 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:01,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:01,051 INFO L82 PathProgramCache]: Analyzing trace with hash 339464423, now seen corresponding path program 1 times [2021-03-26 10:43:01,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:01,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348668928] [2021-03-26 10:43:01,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:01,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:01,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:43:01,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:01,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:43:01,149 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.9 percent of original size [2021-03-26 10:43:01,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 10:43:01,206 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-03-26 10:43:01,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:43:01,233 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-03-26 10:43:01,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:43:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:43:01,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348668928] [2021-03-26 10:43:01,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:01,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:43:01,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612461590] [2021-03-26 10:43:01,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:43:01,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:43:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:43:01,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 185 [2021-03-26 10:43:01,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 71 transitions, 974 flow. Second operand has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:01,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:01,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 185 [2021-03-26 10:43:01,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:01,706 INFO L129 PetriNetUnfolder]: 117/350 cut-off events. [2021-03-26 10:43:01,706 INFO L130 PetriNetUnfolder]: For 3359/3458 co-relation queries the response was YES. [2021-03-26 10:43:01,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2196 conditions, 350 events. 117/350 cut-off events. For 3359/3458 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2253 event pairs, 0 based on Foata normal form. 37/370 useless extension candidates. Maximal degree in co-relation 2155. Up to 127 conditions per place. [2021-03-26 10:43:01,710 INFO L132 encePairwiseOnDemand]: 177/185 looper letters, 36 selfloop transitions, 11 changer transitions 19/84 dead transitions. [2021-03-26 10:43:01,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 84 transitions, 1307 flow [2021-03-26 10:43:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:43:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:43:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 968 transitions. [2021-03-26 10:43:01,714 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.654054054054054 [2021-03-26 10:43:01,714 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 968 transitions. [2021-03-26 10:43:01,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 968 transitions. [2021-03-26 10:43:01,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:01,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 968 transitions. [2021-03-26 10:43:01,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:01,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:01,718 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:01,718 INFO L185 Difference]: Start difference. First operand has 88 places, 71 transitions, 974 flow. Second operand 8 states and 968 transitions. [2021-03-26 10:43:01,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 84 transitions, 1307 flow [2021-03-26 10:43:01,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 84 transitions, 1262 flow, removed 12 selfloop flow, removed 8 redundant places. [2021-03-26 10:43:01,751 INFO L241 Difference]: Finished difference. Result has 89 places, 65 transitions, 887 flow [2021-03-26 10:43:01,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=887, PETRI_PLACES=89, PETRI_TRANSITIONS=65} [2021-03-26 10:43:01,751 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2021-03-26 10:43:01,751 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:01,752 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 65 transitions, 887 flow [2021-03-26 10:43:01,754 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 65 transitions, 887 flow [2021-03-26 10:43:01,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 65 transitions, 887 flow [2021-03-26 10:43:01,790 INFO L129 PetriNetUnfolder]: 77/240 cut-off events. [2021-03-26 10:43:01,790 INFO L130 PetriNetUnfolder]: For 1711/1739 co-relation queries the response was YES. [2021-03-26 10:43:01,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 240 events. 77/240 cut-off events. For 1711/1739 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1367 event pairs, 0 based on Foata normal form. 15/249 useless extension candidates. Maximal degree in co-relation 1288. Up to 78 conditions per place. [2021-03-26 10:43:01,794 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 10:43:01,797 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:43:01,797 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:43:01,797 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 46 [2021-03-26 10:43:01,799 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 887 flow [2021-03-26 10:43:01,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:01,799 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:01,799 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:43:01,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 10:43:01,799 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:01,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1634904136, now seen corresponding path program 1 times [2021-03-26 10:43:01,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:01,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8689649] [2021-03-26 10:43:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:01,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:01,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:43:01,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:01,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:43:01,905 INFO L142 QuantifierPusher]: treesize reduction 5, result has 86.1 percent of original size [2021-03-26 10:43:01,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 10:43:01,947 INFO L142 QuantifierPusher]: treesize reduction 27, result has 78.9 percent of original size [2021-03-26 10:43:01,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 101 [2021-03-26 10:43:02,133 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2021-03-26 10:43:02,136 INFO L142 QuantifierPusher]: treesize reduction 13, result has 73.5 percent of original size [2021-03-26 10:43:02,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 10:43:02,186 INFO L142 QuantifierPusher]: treesize reduction 13, result has 71.7 percent of original size [2021-03-26 10:43:02,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 10:43:02,242 INFO L142 QuantifierPusher]: treesize reduction 5, result has 92.4 percent of original size [2021-03-26 10:43:02,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-03-26 10:43:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:43:02,315 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8689649] [2021-03-26 10:43:02,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:02,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:43:02,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576002717] [2021-03-26 10:43:02,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:43:02,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:43:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:43:02,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 185 [2021-03-26 10:43:02,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 65 transitions, 887 flow. Second operand has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:02,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:02,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 185 [2021-03-26 10:43:02,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:03,186 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2021-03-26 10:43:03,265 INFO L129 PetriNetUnfolder]: 87/274 cut-off events. [2021-03-26 10:43:03,265 INFO L130 PetriNetUnfolder]: For 2264/2315 co-relation queries the response was YES. [2021-03-26 10:43:03,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1542 conditions, 274 events. 87/274 cut-off events. For 2264/2315 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1645 event pairs, 0 based on Foata normal form. 37/299 useless extension candidates. Maximal degree in co-relation 1503. Up to 82 conditions per place. [2021-03-26 10:43:03,267 INFO L132 encePairwiseOnDemand]: 176/185 looper letters, 8 selfloop transitions, 24 changer transitions 23/71 dead transitions. [2021-03-26 10:43:03,267 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 71 transitions, 1078 flow [2021-03-26 10:43:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 10:43:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 10:43:03,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1305 transitions. [2021-03-26 10:43:03,272 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6412776412776413 [2021-03-26 10:43:03,272 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1305 transitions. [2021-03-26 10:43:03,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1305 transitions. [2021-03-26 10:43:03,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:03,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1305 transitions. [2021-03-26 10:43:03,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.63636363636364) internal successors, (1305), 11 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:03,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 185.0) internal successors, (2220), 12 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:03,277 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 185.0) internal successors, (2220), 12 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:03,277 INFO L185 Difference]: Start difference. First operand has 84 places, 65 transitions, 887 flow. Second operand 11 states and 1305 transitions. [2021-03-26 10:43:03,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 71 transitions, 1078 flow [2021-03-26 10:43:03,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 71 transitions, 1034 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-03-26 10:43:03,287 INFO L241 Difference]: Finished difference. Result has 88 places, 48 transitions, 637 flow [2021-03-26 10:43:03,287 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=637, PETRI_PLACES=88, PETRI_TRANSITIONS=48} [2021-03-26 10:43:03,288 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2021-03-26 10:43:03,288 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:03,288 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 48 transitions, 637 flow [2021-03-26 10:43:03,288 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 48 transitions, 637 flow [2021-03-26 10:43:03,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 48 transitions, 637 flow [2021-03-26 10:43:03,302 INFO L129 PetriNetUnfolder]: 20/83 cut-off events. [2021-03-26 10:43:03,302 INFO L130 PetriNetUnfolder]: For 610/614 co-relation queries the response was YES. [2021-03-26 10:43:03,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 83 events. 20/83 cut-off events. For 610/614 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 281 event pairs, 0 based on Foata normal form. 4/86 useless extension candidates. Maximal degree in co-relation 438. Up to 25 conditions per place. [2021-03-26 10:43:03,303 INFO L142 LiptonReduction]: Number of co-enabled transitions 100 [2021-03-26 10:43:04,611 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:43:05,195 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:43:07,790 WARN L205 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:43:09,030 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:43:10,552 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:43:11,194 WARN L205 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:43:14,148 WARN L205 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:43:15,466 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:43:17,195 WARN L205 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:43:17,967 WARN L205 SmtUtils]: Spent 770.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:43:21,330 WARN L205 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:43:22,765 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:43:24,667 WARN L205 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:43:25,465 WARN L205 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:43:28,995 WARN L205 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-26 10:43:30,602 WARN L205 SmtUtils]: Spent 1.60 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-26 10:43:31,345 INFO L154 LiptonReduction]: Checked pairs total: 49 [2021-03-26 10:43:31,346 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 10:43:31,346 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28058 [2021-03-26 10:43:31,346 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 47 transitions, 651 flow [2021-03-26 10:43:31,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.125) internal successors, (937), 8 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:31,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:31,347 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:43:31,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 10:43:31,347 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:31,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:31,347 INFO L82 PathProgramCache]: Analyzing trace with hash 84281098, now seen corresponding path program 2 times [2021-03-26 10:43:31,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:31,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616253140] [2021-03-26 10:43:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:31,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:31,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:43:31,441 INFO L142 QuantifierPusher]: treesize reduction 37, result has 47.9 percent of original size [2021-03-26 10:43:31,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-26 10:43:31,502 INFO L142 QuantifierPusher]: treesize reduction 37, result has 51.9 percent of original size [2021-03-26 10:43:31,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 10:43:31,584 INFO L142 QuantifierPusher]: treesize reduction 8, result has 68.0 percent of original size [2021-03-26 10:43:31,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:43:31,627 INFO L142 QuantifierPusher]: treesize reduction 8, result has 57.9 percent of original size [2021-03-26 10:43:31,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:43:31,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:31,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 10:43:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:43:31,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616253140] [2021-03-26 10:43:31,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:31,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:43:31,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466143723] [2021-03-26 10:43:31,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:43:31,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:31,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:43:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:43:31,697 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 192 [2021-03-26 10:43:31,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 47 transitions, 651 flow. Second operand has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:31,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:31,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 192 [2021-03-26 10:43:31,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:32,471 INFO L129 PetriNetUnfolder]: 23/88 cut-off events. [2021-03-26 10:43:32,471 INFO L130 PetriNetUnfolder]: For 739/746 co-relation queries the response was YES. [2021-03-26 10:43:32,472 INFO L84 FinitePrefix]: Finished finitePrefix Result has 532 conditions, 88 events. 23/88 cut-off events. For 739/746 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 312 event pairs, 0 based on Foata normal form. 4/90 useless extension candidates. Maximal degree in co-relation 495. Up to 25 conditions per place. [2021-03-26 10:43:32,472 INFO L132 encePairwiseOnDemand]: 179/192 looper letters, 10 selfloop transitions, 12 changer transitions 10/47 dead transitions. [2021-03-26 10:43:32,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 47 transitions, 715 flow [2021-03-26 10:43:32,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:43:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:43:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 996 transitions. [2021-03-26 10:43:32,477 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2021-03-26 10:43:32,477 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 996 transitions. [2021-03-26 10:43:32,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 996 transitions. [2021-03-26 10:43:32,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:32,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 996 transitions. [2021-03-26 10:43:32,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 124.5) internal successors, (996), 8 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:32,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:32,481 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:32,481 INFO L185 Difference]: Start difference. First operand has 86 places, 47 transitions, 651 flow. Second operand 8 states and 996 transitions. [2021-03-26 10:43:32,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 47 transitions, 715 flow [2021-03-26 10:43:32,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 47 transitions, 569 flow, removed 26 selfloop flow, removed 14 redundant places. [2021-03-26 10:43:32,487 INFO L241 Difference]: Finished difference. Result has 80 places, 37 transitions, 422 flow [2021-03-26 10:43:32,487 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=422, PETRI_PLACES=80, PETRI_TRANSITIONS=37} [2021-03-26 10:43:32,488 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2021-03-26 10:43:32,488 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:32,488 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 37 transitions, 422 flow [2021-03-26 10:43:32,488 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 37 transitions, 422 flow [2021-03-26 10:43:32,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 37 transitions, 422 flow [2021-03-26 10:43:32,498 INFO L129 PetriNetUnfolder]: 15/60 cut-off events. [2021-03-26 10:43:32,498 INFO L130 PetriNetUnfolder]: For 336/339 co-relation queries the response was YES. [2021-03-26 10:43:32,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 60 events. 15/60 cut-off events. For 336/339 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 166 event pairs, 0 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 288. Up to 16 conditions per place. [2021-03-26 10:43:32,499 INFO L142 LiptonReduction]: Number of co-enabled transitions 54 [2021-03-26 10:43:34,353 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-26 10:43:35,255 WARN L205 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-26 10:43:39,141 WARN L205 SmtUtils]: Spent 3.88 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-26 10:43:40,895 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:43:40,899 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-26 10:43:40,899 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:43:40,899 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8411 [2021-03-26 10:43:40,900 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 36 transitions, 420 flow [2021-03-26 10:43:40,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:40,900 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:40,901 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:43:40,901 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-26 10:43:40,901 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:40,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2072775698, now seen corresponding path program 1 times [2021-03-26 10:43:40,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:40,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131082509] [2021-03-26 10:43:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:40,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:40,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:43:40,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:40,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:43:41,010 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-26 10:43:41,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 10:43:41,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:41,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:43:41,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:41,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:43:41,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:41,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:43:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:43:41,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131082509] [2021-03-26 10:43:41,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:41,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:43:41,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219577873] [2021-03-26 10:43:41,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 10:43:41,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:41,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 10:43:41,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-26 10:43:41,187 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 193 [2021-03-26 10:43:41,187 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 36 transitions, 420 flow. Second operand has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 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-03-26 10:43:41,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:41,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 193 [2021-03-26 10:43:41,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:41,640 INFO L129 PetriNetUnfolder]: 21/78 cut-off events. [2021-03-26 10:43:41,640 INFO L130 PetriNetUnfolder]: For 580/588 co-relation queries the response was YES. [2021-03-26 10:43:41,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 78 events. 21/78 cut-off events. For 580/588 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 260 event pairs, 0 based on Foata normal form. 7/83 useless extension candidates. Maximal degree in co-relation 396. Up to 24 conditions per place. [2021-03-26 10:43:41,641 INFO L132 encePairwiseOnDemand]: 183/193 looper letters, 13 selfloop transitions, 5 changer transitions 9/41 dead transitions. [2021-03-26 10:43:41,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 41 transitions, 552 flow [2021-03-26 10:43:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:43:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:43:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2021-03-26 10:43:41,650 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6269430051813472 [2021-03-26 10:43:41,650 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2021-03-26 10:43:41,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2021-03-26 10:43:41,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:41,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2021-03-26 10:43:41,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:41,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:41,654 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:41,654 INFO L185 Difference]: Start difference. First operand has 73 places, 36 transitions, 420 flow. Second operand 7 states and 847 transitions. [2021-03-26 10:43:41,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 41 transitions, 552 flow [2021-03-26 10:43:41,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 41 transitions, 414 flow, removed 32 selfloop flow, removed 16 redundant places. [2021-03-26 10:43:41,658 INFO L241 Difference]: Finished difference. Result has 65 places, 32 transitions, 285 flow [2021-03-26 10:43:41,658 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=65, PETRI_TRANSITIONS=32} [2021-03-26 10:43:41,658 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2021-03-26 10:43:41,658 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:41,658 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 32 transitions, 285 flow [2021-03-26 10:43:41,659 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 32 transitions, 285 flow [2021-03-26 10:43:41,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 32 transitions, 285 flow [2021-03-26 10:43:41,668 INFO L129 PetriNetUnfolder]: 14/54 cut-off events. [2021-03-26 10:43:41,668 INFO L130 PetriNetUnfolder]: For 174/177 co-relation queries the response was YES. [2021-03-26 10:43:41,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 54 events. 14/54 cut-off events. For 174/177 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 144 event pairs, 0 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 216. Up to 16 conditions per place. [2021-03-26 10:43:41,669 INFO L142 LiptonReduction]: Number of co-enabled transitions 44 [2021-03-26 10:43:42,343 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:43:42,560 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-26 10:43:43,545 WARN L205 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-03-26 10:43:43,903 WARN L205 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:43:43,905 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:43:43,906 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:43:43,906 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2248 [2021-03-26 10:43:43,906 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 288 flow [2021-03-26 10:43:43,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 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-03-26 10:43:43,906 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:43,907 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:43:43,907 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-26 10:43:43,907 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:43,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:43,907 INFO L82 PathProgramCache]: Analyzing trace with hash 285795528, now seen corresponding path program 1 times [2021-03-26 10:43:43,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:43,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085855437] [2021-03-26 10:43:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:43,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:43,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:43:43,973 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-26 10:43:43,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:43:44,012 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:43:44,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:43:44,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:44,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:43:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:43:44,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085855437] [2021-03-26 10:43:44,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:44,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:43:44,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551190289] [2021-03-26 10:43:44,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:43:44,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:43:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:43:44,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 194 [2021-03-26 10:43:44,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 32 transitions, 288 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:44,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:44,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 194 [2021-03-26 10:43:44,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:44,375 INFO L129 PetriNetUnfolder]: 20/72 cut-off events. [2021-03-26 10:43:44,375 INFO L130 PetriNetUnfolder]: For 318/325 co-relation queries the response was YES. [2021-03-26 10:43:44,376 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 72 events. 20/72 cut-off events. For 318/325 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 226 event pairs, 0 based on Foata normal form. 5/74 useless extension candidates. Maximal degree in co-relation 300. Up to 24 conditions per place. [2021-03-26 10:43:44,376 INFO L132 encePairwiseOnDemand]: 188/194 looper letters, 10 selfloop transitions, 4 changer transitions 9/37 dead transitions. [2021-03-26 10:43:44,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 37 transitions, 383 flow [2021-03-26 10:43:44,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:43:44,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:43:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 773 transitions. [2021-03-26 10:43:44,380 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6640893470790378 [2021-03-26 10:43:44,380 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 773 transitions. [2021-03-26 10:43:44,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 773 transitions. [2021-03-26 10:43:44,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:44,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 773 transitions. [2021-03-26 10:43:44,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:44,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:44,382 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:44,382 INFO L185 Difference]: Start difference. First operand has 59 places, 32 transitions, 288 flow. Second operand 6 states and 773 transitions. [2021-03-26 10:43:44,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 37 transitions, 383 flow [2021-03-26 10:43:44,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 37 transitions, 337 flow, removed 7 selfloop flow, removed 10 redundant places. [2021-03-26 10:43:44,385 INFO L241 Difference]: Finished difference. Result has 55 places, 28 transitions, 214 flow [2021-03-26 10:43:44,385 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=55, PETRI_TRANSITIONS=28} [2021-03-26 10:43:44,385 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 8 predicate places. [2021-03-26 10:43:44,385 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:44,385 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 28 transitions, 214 flow [2021-03-26 10:43:44,385 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 28 transitions, 214 flow [2021-03-26 10:43:44,386 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 28 transitions, 214 flow [2021-03-26 10:43:44,392 INFO L129 PetriNetUnfolder]: 9/39 cut-off events. [2021-03-26 10:43:44,392 INFO L130 PetriNetUnfolder]: For 118/120 co-relation queries the response was YES. [2021-03-26 10:43:44,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 39 events. 9/39 cut-off events. For 118/120 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 77 event pairs, 0 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 145. Up to 12 conditions per place. [2021-03-26 10:43:44,393 INFO L142 LiptonReduction]: Number of co-enabled transitions 28 [2021-03-26 10:43:45,016 WARN L205 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-26 10:43:45,199 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-26 10:43:46,287 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-03-26 10:43:46,675 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:43:46,677 INFO L154 LiptonReduction]: Checked pairs total: 1 [2021-03-26 10:43:46,677 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:43:46,677 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2292 [2021-03-26 10:43:46,678 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 210 flow [2021-03-26 10:43:46,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:46,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:43:46,678 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:43:46,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-26 10:43:46,679 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:43:46,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:43:46,679 INFO L82 PathProgramCache]: Analyzing trace with hash -91328554, now seen corresponding path program 1 times [2021-03-26 10:43:46,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:43:46,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339181628] [2021-03-26 10:43:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:43:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:43:46,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:46,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:43:46,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:46,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:43:46,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:46,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:43:46,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:43:46,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:43:46,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:43:46,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339181628] [2021-03-26 10:43:46,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:43:46,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:43:46,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846440360] [2021-03-26 10:43:46,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:43:46,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:43:46,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:43:46,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:43:46,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 195 [2021-03-26 10:43:46,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 210 flow. Second operand has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:46,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:43:46,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 195 [2021-03-26 10:43:46,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:43:47,297 INFO L129 PetriNetUnfolder]: 15/56 cut-off events. [2021-03-26 10:43:47,297 INFO L130 PetriNetUnfolder]: For 233/238 co-relation queries the response was YES. [2021-03-26 10:43:47,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 56 events. 15/56 cut-off events. For 233/238 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 157 event pairs, 0 based on Foata normal form. 5/60 useless extension candidates. Maximal degree in co-relation 218. Up to 20 conditions per place. [2021-03-26 10:43:47,298 INFO L132 encePairwiseOnDemand]: 188/195 looper letters, 4 selfloop transitions, 6 changer transitions 7/31 dead transitions. [2021-03-26 10:43:47,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 31 transitions, 278 flow [2021-03-26 10:43:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:43:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:43:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2021-03-26 10:43:47,302 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2021-03-26 10:43:47,302 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2021-03-26 10:43:47,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2021-03-26 10:43:47,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:43:47,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2021-03-26 10:43:47,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:47,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:47,305 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 195.0) internal successors, (1560), 8 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:43:47,305 INFO L185 Difference]: Start difference. First operand has 50 places, 27 transitions, 210 flow. Second operand 7 states and 884 transitions. [2021-03-26 10:43:47,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 31 transitions, 278 flow [2021-03-26 10:43:47,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 31 transitions, 248 flow, removed 5 selfloop flow, removed 8 redundant places. [2021-03-26 10:43:47,307 INFO L241 Difference]: Finished difference. Result has 48 places, 24 transitions, 165 flow [2021-03-26 10:43:47,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=165, PETRI_PLACES=48, PETRI_TRANSITIONS=24} [2021-03-26 10:43:47,307 INFO L343 CegarLoopForPetriNet]: 47 programPoint places, 1 predicate places. [2021-03-26 10:43:47,307 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:43:47,308 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 24 transitions, 165 flow [2021-03-26 10:43:47,308 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 24 transitions, 165 flow [2021-03-26 10:43:47,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 24 transitions, 165 flow [2021-03-26 10:43:47,313 INFO L129 PetriNetUnfolder]: 8/34 cut-off events. [2021-03-26 10:43:47,313 INFO L130 PetriNetUnfolder]: For 83/85 co-relation queries the response was YES. [2021-03-26 10:43:47,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 34 events. 8/34 cut-off events. For 83/85 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 63 event pairs, 0 based on Foata normal form. 2/36 useless extension candidates. Maximal degree in co-relation 117. Up to 12 conditions per place. [2021-03-26 10:43:47,314 INFO L142 LiptonReduction]: Number of co-enabled transitions 24 [2021-03-26 10:43:48,426 WARN L205 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:43:49,392 WARN L205 SmtUtils]: Spent 964.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:43:51,290 WARN L205 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:43:53,209 WARN L205 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 264 [2021-03-26 10:43:55,154 WARN L205 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 259 DAG size of output: 165 [2021-03-26 10:43:55,907 WARN L205 SmtUtils]: Spent 751.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 10:44:00,157 WARN L205 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 365 DAG size of output: 241 [2021-03-26 10:44:01,590 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 224 [2021-03-26 10:44:03,649 WARN L205 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 219 DAG size of output: 162 [2021-03-26 10:44:04,433 WARN L205 SmtUtils]: Spent 781.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-03-26 10:44:08,857 WARN L205 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 318 DAG size of output: 265 [2021-03-26 10:44:10,722 WARN L205 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 250 [2021-03-26 10:44:10,725 INFO L154 LiptonReduction]: Checked pairs total: 7 [2021-03-26 10:44:10,725 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:44:10,725 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23418 [2021-03-26 10:44:10,726 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 172 flow [2021-03-26 10:44:10,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:44:10,726 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:44:10,726 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:44:10,726 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-26 10:44:10,726 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:44:10,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:44:10,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1132471966, now seen corresponding path program 1 times [2021-03-26 10:44:10,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:44:10,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180593189] [2021-03-26 10:44:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:44:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:44:10,762 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:44:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:44:10,830 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:44:10,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:44:10,865 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:44:10,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-26 10:44:10,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:44:10 BasicIcfg [2021-03-26 10:44:10,989 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:44:10,989 INFO L168 Benchmark]: Toolchain (without parser) took 128351.83 ms. Allocated memory was 373.3 MB in the beginning and 1.2 GB in the end (delta: 801.1 MB). Free memory was 336.0 MB in the beginning and 783.6 MB in the end (delta: -447.6 MB). Peak memory consumption was 354.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:44:10,990 INFO L168 Benchmark]: CDTParser took 0.60 ms. Allocated memory is still 373.3 MB. Free memory was 354.4 MB in the beginning and 354.3 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:44:10,990 INFO L168 Benchmark]: CACSL2BoogieTranslator took 575.69 ms. Allocated memory is still 373.3 MB. Free memory was 335.7 MB in the beginning and 329.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:44:10,990 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.32 ms. Allocated memory is still 373.3 MB. Free memory was 329.1 MB in the beginning and 327.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:44:10,990 INFO L168 Benchmark]: Boogie Preprocessor took 36.48 ms. Allocated memory is still 373.3 MB. Free memory was 327.0 MB in the beginning and 323.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:44:10,992 INFO L168 Benchmark]: RCFGBuilder took 2810.37 ms. Allocated memory was 373.3 MB in the beginning and 490.7 MB in the end (delta: 117.4 MB). Free memory was 323.8 MB in the beginning and 350.8 MB in the end (delta: -26.9 MB). Peak memory consumption was 157.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:44:10,992 INFO L168 Benchmark]: TraceAbstraction took 124875.92 ms. Allocated memory was 490.7 MB in the beginning and 1.2 GB in the end (delta: 683.7 MB). Free memory was 349.7 MB in the beginning and 783.6 MB in the end (delta: -433.8 MB). Peak memory consumption was 250.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:44:10,996 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.60 ms. Allocated memory is still 373.3 MB. Free memory was 354.4 MB in the beginning and 354.3 MB in the end (delta: 70.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 575.69 ms. Allocated memory is still 373.3 MB. Free memory was 335.7 MB in the beginning and 329.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 48.32 ms. Allocated memory is still 373.3 MB. Free memory was 329.1 MB in the beginning and 327.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 36.48 ms. Allocated memory is still 373.3 MB. Free memory was 327.0 MB in the beginning and 323.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2810.37 ms. Allocated memory was 373.3 MB in the beginning and 490.7 MB in the end (delta: 117.4 MB). Free memory was 323.8 MB in the beginning and 350.8 MB in the end (delta: -26.9 MB). Peak memory consumption was 157.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 124875.92 ms. Allocated memory was 490.7 MB in the beginning and 1.2 GB in the end (delta: 683.7 MB). Free memory was 349.7 MB in the beginning and 783.6 MB in the end (delta: -433.8 MB). Peak memory consumption was 250.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6240.1ms, 102 PlacesBefore, 47 PlacesAfterwards, 94 TransitionsBefore, 38 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 6 FixpointIterations, 25 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 3146 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 1353, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1442, positive: 1353, positive conditional: 0, positive unconditional: 1353, negative: 89, negative conditional: 0, negative unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1076, positive: 1039, positive conditional: 0, positive unconditional: 1039, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1076, positive: 1035, positive conditional: 0, positive unconditional: 1035, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 877, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 850, negative conditional: 0, negative unconditional: 850, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1442, positive: 314, positive conditional: 0, positive unconditional: 314, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 1076, unknown conditional: 0, unknown unconditional: 1076] , Statistics on independence cache: Total cache size (in pairs): 1076, Positive cache size: 1039, Positive conditional cache size: 0, Positive unconditional cache size: 1039, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5949.0ms, 44 PlacesBefore, 33 PlacesAfterwards, 35 TransitionsBefore, 24 TransitionsAfterwards, 306 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1174 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 361, positive unconditional: 0, negative: 83, negative conditional: 83, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 444, positive: 361, positive conditional: 20, positive unconditional: 341, negative: 83, negative conditional: 4, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 444, positive: 361, positive conditional: 20, positive unconditional: 341, negative: 83, negative conditional: 4, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, positive: 89, positive conditional: 3, positive unconditional: 86, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 186, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 132, negative conditional: 16, negative unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 444, positive: 272, positive conditional: 17, positive unconditional: 255, negative: 75, negative conditional: 3, negative unconditional: 72, unknown: 97, unknown conditional: 4, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 1173, Positive cache size: 1128, Positive conditional cache size: 3, Positive unconditional cache size: 1125, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1276.2ms, 37 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 753 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 225, positive: 171, positive conditional: 171, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 225, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 225, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 225, positive: 167, positive conditional: 0, positive unconditional: 167, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1132, Positive conditional cache size: 3, Positive unconditional cache size: 1129, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 78, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 78, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1177, Positive cache size: 1132, Positive conditional cache size: 3, Positive unconditional cache size: 1129, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 76 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, positive: 25, positive conditional: 8, positive unconditional: 17, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 25, positive conditional: 8, positive unconditional: 17, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 21, positive conditional: 7, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 5, unknown conditional: 1, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1182, Positive cache size: 1136, Positive conditional cache size: 4, Positive unconditional cache size: 1132, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 67.0ms, 51 PlacesBefore, 48 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 330 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 111 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 81, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 81, positive: 75, positive conditional: 22, positive unconditional: 53, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 75, positive conditional: 22, positive unconditional: 53, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 81, positive: 71, positive conditional: 20, positive unconditional: 51, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1186, Positive cache size: 1140, Positive conditional cache size: 6, Positive unconditional cache size: 1134, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 73.0ms, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 71 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38, positive: 35, positive conditional: 13, positive unconditional: 22, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 35, positive conditional: 13, positive unconditional: 22, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 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: 38, positive: 34, positive conditional: 12, positive unconditional: 22, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1187, Positive cache size: 1141, Positive conditional cache size: 7, Positive unconditional cache size: 1134, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.6ms, 55 PlacesBefore, 55 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 287 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 236, positive: 225, positive conditional: 225, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, positive: 225, positive conditional: 104, positive unconditional: 121, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, positive: 225, positive conditional: 104, positive unconditional: 121, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 236, positive: 225, positive conditional: 104, positive unconditional: 121, 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): 1187, Positive cache size: 1141, Positive conditional cache size: 7, Positive unconditional cache size: 1134, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.7ms, 62 PlacesBefore, 62 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 331 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, positive: 223, positive conditional: 223, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, positive: 223, positive conditional: 107, positive unconditional: 116, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, positive: 223, positive conditional: 107, positive unconditional: 116, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 234, positive: 220, positive conditional: 106, positive unconditional: 114, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1190, Positive cache size: 1144, Positive conditional cache size: 8, Positive unconditional cache size: 1136, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.3ms, 66 PlacesBefore, 66 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 570 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 496, positive: 477, positive conditional: 477, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 496, positive: 477, positive conditional: 235, positive unconditional: 242, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 496, positive: 477, positive conditional: 235, positive unconditional: 242, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 1, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 496, positive: 474, positive conditional: 234, positive unconditional: 240, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1147, Positive conditional cache size: 9, Positive unconditional cache size: 1138, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 69 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.2ms, 72 PlacesBefore, 72 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 604 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 697 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 610, positive: 585, positive conditional: 585, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 610, positive: 585, positive conditional: 314, positive unconditional: 271, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 610, positive: 585, positive conditional: 314, positive unconditional: 271, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 610, positive: 585, positive conditional: 314, positive unconditional: 271, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1147, Positive conditional cache size: 9, Positive unconditional cache size: 1138, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 73 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 132.2ms, 81 PlacesBefore, 81 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1002 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 905, positive: 876, positive conditional: 876, positive unconditional: 0, negative: 29, negative conditional: 29, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 905, positive: 876, positive conditional: 516, positive unconditional: 360, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 905, positive: 876, positive conditional: 516, positive unconditional: 360, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 905, positive: 876, positive conditional: 516, positive unconditional: 360, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1147, Positive conditional cache size: 9, Positive unconditional cache size: 1138, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 116 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 144.1ms, 82 PlacesBefore, 82 PlacesAfterwards, 105 TransitionsBefore, 105 TransitionsAfterwards, 686 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1553 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1426, positive: 1385, positive conditional: 1385, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1426, positive: 1385, positive conditional: 811, positive unconditional: 574, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1426, positive: 1385, positive conditional: 811, positive unconditional: 574, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 1426, positive: 1385, positive conditional: 811, positive unconditional: 574, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1193, Positive cache size: 1147, Positive conditional cache size: 9, Positive unconditional cache size: 1138, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 232 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 161.9ms, 90 PlacesBefore, 90 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1598 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1406, positive: 1370, positive conditional: 1370, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1406, positive: 1370, positive conditional: 833, positive unconditional: 537, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1406, positive: 1370, positive conditional: 833, positive unconditional: 537, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 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: 1406, positive: 1369, positive conditional: 832, positive unconditional: 537, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1194, Positive cache size: 1148, Positive conditional cache size: 10, Positive unconditional cache size: 1138, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 234 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3461.2ms, 91 PlacesBefore, 89 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1767 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1435, positive: 1365, positive conditional: 1365, positive unconditional: 0, negative: 70, negative conditional: 70, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1435, positive: 1365, positive conditional: 624, positive unconditional: 741, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1435, positive: 1365, positive conditional: 624, positive unconditional: 741, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 5, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 133, positive: 133, positive conditional: 133, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1435, positive: 1355, positive conditional: 619, positive unconditional: 736, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 10, unknown conditional: 5, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1204, Positive cache size: 1158, Positive conditional cache size: 15, Positive unconditional cache size: 1143, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 305 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6903.7ms, 97 PlacesBefore, 97 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 2288 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1731, positive: 1638, positive conditional: 1638, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1731, positive: 1638, positive conditional: 758, positive unconditional: 880, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1731, positive: 1638, positive conditional: 758, positive unconditional: 880, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 1731, positive: 1635, positive conditional: 755, positive unconditional: 880, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1207, Positive cache size: 1161, Positive conditional cache size: 18, Positive unconditional cache size: 1143, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 378 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18250.9ms, 93 PlacesBefore, 93 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 21 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 21, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 21, positive conditional: 11, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 11, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 3, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 21, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1166, Positive conditional cache size: 21, Positive unconditional cache size: 1145, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.7ms, 93 PlacesBefore, 93 PlacesAfterwards, 85 TransitionsBefore, 83 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 89 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89, positive: 89, positive conditional: 68, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89, positive: 89, positive conditional: 68, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 16, positive unconditional: 3, 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: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 89, positive: 70, positive conditional: 52, positive unconditional: 18, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 19, unknown conditional: 16, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1231, Positive cache size: 1185, Positive conditional cache size: 37, Positive unconditional cache size: 1148, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2849.7ms, 92 PlacesBefore, 88 PlacesAfterwards, 73 TransitionsBefore, 71 TransitionsAfterwards, 314 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 11 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, positive: 11, positive conditional: 9, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 9, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 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: 11, positive: 10, positive conditional: 8, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1232, Positive cache size: 1186, Positive conditional cache size: 38, Positive unconditional cache size: 1148, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.6ms, 89 PlacesBefore, 84 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 1232, Positive cache size: 1186, Positive conditional cache size: 38, Positive unconditional cache size: 1148, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28057.5ms, 88 PlacesBefore, 86 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 49 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 49, positive conditional: 28, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 49, positive conditional: 28, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 49, positive: 47, positive conditional: 28, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1188, Positive conditional cache size: 38, Positive unconditional cache size: 1150, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8411.1ms, 80 PlacesBefore, 73 PlacesAfterwards, 37 TransitionsBefore, 36 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 3, positive: 3, positive conditional: 2, positive unconditional: 1, 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): 1234, Positive cache size: 1188, Positive conditional cache size: 38, Positive unconditional cache size: 1150, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2247.0ms, 65 PlacesBefore, 59 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 44 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 1234, Positive cache size: 1188, Positive conditional cache size: 38, Positive unconditional cache size: 1150, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2291.8ms, 55 PlacesBefore, 50 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.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: 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] , Statistics on independence cache: Total cache size (in pairs): 1234, Positive cache size: 1188, Positive conditional cache size: 38, Positive unconditional cache size: 1150, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23417.4ms, 48 PlacesBefore, 43 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 24 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 7 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 6, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 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: 7, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1235, Positive cache size: 1189, Positive conditional cache size: 39, Positive unconditional cache size: 1150, Negative cache size: 46, Negative conditional cache size: 1, Negative unconditional cache size: 45, Eliminated conditions: 1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2540; [L850] FCALL, FORK 0 pthread_create(&t2540, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2541; [L852] FCALL, FORK 0 pthread_create(&t2541, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2542; [L854] FCALL, FORK 0 pthread_create(&t2542, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=58, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 124622.6ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 8325.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6309.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 90 SDtfs, 80 SDslu, 49 SDs, 0 SdLazy, 1165 SolverSat, 458 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2501.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 4814.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1759occurred in iteration=13, InterpolantAutomatonStates: 158, 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: 98.5ms SsaConstructionTime, 896.0ms SatisfiabilityAnalysisTime, 4150.4ms InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 356 ConstructedInterpolants, 0 QuantifiedInterpolants, 4142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...