/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:58:23,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:58:23,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:58:23,360 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:58:23,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:58:23,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:58:23,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:58:23,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:58:23,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:58:23,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:58:23,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:58:23,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:58:23,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:58:23,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:58:23,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:58:23,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:58:23,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:58:23,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:58:23,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:58:23,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:58:23,397 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:58:23,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:58:23,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:58:23,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:58:23,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:58:23,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:58:23,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:58:23,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:58:23,404 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:58:23,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:58:23,405 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:58:23,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:58:23,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:58:23,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:58:23,407 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:58:23,407 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:58:23,408 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:58:23,408 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:58:23,409 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:58:23,409 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:58:23,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:58:23,411 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:58:23,430 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:58:23,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:58:23,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:58:23,432 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:58:23,432 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:58:23,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:58:23,432 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:58:23,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:58:23,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:58:23,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:58:23,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:58:23,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:58:23,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:58:23,433 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:58:23,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:58:23,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:58:23,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:58:23,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:58:23,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:58:23,434 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:58:23,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:58:23,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:58:23,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:58:23,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:58:23,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:58:23,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:58:23,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:58:23,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:58:23,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:58:23,435 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 14:58:23,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:58:23,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:58:23,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:58:23,743 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:58:23,743 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:58:23,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2021-03-25 14:58:23,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7c67458/727dd8795c8f4964a7b522a8af6f8532/FLAGa0c38915d [2021-03-25 14:58:24,329 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:58:24,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2021-03-25 14:58:24,347 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7c67458/727dd8795c8f4964a7b522a8af6f8532/FLAGa0c38915d [2021-03-25 14:58:24,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae7c67458/727dd8795c8f4964a7b522a8af6f8532 [2021-03-25 14:58:24,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:58:24,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:58:24,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:58:24,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:58:24,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:58:24,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:58:24" (1/1) ... [2021-03-25 14:58:24,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2956f02e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:24, skipping insertion in model container [2021-03-25 14:58:24,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:58:24" (1/1) ... [2021-03-25 14:58:24,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:58:24,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:58:24,949 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/safe023_rmo.opt.i[992,1005] [2021-03-25 14:58:25,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:58:25,166 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:58:25,186 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/safe023_rmo.opt.i[992,1005] [2021-03-25 14:58:25,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:58:25,314 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:58:25,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25 WrapperNode [2021-03-25 14:58:25,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:58:25,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:58:25,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:58:25,316 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:58:25,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:58:25,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:58:25,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:58:25,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:58:25,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... [2021-03-25 14:58:25,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:58:25,446 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:58:25,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:58:25,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:58:25,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:58:25,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:58:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:58:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:58:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:58:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:58:25,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:58:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:58:25,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:58:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:58:25,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:58:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:58:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:58:25,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:58:25,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:58:25,513 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:58:28,415 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:58:28,416 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:58:28,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:58:28 BoogieIcfgContainer [2021-03-25 14:58:28,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:58:28,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:58:28,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:58:28,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:58:28,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:58:24" (1/3) ... [2021-03-25 14:58:28,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cd8584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:58:28, skipping insertion in model container [2021-03-25 14:58:28,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:58:25" (2/3) ... [2021-03-25 14:58:28,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cd8584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:58:28, skipping insertion in model container [2021-03-25 14:58:28,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:58:28" (3/3) ... [2021-03-25 14:58:28,455 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.opt.i [2021-03-25 14:58:28,463 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:58:28,468 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:58:28,469 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:58:28,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,518 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,563 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,564 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,568 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,569 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,570 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,571 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,572 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,573 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:58:28,576 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:58:28,591 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:58:28,617 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:58:28,617 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:58:28,617 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:58:28,617 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:58:28,617 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:58:28,617 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:58:28,618 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:58:28,618 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:58:28,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-03-25 14:58:28,678 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-25 14:58:28,678 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:58:28,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:58:28,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-03-25 14:58:28,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-03-25 14:58:28,695 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:28,706 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-25 14:58:28,708 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-03-25 14:58:28,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-03-25 14:58:28,738 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-03-25 14:58:28,738 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:58:28,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:58:28,743 INFO L142 LiptonReduction]: Number of co-enabled transitions 1786 [2021-03-25 14:58:29,645 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:58:30,085 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 14:58:30,219 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 14:58:32,298 WARN L205 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 14:58:32,562 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:58:33,947 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:58:34,511 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:58:34,906 INFO L154 LiptonReduction]: Checked pairs total: 3300 [2021-03-25 14:58:34,907 INFO L156 LiptonReduction]: Total number of compositions: 62 [2021-03-25 14:58:34,908 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6214 [2021-03-25 14:58:34,926 INFO L129 PetriNetUnfolder]: 0/15 cut-off events. [2021-03-25 14:58:34,926 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:58:34,926 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:34,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:34,927 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1498083627, now seen corresponding path program 1 times [2021-03-25 14:58:34,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:34,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143633357] [2021-03-25 14:58:34,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:35,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:35,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:58:35,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:35,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:58:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:35,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143633357] [2021-03-25 14:58:35,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:35,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:58:35,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290500522] [2021-03-25 14:58:35,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:58:35,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:35,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:58:35,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:58:35,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 161 [2021-03-25 14:58:35,232 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 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-25 14:58:35,232 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:35,232 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 161 [2021-03-25 14:58:35,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:35,459 INFO L129 PetriNetUnfolder]: 190/443 cut-off events. [2021-03-25 14:58:35,459 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:58:35,462 INFO L84 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 443 events. 190/443 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2572 event pairs, 40 based on Foata normal form. 32/457 useless extension candidates. Maximal degree in co-relation 733. Up to 223 conditions per place. [2021-03-25 14:58:35,467 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 15 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2021-03-25 14:58:35,467 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 131 flow [2021-03-25 14:58:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:58:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:58:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-25 14:58:35,485 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8923395445134575 [2021-03-25 14:58:35,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-25 14:58:35,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-25 14:58:35,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:35,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-25 14:58:35,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:35,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:35,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:35,515 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 431 transitions. [2021-03-25 14:58:35,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 131 flow [2021-03-25 14:58:35,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 128 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:58:35,519 INFO L241 Difference]: Finished difference. Result has 46 places, 37 transitions, 84 flow [2021-03-25 14:58:35,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2021-03-25 14:58:35,524 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-25 14:58:35,524 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:35,525 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 14:58:35,525 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 37 transitions, 84 flow [2021-03-25 14:58:35,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 37 transitions, 84 flow [2021-03-25 14:58:35,532 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 14:58:35,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:58:35,532 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:58:35,533 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-25 14:58:35,919 WARN L205 SmtUtils]: Spent 324.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:58:36,207 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:58:36,875 WARN L205 SmtUtils]: Spent 665.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:58:37,511 WARN L205 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:58:38,132 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:58:38,433 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:58:39,009 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2021-03-25 14:58:39,642 WARN L205 SmtUtils]: Spent 632.00 ms on a formula simplification that was a NOOP. DAG size: 272 [2021-03-25 14:58:40,010 INFO L154 LiptonReduction]: Checked pairs total: 1585 [2021-03-25 14:58:40,010 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 14:58:40,010 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4486 [2021-03-25 14:58:40,011 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 64 flow [2021-03-25 14:58:40,012 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-25 14:58:40,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:40,012 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:40,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:58:40,012 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:40,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash 463185172, now seen corresponding path program 1 times [2021-03-25 14:58:40,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:40,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444082366] [2021-03-25 14:58:40,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:40,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:40,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:58:40,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:40,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:58:40,101 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:58:40,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:58:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:40,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444082366] [2021-03-25 14:58:40,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:40,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:58:40,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35295382] [2021-03-25 14:58:40,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:58:40,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:40,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:58:40,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:58:40,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 172 [2021-03-25 14:58:40,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:40,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:40,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 172 [2021-03-25 14:58:40,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:40,148 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2021-03-25 14:58:40,149 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:58:40,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 1/30 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 36. Up to 3 conditions per place. [2021-03-25 14:58:40,149 INFO L132 encePairwiseOnDemand]: 168/172 looper letters, 1 selfloop transitions, 2 changer transitions 5/29 dead transitions. [2021-03-25 14:58:40,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 80 flow [2021-03-25 14:58:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:58:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:58:40,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2021-03-25 14:58:40,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8627906976744186 [2021-03-25 14:58:40,151 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2021-03-25 14:58:40,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2021-03-25 14:58:40,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:40,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2021-03-25 14:58:40,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:40,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:40,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:40,159 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 64 flow. Second operand 5 states and 742 transitions. [2021-03-25 14:58:40,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 80 flow [2021-03-25 14:58:40,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:58:40,160 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 62 flow [2021-03-25 14:58:40,161 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-03-25 14:58:40,161 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2021-03-25 14:58:40,161 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:40,161 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 62 flow [2021-03-25 14:58:40,162 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 62 flow [2021-03-25 14:58:40,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow [2021-03-25 14:58:40,170 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:58:40,170 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:58:40,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:58:40,170 INFO L142 LiptonReduction]: Number of co-enabled transitions 244 [2021-03-25 14:58:40,900 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 14:58:41,046 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:58:41,345 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-03-25 14:58:41,480 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-25 14:58:41,483 INFO L154 LiptonReduction]: Checked pairs total: 909 [2021-03-25 14:58:41,483 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:58:41,483 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1322 [2021-03-25 14:58:41,484 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2021-03-25 14:58:41,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:41,485 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:41,485 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:58:41,485 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:41,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:41,485 INFO L82 PathProgramCache]: Analyzing trace with hash -147862746, now seen corresponding path program 1 times [2021-03-25 14:58:41,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:41,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424814829] [2021-03-25 14:58:41,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:41,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:41,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:58:41,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:41,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:58:41,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:41,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:58:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:41,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424814829] [2021-03-25 14:58:41,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:41,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:58:41,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389423777] [2021-03-25 14:58:41,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:58:41,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:41,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:58:41,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:58:41,662 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 174 [2021-03-25 14:58:41,663 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,663 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:41,663 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 174 [2021-03-25 14:58:41,663 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:41,684 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-25 14:58:41,684 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2021-03-25 14:58:41,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 0/29 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 3/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-03-25 14:58:41,685 INFO L132 encePairwiseOnDemand]: 170/174 looper letters, 1 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2021-03-25 14:58:41,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 73 flow [2021-03-25 14:58:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:58:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:58:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 595 transitions. [2021-03-25 14:58:41,687 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8548850574712644 [2021-03-25 14:58:41,687 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 595 transitions. [2021-03-25 14:58:41,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 595 transitions. [2021-03-25 14:58:41,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:41,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 595 transitions. [2021-03-25 14:58:41,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,691 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,691 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 4 states and 595 transitions. [2021-03-25 14:58:41,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 73 flow [2021-03-25 14:58:41,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 67 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:58:41,692 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 68 flow [2021-03-25 14:58:41,692 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2021-03-25 14:58:41,692 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -14 predicate places. [2021-03-25 14:58:41,692 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:41,692 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 68 flow [2021-03-25 14:58:41,693 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 68 flow [2021-03-25 14:58:41,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 22 transitions, 68 flow [2021-03-25 14:58:41,697 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:58:41,697 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:58:41,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:58:41,697 INFO L142 LiptonReduction]: Number of co-enabled transitions 224 [2021-03-25 14:58:41,813 INFO L154 LiptonReduction]: Checked pairs total: 495 [2021-03-25 14:58:41,813 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:58:41,813 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 121 [2021-03-25 14:58:41,814 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 66 flow [2021-03-25 14:58:41,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,814 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:41,814 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:41,814 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:58:41,815 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash -349617684, now seen corresponding path program 1 times [2021-03-25 14:58:41,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:41,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997783280] [2021-03-25 14:58:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:41,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:41,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:58:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:41,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997783280] [2021-03-25 14:58:41,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:41,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:58:41,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369973871] [2021-03-25 14:58:41,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:58:41,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:41,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:58:41,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:58:41,937 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 175 [2021-03-25 14:58:41,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:41,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 175 [2021-03-25 14:58:41,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:41,951 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 14:58:41,951 INFO L130 PetriNetUnfolder]: For 15/17 co-relation queries the response was YES. [2021-03-25 14:58:41,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 21 events. 0/21 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:58:41,951 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-25 14:58:41,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 72 flow [2021-03-25 14:58:41,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:58:41,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:58:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-25 14:58:41,954 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8876190476190476 [2021-03-25 14:58:41,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-25 14:58:41,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-25 14:58:41,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:41,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-25 14:58:41,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,957 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 66 flow. Second operand 3 states and 466 transitions. [2021-03-25 14:58:41,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 72 flow [2021-03-25 14:58:41,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 21 transitions, 60 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 14:58:41,958 INFO L241 Difference]: Finished difference. Result has 33 places, 21 transitions, 62 flow [2021-03-25 14:58:41,958 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2021-03-25 14:58:41,958 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-25 14:58:41,958 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:41,958 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 21 transitions, 62 flow [2021-03-25 14:58:41,959 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 21 transitions, 62 flow [2021-03-25 14:58:41,959 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 21 transitions, 62 flow [2021-03-25 14:58:41,963 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 14:58:41,963 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:58:41,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:58:41,963 INFO L142 LiptonReduction]: Number of co-enabled transitions 200 [2021-03-25 14:58:41,965 INFO L154 LiptonReduction]: Checked pairs total: 222 [2021-03-25 14:58:41,965 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:58:41,965 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 14:58:41,969 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 62 flow [2021-03-25 14:58:41,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:41,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:41,970 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:41,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:58:41,970 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:41,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1006049547, now seen corresponding path program 1 times [2021-03-25 14:58:41,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:41,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503117559] [2021-03-25 14:58:41,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:42,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:42,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:58:42,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:42,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:58:42,229 INFO L142 QuantifierPusher]: treesize reduction 24, result has 69.6 percent of original size [2021-03-25 14:58:42,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 14:58:42,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:42,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 14:58:42,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:42,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:58:42,316 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.8 percent of original size [2021-03-25 14:58:42,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 14:58:42,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:42,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503117559] [2021-03-25 14:58:42,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:42,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:58:42,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401974026] [2021-03-25 14:58:42,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:58:42,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:58:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:58:42,364 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 175 [2021-03-25 14:58:42,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 62 flow. Second operand has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:42,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:42,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 175 [2021-03-25 14:58:42,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:42,609 INFO L129 PetriNetUnfolder]: 130/269 cut-off events. [2021-03-25 14:58:42,609 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2021-03-25 14:58:42,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 269 events. 130/269 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1207 event pairs, 42 based on Foata normal form. 2/258 useless extension candidates. Maximal degree in co-relation 555. Up to 199 conditions per place. [2021-03-25 14:58:42,611 INFO L132 encePairwiseOnDemand]: 166/175 looper letters, 14 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2021-03-25 14:58:42,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 141 flow [2021-03-25 14:58:42,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:58:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:58:42,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2021-03-25 14:58:42,614 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6923809523809524 [2021-03-25 14:58:42,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2021-03-25 14:58:42,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2021-03-25 14:58:42,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:42,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2021-03-25 14:58:42,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:42,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:42,618 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:42,618 INFO L185 Difference]: Start difference. First operand has 33 places, 21 transitions, 62 flow. Second operand 6 states and 727 transitions. [2021-03-25 14:58:42,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 141 flow [2021-03-25 14:58:42,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:58:42,620 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 122 flow [2021-03-25 14:58:42,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 14:58:42,621 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -10 predicate places. [2021-03-25 14:58:42,621 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:42,621 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 122 flow [2021-03-25 14:58:42,621 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 122 flow [2021-03-25 14:58:42,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 122 flow [2021-03-25 14:58:42,643 INFO L129 PetriNetUnfolder]: 56/137 cut-off events. [2021-03-25 14:58:42,643 INFO L130 PetriNetUnfolder]: For 33/35 co-relation queries the response was YES. [2021-03-25 14:58:42,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 137 events. 56/137 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 593 event pairs, 28 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 289. Up to 88 conditions per place. [2021-03-25 14:58:42,645 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-25 14:58:43,644 WARN L205 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 14:58:43,909 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 14:58:45,236 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:58:45,887 WARN L205 SmtUtils]: Spent 648.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:58:45,893 INFO L154 LiptonReduction]: Checked pairs total: 163 [2021-03-25 14:58:45,893 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:58:45,893 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3272 [2021-03-25 14:58:45,894 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 124 flow [2021-03-25 14:58:45,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 117.875) internal successors, (943), 8 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:45,895 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:45,895 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:45,895 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:58:45,895 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1689400081, now seen corresponding path program 2 times [2021-03-25 14:58:45,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:45,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785153787] [2021-03-25 14:58:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:45,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:46,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:58:46,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:46,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:58:46,022 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 14:58:46,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:58:46,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:46,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:58:46,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:46,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 14:58:46,087 INFO L142 QuantifierPusher]: treesize reduction 11, result has 68.6 percent of original size [2021-03-25 14:58:46,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 14:58:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:46,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785153787] [2021-03-25 14:58:46,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:46,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:58:46,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287685191] [2021-03-25 14:58:46,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:58:46,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:46,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:58:46,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:58:46,107 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 176 [2021-03-25 14:58:46,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 124 flow. Second operand has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:46,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:46,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 176 [2021-03-25 14:58:46,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:46,333 INFO L129 PetriNetUnfolder]: 149/302 cut-off events. [2021-03-25 14:58:46,333 INFO L130 PetriNetUnfolder]: For 135/188 co-relation queries the response was YES. [2021-03-25 14:58:46,334 INFO L84 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 302 events. 149/302 cut-off events. For 135/188 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1377 event pairs, 37 based on Foata normal form. 6/293 useless extension candidates. Maximal degree in co-relation 859. Up to 219 conditions per place. [2021-03-25 14:58:46,336 INFO L132 encePairwiseOnDemand]: 165/176 looper letters, 21 selfloop transitions, 16 changer transitions 0/47 dead transitions. [2021-03-25 14:58:46,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 276 flow [2021-03-25 14:58:46,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:58:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:58:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2021-03-25 14:58:46,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7329545454545454 [2021-03-25 14:58:46,339 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2021-03-25 14:58:46,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2021-03-25 14:58:46,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:46,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2021-03-25 14:58:46,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:46,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:46,342 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:46,342 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 124 flow. Second operand 5 states and 645 transitions. [2021-03-25 14:58:46,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 276 flow [2021-03-25 14:58:46,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:58:46,346 INFO L241 Difference]: Finished difference. Result has 44 places, 40 transitions, 231 flow [2021-03-25 14:58:46,347 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2021-03-25 14:58:46,347 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2021-03-25 14:58:46,347 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:46,347 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 40 transitions, 231 flow [2021-03-25 14:58:46,348 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 40 transitions, 231 flow [2021-03-25 14:58:46,348 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 231 flow [2021-03-25 14:58:46,389 INFO L129 PetriNetUnfolder]: 95/223 cut-off events. [2021-03-25 14:58:46,389 INFO L130 PetriNetUnfolder]: For 143/181 co-relation queries the response was YES. [2021-03-25 14:58:46,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 223 events. 95/223 cut-off events. For 143/181 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1105 event pairs, 26 based on Foata normal form. 3/209 useless extension candidates. Maximal degree in co-relation 635. Up to 126 conditions per place. [2021-03-25 14:58:46,391 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-25 14:58:47,060 WARN L205 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:58:47,359 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:58:48,796 WARN L205 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-25 14:58:49,390 WARN L205 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:58:49,404 INFO L154 LiptonReduction]: Checked pairs total: 266 [2021-03-25 14:58:49,404 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:58:49,404 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3057 [2021-03-25 14:58:49,405 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 233 flow [2021-03-25 14:58:49,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:49,405 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:49,406 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:49,406 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:58:49,406 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1611736535, now seen corresponding path program 1 times [2021-03-25 14:58:49,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:49,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622800152] [2021-03-25 14:58:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:49,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:49,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:58:49,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:49,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:58:49,564 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 14:58:49,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 14:58:49,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:49,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:58:49,604 INFO L142 QuantifierPusher]: treesize reduction 5, result has 83.3 percent of original size [2021-03-25 14:58:49,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:58:49,640 INFO L142 QuantifierPusher]: treesize reduction 67, result has 40.2 percent of original size [2021-03-25 14:58:49,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 14:58:49,686 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-03-25 14:58:49,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:58:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:49,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622800152] [2021-03-25 14:58:49,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:49,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:58:49,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043845462] [2021-03-25 14:58:49,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:58:49,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:49,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:58:49,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:58:49,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 177 [2021-03-25 14:58:49,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 233 flow. Second operand has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:49,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:49,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 177 [2021-03-25 14:58:49,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:50,061 INFO L129 PetriNetUnfolder]: 209/432 cut-off events. [2021-03-25 14:58:50,061 INFO L130 PetriNetUnfolder]: For 508/629 co-relation queries the response was YES. [2021-03-25 14:58:50,063 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 432 events. 209/432 cut-off events. For 508/629 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2315 event pairs, 26 based on Foata normal form. 27/444 useless extension candidates. Maximal degree in co-relation 1486. Up to 223 conditions per place. [2021-03-25 14:58:50,064 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 21 selfloop transitions, 14 changer transitions 14/59 dead transitions. [2021-03-25 14:58:50,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 431 flow [2021-03-25 14:58:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:58:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:58:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 855 transitions. [2021-03-25 14:58:50,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6900726392251816 [2021-03-25 14:58:50,068 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 855 transitions. [2021-03-25 14:58:50,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 855 transitions. [2021-03-25 14:58:50,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:50,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 855 transitions. [2021-03-25 14:58:50,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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-25 14:58:50,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,072 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,072 INFO L185 Difference]: Start difference. First operand has 44 places, 40 transitions, 233 flow. Second operand 7 states and 855 transitions. [2021-03-25 14:58:50,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 431 flow [2021-03-25 14:58:50,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 417 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 14:58:50,076 INFO L241 Difference]: Finished difference. Result has 51 places, 38 transitions, 243 flow [2021-03-25 14:58:50,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2021-03-25 14:58:50,076 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2021-03-25 14:58:50,076 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:50,077 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 38 transitions, 243 flow [2021-03-25 14:58:50,077 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 243 flow [2021-03-25 14:58:50,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 38 transitions, 243 flow [2021-03-25 14:58:50,158 INFO L129 PetriNetUnfolder]: 91/215 cut-off events. [2021-03-25 14:58:50,159 INFO L130 PetriNetUnfolder]: For 307/368 co-relation queries the response was YES. [2021-03-25 14:58:50,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 215 events. 91/215 cut-off events. For 307/368 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1080 event pairs, 28 based on Foata normal form. 1/192 useless extension candidates. Maximal degree in co-relation 701. Up to 124 conditions per place. [2021-03-25 14:58:50,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-25 14:58:50,191 INFO L154 LiptonReduction]: Checked pairs total: 93 [2021-03-25 14:58:50,191 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:58:50,192 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-03-25 14:58:50,192 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 243 flow [2021-03-25 14:58:50,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,193 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:50,193 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:50,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:58:50,193 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:50,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:50,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1006051469, now seen corresponding path program 2 times [2021-03-25 14:58:50,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:50,194 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185293981] [2021-03-25 14:58:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:50,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:58:50,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:58:50,349 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-25 14:58:50,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 14:58:50,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:58:50,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:58:50,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:58:50,431 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-03-25 14:58:50,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:58:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:50,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185293981] [2021-03-25 14:58:50,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:50,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:58:50,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874838410] [2021-03-25 14:58:50,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:58:50,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:50,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:58:50,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:58:50,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 177 [2021-03-25 14:58:50,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 243 flow. Second operand has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:50,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 177 [2021-03-25 14:58:50,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:50,752 INFO L129 PetriNetUnfolder]: 157/344 cut-off events. [2021-03-25 14:58:50,752 INFO L130 PetriNetUnfolder]: For 833/956 co-relation queries the response was YES. [2021-03-25 14:58:50,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 344 events. 157/344 cut-off events. For 833/956 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1717 event pairs, 23 based on Foata normal form. 22/348 useless extension candidates. Maximal degree in co-relation 1322. Up to 215 conditions per place. [2021-03-25 14:58:50,755 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 18 selfloop transitions, 19 changer transitions 7/54 dead transitions. [2021-03-25 14:58:50,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 440 flow [2021-03-25 14:58:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:58:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:58:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2021-03-25 14:58:50,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.684557438794727 [2021-03-25 14:58:50,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2021-03-25 14:58:50,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2021-03-25 14:58:50,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:50,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2021-03-25 14:58:50,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,763 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,764 INFO L185 Difference]: Start difference. First operand has 49 places, 38 transitions, 243 flow. Second operand 6 states and 727 transitions. [2021-03-25 14:58:50,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 440 flow [2021-03-25 14:58:50,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 376 flow, removed 15 selfloop flow, removed 6 redundant places. [2021-03-25 14:58:50,768 INFO L241 Difference]: Finished difference. Result has 50 places, 44 transitions, 305 flow [2021-03-25 14:58:50,769 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2021-03-25 14:58:50,769 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2021-03-25 14:58:50,769 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:50,769 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 305 flow [2021-03-25 14:58:50,769 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 305 flow [2021-03-25 14:58:50,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 305 flow [2021-03-25 14:58:50,808 INFO L129 PetriNetUnfolder]: 86/232 cut-off events. [2021-03-25 14:58:50,808 INFO L130 PetriNetUnfolder]: For 296/383 co-relation queries the response was YES. [2021-03-25 14:58:50,809 INFO L84 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 232 events. 86/232 cut-off events. For 296/383 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1152 event pairs, 23 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 748. Up to 116 conditions per place. [2021-03-25 14:58:50,810 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 14:58:50,840 INFO L154 LiptonReduction]: Checked pairs total: 151 [2021-03-25 14:58:50,840 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:58:50,840 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-25 14:58:50,842 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 305 flow [2021-03-25 14:58:50,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 116.88888888888889) internal successors, (1052), 9 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:50,843 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:50,843 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:50,843 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:58:50,843 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:50,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:50,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1630669499, now seen corresponding path program 3 times [2021-03-25 14:58:50,844 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:50,844 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84361449] [2021-03-25 14:58:50,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:50,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:58:50,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:58:50,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:50,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:58:50,977 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-03-25 14:58:50,978 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-03-25 14:58:51,010 INFO L142 QuantifierPusher]: treesize reduction 43, result has 62.9 percent of original size [2021-03-25 14:58:51,014 INFO L147 QuantifierPusher]: treesize reduction 9, result has 87.7 percent of original size 64 [2021-03-25 14:58:51,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:51,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:58:51,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:51,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84361449] [2021-03-25 14:58:51,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:51,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:58:51,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755760648] [2021-03-25 14:58:51,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:58:51,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:51,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:58:51,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:58:51,078 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 177 [2021-03-25 14:58:51,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 305 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:51,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 177 [2021-03-25 14:58:51,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:51,298 INFO L129 PetriNetUnfolder]: 154/313 cut-off events. [2021-03-25 14:58:51,298 INFO L130 PetriNetUnfolder]: For 714/917 co-relation queries the response was YES. [2021-03-25 14:58:51,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 313 events. 154/313 cut-off events. For 714/917 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1438 event pairs, 30 based on Foata normal form. 14/315 useless extension candidates. Maximal degree in co-relation 1313. Up to 218 conditions per place. [2021-03-25 14:58:51,301 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 32 selfloop transitions, 13 changer transitions 0/55 dead transitions. [2021-03-25 14:58:51,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 472 flow [2021-03-25 14:58:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:58:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:58:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 638 transitions. [2021-03-25 14:58:51,304 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7209039548022599 [2021-03-25 14:58:51,304 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 638 transitions. [2021-03-25 14:58:51,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 638 transitions. [2021-03-25 14:58:51,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:51,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 638 transitions. [2021-03-25 14:58:51,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,307 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 177.0) internal successors, (1062), 6 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,307 INFO L185 Difference]: Start difference. First operand has 49 places, 44 transitions, 305 flow. Second operand 5 states and 638 transitions. [2021-03-25 14:58:51,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 472 flow [2021-03-25 14:58:51,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 444 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-25 14:58:51,313 INFO L241 Difference]: Finished difference. Result has 50 places, 46 transitions, 332 flow [2021-03-25 14:58:51,313 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2021-03-25 14:58:51,313 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2021-03-25 14:58:51,313 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:51,313 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 46 transitions, 332 flow [2021-03-25 14:58:51,314 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 46 transitions, 332 flow [2021-03-25 14:58:51,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 332 flow [2021-03-25 14:58:51,353 INFO L129 PetriNetUnfolder]: 99/244 cut-off events. [2021-03-25 14:58:51,353 INFO L130 PetriNetUnfolder]: For 433/516 co-relation queries the response was YES. [2021-03-25 14:58:51,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 244 events. 99/244 cut-off events. For 433/516 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1263 event pairs, 25 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 893. Up to 132 conditions per place. [2021-03-25 14:58:51,356 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-25 14:58:51,362 INFO L154 LiptonReduction]: Checked pairs total: 203 [2021-03-25 14:58:51,363 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:58:51,363 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-03-25 14:58:51,363 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 332 flow [2021-03-25 14:58:51,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:51,364 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:51,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:58:51,364 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:51,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:51,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1324681077, now seen corresponding path program 4 times [2021-03-25 14:58:51,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:51,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196437723] [2021-03-25 14:58:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:51,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:51,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:58:51,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:51,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:58:51,463 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 14:58:51,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:58:51,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:51,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:58:51,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:51,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:58:51,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:51,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:58:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:51,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196437723] [2021-03-25 14:58:51,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:51,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:58:51,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62413877] [2021-03-25 14:58:51,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:58:51,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:58:51,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:58:51,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 177 [2021-03-25 14:58:51,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 332 flow. Second operand has 8 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:51,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 177 [2021-03-25 14:58:51,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:51,728 INFO L129 PetriNetUnfolder]: 161/322 cut-off events. [2021-03-25 14:58:51,728 INFO L130 PetriNetUnfolder]: For 951/1185 co-relation queries the response was YES. [2021-03-25 14:58:51,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 322 events. 161/322 cut-off events. For 951/1185 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1451 event pairs, 27 based on Foata normal form. 25/337 useless extension candidates. Maximal degree in co-relation 1465. Up to 229 conditions per place. [2021-03-25 14:58:51,731 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 20 selfloop transitions, 30 changer transitions 0/60 dead transitions. [2021-03-25 14:58:51,731 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 60 transitions, 546 flow [2021-03-25 14:58:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:58:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:58:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 768 transitions. [2021-03-25 14:58:51,734 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7231638418079096 [2021-03-25 14:58:51,734 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 768 transitions. [2021-03-25 14:58:51,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 768 transitions. [2021-03-25 14:58:51,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:51,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 768 transitions. [2021-03-25 14:58:51,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,739 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:51,739 INFO L185 Difference]: Start difference. First operand has 50 places, 46 transitions, 332 flow. Second operand 6 states and 768 transitions. [2021-03-25 14:58:51,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 60 transitions, 546 flow [2021-03-25 14:58:51,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 525 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:58:51,743 INFO L241 Difference]: Finished difference. Result has 54 places, 55 transitions, 497 flow [2021-03-25 14:58:51,743 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2021-03-25 14:58:51,744 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2021-03-25 14:58:51,744 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:51,744 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 55 transitions, 497 flow [2021-03-25 14:58:51,744 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 55 transitions, 497 flow [2021-03-25 14:58:51,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 497 flow [2021-03-25 14:58:51,785 INFO L129 PetriNetUnfolder]: 108/253 cut-off events. [2021-03-25 14:58:51,786 INFO L130 PetriNetUnfolder]: For 785/958 co-relation queries the response was YES. [2021-03-25 14:58:51,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 253 events. 108/253 cut-off events. For 785/958 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1313 event pairs, 35 based on Foata normal form. 4/245 useless extension candidates. Maximal degree in co-relation 1112. Up to 141 conditions per place. [2021-03-25 14:58:51,788 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-25 14:58:52,616 WARN L205 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:58:52,926 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:58:54,323 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-03-25 14:58:54,981 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:58:55,711 WARN L205 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:58:56,387 WARN L205 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-25 14:58:57,957 WARN L205 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:58:58,649 WARN L205 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:58:58,664 INFO L154 LiptonReduction]: Checked pairs total: 606 [2021-03-25 14:58:58,664 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:58:58,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6921 [2021-03-25 14:58:58,665 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 501 flow [2021-03-25 14:58:58,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:58,666 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:58:58,666 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:58:58,666 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:58:58,666 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:58:58,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:58:58,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1266611885, now seen corresponding path program 5 times [2021-03-25 14:58:58,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:58:58,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170734954] [2021-03-25 14:58:58,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:58:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:58:58,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:58,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:58:58,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:58,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:58:58,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:58,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:58:58,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:58:58,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:58:58,773 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-03-25 14:58:58,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:58:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:58:58,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170734954] [2021-03-25 14:58:58,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:58:58,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:58:58,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762711833] [2021-03-25 14:58:58,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:58:58,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:58:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:58:58,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:58:58,793 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 179 [2021-03-25 14:58:58,794 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 501 flow. Second operand has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:58,794 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:58:58,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 179 [2021-03-25 14:58:58,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:58:59,195 INFO L129 PetriNetUnfolder]: 188/379 cut-off events. [2021-03-25 14:58:59,195 INFO L130 PetriNetUnfolder]: For 1751/2073 co-relation queries the response was YES. [2021-03-25 14:58:59,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 379 events. 188/379 cut-off events. For 1751/2073 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1904 event pairs, 51 based on Foata normal form. 44/417 useless extension candidates. Maximal degree in co-relation 1900. Up to 250 conditions per place. [2021-03-25 14:58:59,199 INFO L132 encePairwiseOnDemand]: 167/179 looper letters, 27 selfloop transitions, 40 changer transitions 0/77 dead transitions. [2021-03-25 14:58:59,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 844 flow [2021-03-25 14:58:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:58:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:58:59,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1010 transitions. [2021-03-25 14:58:59,203 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7053072625698324 [2021-03-25 14:58:59,203 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1010 transitions. [2021-03-25 14:58:59,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1010 transitions. [2021-03-25 14:58:59,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:58:59,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1010 transitions. [2021-03-25 14:58:59,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.25) internal successors, (1010), 8 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:59,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:59,208 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 179.0) internal successors, (1611), 9 states have internal predecessors, (1611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:58:59,208 INFO L185 Difference]: Start difference. First operand has 54 places, 55 transitions, 501 flow. Second operand 8 states and 1010 transitions. [2021-03-25 14:58:59,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 844 flow [2021-03-25 14:58:59,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 822 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-25 14:58:59,214 INFO L241 Difference]: Finished difference. Result has 61 places, 71 transitions, 779 flow [2021-03-25 14:58:59,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=779, PETRI_PLACES=61, PETRI_TRANSITIONS=71} [2021-03-25 14:58:59,214 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2021-03-25 14:58:59,214 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:58:59,215 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 71 transitions, 779 flow [2021-03-25 14:58:59,215 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 71 transitions, 779 flow [2021-03-25 14:58:59,215 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 71 transitions, 779 flow [2021-03-25 14:58:59,270 INFO L129 PetriNetUnfolder]: 159/351 cut-off events. [2021-03-25 14:58:59,270 INFO L130 PetriNetUnfolder]: For 1528/1769 co-relation queries the response was YES. [2021-03-25 14:58:59,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 351 events. 159/351 cut-off events. For 1528/1769 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1891 event pairs, 45 based on Foata normal form. 9/343 useless extension candidates. Maximal degree in co-relation 1767. Up to 191 conditions per place. [2021-03-25 14:58:59,274 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-25 14:59:00,265 WARN L205 SmtUtils]: Spent 982.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:59:00,931 WARN L205 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-03-25 14:59:02,604 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:59:03,363 WARN L205 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:59:04,222 WARN L205 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:59:04,616 WARN L205 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:59:06,375 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:59:07,219 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:59:08,112 WARN L205 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:59:08,499 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:59:10,457 WARN L205 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:59:11,351 WARN L205 SmtUtils]: Spent 892.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:59:11,398 INFO L154 LiptonReduction]: Checked pairs total: 1046 [2021-03-25 14:59:11,398 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:59:11,398 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12184 [2021-03-25 14:59:11,398 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 71 transitions, 785 flow [2021-03-25 14:59:11,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:11,399 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:11,399 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:11,399 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:59:11,399 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:11,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1369134232, now seen corresponding path program 1 times [2021-03-25 14:59:11,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:11,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453390971] [2021-03-25 14:59:11,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:11,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:11,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:59:11,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:11,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 14:59:11,535 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.2 percent of original size [2021-03-25 14:59:11,537 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-03-25 14:59:11,596 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.4 percent of original size [2021-03-25 14:59:11,598 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.6 percent of original size 46 [2021-03-25 14:59:11,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:11,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:59:11,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:11,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:59:11,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:11,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:59:11,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:11,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453390971] [2021-03-25 14:59:11,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:11,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:59:11,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273598004] [2021-03-25 14:59:11,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:59:11,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:11,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:59:11,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:59:11,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 182 [2021-03-25 14:59:11,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 71 transitions, 785 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:11,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:11,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 182 [2021-03-25 14:59:11,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:12,232 INFO L129 PetriNetUnfolder]: 214/418 cut-off events. [2021-03-25 14:59:12,232 INFO L130 PetriNetUnfolder]: For 2417/2801 co-relation queries the response was YES. [2021-03-25 14:59:12,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2515 conditions, 418 events. 214/418 cut-off events. For 2417/2801 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2109 event pairs, 37 based on Foata normal form. 60/469 useless extension candidates. Maximal degree in co-relation 2490. Up to 266 conditions per place. [2021-03-25 14:59:12,237 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 37 selfloop transitions, 38 changer transitions 0/85 dead transitions. [2021-03-25 14:59:12,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 1078 flow [2021-03-25 14:59:12,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:59:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:59:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 745 transitions. [2021-03-25 14:59:12,241 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6822344322344323 [2021-03-25 14:59:12,241 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 745 transitions. [2021-03-25 14:59:12,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 745 transitions. [2021-03-25 14:59:12,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:12,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 745 transitions. [2021-03-25 14:59:12,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:12,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:12,245 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:12,245 INFO L185 Difference]: Start difference. First operand has 61 places, 71 transitions, 785 flow. Second operand 6 states and 745 transitions. [2021-03-25 14:59:12,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 1078 flow [2021-03-25 14:59:12,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 85 transitions, 1041 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-03-25 14:59:12,254 INFO L241 Difference]: Finished difference. Result has 63 places, 77 transitions, 933 flow [2021-03-25 14:59:12,254 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2021-03-25 14:59:12,254 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2021-03-25 14:59:12,254 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:12,254 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 77 transitions, 933 flow [2021-03-25 14:59:12,256 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 77 transitions, 933 flow [2021-03-25 14:59:12,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 77 transitions, 933 flow [2021-03-25 14:59:12,325 INFO L129 PetriNetUnfolder]: 188/400 cut-off events. [2021-03-25 14:59:12,325 INFO L130 PetriNetUnfolder]: For 2115/2264 co-relation queries the response was YES. [2021-03-25 14:59:12,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 400 events. 188/400 cut-off events. For 2115/2264 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2182 event pairs, 34 based on Foata normal form. 9/395 useless extension candidates. Maximal degree in co-relation 2195. Up to 222 conditions per place. [2021-03-25 14:59:12,331 INFO L142 LiptonReduction]: Number of co-enabled transitions 456 [2021-03-25 14:59:13,560 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-03-25 14:59:14,016 WARN L205 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:59:16,135 WARN L205 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:59:17,055 WARN L205 SmtUtils]: Spent 918.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:59:17,080 INFO L154 LiptonReduction]: Checked pairs total: 958 [2021-03-25 14:59:17,081 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:59:17,081 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4827 [2021-03-25 14:59:17,081 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 77 transitions, 935 flow [2021-03-25 14:59:17,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:17,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:17,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:17,082 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:59:17,082 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:17,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1742438925, now seen corresponding path program 1 times [2021-03-25 14:59:17,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:17,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404096248] [2021-03-25 14:59:17,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:17,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:17,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:17,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:17,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:17,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:17,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:17,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:17,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:59:17,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:17,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404096248] [2021-03-25 14:59:17,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:17,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:59:17,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065382641] [2021-03-25 14:59:17,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:59:17,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:17,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:59:17,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:59:17,194 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 183 [2021-03-25 14:59:17,195 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 77 transitions, 935 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 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-25 14:59:17,195 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:17,195 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 183 [2021-03-25 14:59:17,195 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:17,491 INFO L129 PetriNetUnfolder]: 246/514 cut-off events. [2021-03-25 14:59:17,492 INFO L130 PetriNetUnfolder]: For 3203/3542 co-relation queries the response was YES. [2021-03-25 14:59:17,494 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 514 events. 246/514 cut-off events. For 3203/3542 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2858 event pairs, 36 based on Foata normal form. 25/528 useless extension candidates. Maximal degree in co-relation 3087. Up to 329 conditions per place. [2021-03-25 14:59:17,498 INFO L132 encePairwiseOnDemand]: 169/183 looper letters, 58 selfloop transitions, 21 changer transitions 0/89 dead transitions. [2021-03-25 14:59:17,498 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 1240 flow [2021-03-25 14:59:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:59:17,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:59:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2021-03-25 14:59:17,501 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7363387978142076 [2021-03-25 14:59:17,501 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2021-03-25 14:59:17,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2021-03-25 14:59:17,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:17,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2021-03-25 14:59:17,503 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-25 14:59:17,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:17,505 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:17,505 INFO L185 Difference]: Start difference. First operand has 63 places, 77 transitions, 935 flow. Second operand 4 states and 539 transitions. [2021-03-25 14:59:17,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 1240 flow [2021-03-25 14:59:17,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 1182 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:59:17,515 INFO L241 Difference]: Finished difference. Result has 64 places, 87 transitions, 1117 flow [2021-03-25 14:59:17,515 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1117, PETRI_PLACES=64, PETRI_TRANSITIONS=87} [2021-03-25 14:59:17,515 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2021-03-25 14:59:17,515 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:17,516 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 87 transitions, 1117 flow [2021-03-25 14:59:17,516 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 87 transitions, 1117 flow [2021-03-25 14:59:17,517 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 87 transitions, 1117 flow [2021-03-25 14:59:17,598 INFO L129 PetriNetUnfolder]: 211/488 cut-off events. [2021-03-25 14:59:17,599 INFO L130 PetriNetUnfolder]: For 3315/3532 co-relation queries the response was YES. [2021-03-25 14:59:17,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2761 conditions, 488 events. 211/488 cut-off events. For 3315/3532 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2903 event pairs, 50 based on Foata normal form. 10/485 useless extension candidates. Maximal degree in co-relation 2737. Up to 256 conditions per place. [2021-03-25 14:59:17,606 INFO L142 LiptonReduction]: Number of co-enabled transitions 504 [2021-03-25 14:59:17,649 INFO L154 LiptonReduction]: Checked pairs total: 647 [2021-03-25 14:59:17,649 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:59:17,649 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 134 [2021-03-25 14:59:17,649 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 87 transitions, 1117 flow [2021-03-25 14:59:17,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 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-25 14:59:17,650 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:17,650 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:17,650 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:59:17,650 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:17,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash 2100197717, now seen corresponding path program 1 times [2021-03-25 14:59:17,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:17,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115941531] [2021-03-25 14:59:17,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:17,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:17,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:17,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:17,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:17,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:17,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:59:17,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:17,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115941531] [2021-03-25 14:59:17,719 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:17,719 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:59:17,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661591270] [2021-03-25 14:59:17,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:59:17,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:17,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:59:17,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:59:17,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183 [2021-03-25 14:59:17,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 87 transitions, 1117 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:17,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:17,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183 [2021-03-25 14:59:17,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:17,877 INFO L129 PetriNetUnfolder]: 314/689 cut-off events. [2021-03-25 14:59:17,878 INFO L130 PetriNetUnfolder]: For 4410/4736 co-relation queries the response was YES. [2021-03-25 14:59:17,881 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 689 events. 314/689 cut-off events. For 4410/4736 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4319 event pairs, 84 based on Foata normal form. 171/814 useless extension candidates. Maximal degree in co-relation 3069. Up to 322 conditions per place. [2021-03-25 14:59:17,885 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 10 selfloop transitions, 8 changer transitions 0/83 dead transitions. [2021-03-25 14:59:17,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 83 transitions, 979 flow [2021-03-25 14:59:17,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:59:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:59:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 798 transitions. [2021-03-25 14:59:17,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8721311475409836 [2021-03-25 14:59:17,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 798 transitions. [2021-03-25 14:59:17,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 798 transitions. [2021-03-25 14:59:17,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:17,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 798 transitions. [2021-03-25 14:59:17,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.6) internal successors, (798), 5 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:17,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:17,892 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 183.0) internal successors, (1098), 6 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:17,892 INFO L185 Difference]: Start difference. First operand has 64 places, 87 transitions, 1117 flow. Second operand 5 states and 798 transitions. [2021-03-25 14:59:17,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 83 transitions, 979 flow [2021-03-25 14:59:17,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 932 flow, removed 23 selfloop flow, removed 1 redundant places. [2021-03-25 14:59:17,921 INFO L241 Difference]: Finished difference. Result has 70 places, 80 transitions, 944 flow [2021-03-25 14:59:17,921 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=944, PETRI_PLACES=70, PETRI_TRANSITIONS=80} [2021-03-25 14:59:17,921 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2021-03-25 14:59:17,921 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:17,921 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 80 transitions, 944 flow [2021-03-25 14:59:17,921 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 80 transitions, 944 flow [2021-03-25 14:59:17,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 80 transitions, 944 flow [2021-03-25 14:59:18,016 INFO L129 PetriNetUnfolder]: 303/677 cut-off events. [2021-03-25 14:59:18,016 INFO L130 PetriNetUnfolder]: For 4062/4354 co-relation queries the response was YES. [2021-03-25 14:59:18,020 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 677 events. 303/677 cut-off events. For 4062/4354 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4349 event pairs, 82 based on Foata normal form. 61/686 useless extension candidates. Maximal degree in co-relation 3322. Up to 292 conditions per place. [2021-03-25 14:59:18,030 INFO L142 LiptonReduction]: Number of co-enabled transitions 678 [2021-03-25 14:59:18,384 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 14:59:18,494 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-25 14:59:19,036 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-03-25 14:59:19,236 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:59:19,243 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-25 14:59:19,243 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:59:19,243 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1322 [2021-03-25 14:59:19,243 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 80 transitions, 952 flow [2021-03-25 14:59:19,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:19,244 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:19,244 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:19,244 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:59:19,244 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:19,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:19,244 INFO L82 PathProgramCache]: Analyzing trace with hash 696831959, now seen corresponding path program 1 times [2021-03-25 14:59:19,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:19,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641114385] [2021-03-25 14:59:19,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:19,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:19,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:19,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:19,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:19,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:19,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:19,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:19,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:59:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:19,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641114385] [2021-03-25 14:59:19,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:19,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:59:19,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912260179] [2021-03-25 14:59:19,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:59:19,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:19,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:59:19,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:59:19,322 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 184 [2021-03-25 14:59:19,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 80 transitions, 952 flow. Second operand has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:19,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:19,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 184 [2021-03-25 14:59:19,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:19,487 INFO L129 PetriNetUnfolder]: 179/484 cut-off events. [2021-03-25 14:59:19,487 INFO L130 PetriNetUnfolder]: For 3704/4536 co-relation queries the response was YES. [2021-03-25 14:59:19,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 484 events. 179/484 cut-off events. For 3704/4536 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3169 event pairs, 15 based on Foata normal form. 332/788 useless extension candidates. Maximal degree in co-relation 2387. Up to 250 conditions per place. [2021-03-25 14:59:19,493 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 5 selfloop transitions, 15 changer transitions 3/85 dead transitions. [2021-03-25 14:59:19,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 85 transitions, 996 flow [2021-03-25 14:59:19,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:59:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:59:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-03-25 14:59:19,496 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8726708074534162 [2021-03-25 14:59:19,496 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-03-25 14:59:19,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-03-25 14:59:19,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:19,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-03-25 14:59:19,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:19,502 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-25 14:59:19,514 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-25 14:59:19,514 INFO L185 Difference]: Start difference. First operand has 70 places, 80 transitions, 952 flow. Second operand 7 states and 1124 transitions. [2021-03-25 14:59:19,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 85 transitions, 996 flow [2021-03-25 14:59:19,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 85 transitions, 974 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:59:19,522 INFO L241 Difference]: Finished difference. Result has 75 places, 82 transitions, 969 flow [2021-03-25 14:59:19,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=969, PETRI_PLACES=75, PETRI_TRANSITIONS=82} [2021-03-25 14:59:19,523 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2021-03-25 14:59:19,523 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:19,523 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 82 transitions, 969 flow [2021-03-25 14:59:19,523 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 82 transitions, 969 flow [2021-03-25 14:59:19,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 82 transitions, 969 flow [2021-03-25 14:59:19,580 INFO L129 PetriNetUnfolder]: 163/457 cut-off events. [2021-03-25 14:59:19,580 INFO L130 PetriNetUnfolder]: For 3445/3964 co-relation queries the response was YES. [2021-03-25 14:59:19,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 457 events. 163/457 cut-off events. For 3445/3964 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3022 event pairs, 13 based on Foata normal form. 44/471 useless extension candidates. Maximal degree in co-relation 2410. Up to 223 conditions per place. [2021-03-25 14:59:19,588 INFO L142 LiptonReduction]: Number of co-enabled transitions 764 [2021-03-25 14:59:19,821 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-25 14:59:20,285 WARN L205 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-25 14:59:20,365 INFO L154 LiptonReduction]: Checked pairs total: 96 [2021-03-25 14:59:20,365 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:59:20,365 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 842 [2021-03-25 14:59:20,366 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 959 flow [2021-03-25 14:59:20,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.8) internal successors, (789), 5 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:20,367 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:20,367 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:20,367 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:59:20,367 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1321337127, now seen corresponding path program 1 times [2021-03-25 14:59:20,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:20,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313376488] [2021-03-25 14:59:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:20,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:20,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:20,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:20,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:20,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:20,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:20,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:20,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:20,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:20,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:59:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:20,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313376488] [2021-03-25 14:59:20,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:20,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:59:20,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124788342] [2021-03-25 14:59:20,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:59:20,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:20,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:59:20,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:59:20,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 185 [2021-03-25 14:59:20,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 959 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:20,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:20,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 185 [2021-03-25 14:59:20,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:20,588 INFO L129 PetriNetUnfolder]: 100/268 cut-off events. [2021-03-25 14:59:20,588 INFO L130 PetriNetUnfolder]: For 2294/2464 co-relation queries the response was YES. [2021-03-25 14:59:20,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 268 events. 100/268 cut-off events. For 2294/2464 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1354 event pairs, 6 based on Foata normal form. 59/318 useless extension candidates. Maximal degree in co-relation 1522. Up to 112 conditions per place. [2021-03-25 14:59:20,591 INFO L132 encePairwiseOnDemand]: 179/185 looper letters, 2 selfloop transitions, 11 changer transitions 4/78 dead transitions. [2021-03-25 14:59:20,592 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 78 transitions, 964 flow [2021-03-25 14:59:20,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:59:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:59:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1124 transitions. [2021-03-25 14:59:20,595 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8679536679536679 [2021-03-25 14:59:20,596 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1124 transitions. [2021-03-25 14:59:20,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1124 transitions. [2021-03-25 14:59:20,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:20,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1124 transitions. [2021-03-25 14:59:20,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.57142857142858) internal successors, (1124), 7 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:20,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:20,600 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:20,601 INFO L185 Difference]: Start difference. First operand has 75 places, 80 transitions, 959 flow. Second operand 7 states and 1124 transitions. [2021-03-25 14:59:20,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 78 transitions, 964 flow [2021-03-25 14:59:20,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 869 flow, removed 35 selfloop flow, removed 7 redundant places. [2021-03-25 14:59:20,609 INFO L241 Difference]: Finished difference. Result has 72 places, 74 transitions, 833 flow [2021-03-25 14:59:20,609 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=833, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2021-03-25 14:59:20,609 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2021-03-25 14:59:20,609 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:20,609 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 74 transitions, 833 flow [2021-03-25 14:59:20,610 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 74 transitions, 833 flow [2021-03-25 14:59:20,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions, 833 flow [2021-03-25 14:59:20,658 INFO L129 PetriNetUnfolder]: 92/254 cut-off events. [2021-03-25 14:59:20,658 INFO L130 PetriNetUnfolder]: For 1569/1720 co-relation queries the response was YES. [2021-03-25 14:59:20,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1356 conditions, 254 events. 92/254 cut-off events. For 1569/1720 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1281 event pairs, 6 based on Foata normal form. 4/249 useless extension candidates. Maximal degree in co-relation 1327. Up to 99 conditions per place. [2021-03-25 14:59:20,661 INFO L142 LiptonReduction]: Number of co-enabled transitions 398 [2021-03-25 14:59:20,801 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-25 14:59:20,923 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-25 14:59:21,141 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:59:21,368 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-25 14:59:22,448 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 14:59:22,940 WARN L205 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 14:59:25,184 WARN L205 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:59:26,235 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:59:27,489 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 248 DAG size of output: 194 [2021-03-25 14:59:27,946 WARN L205 SmtUtils]: Spent 454.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:59:30,553 WARN L205 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 349 DAG size of output: 270 [2021-03-25 14:59:31,425 WARN L205 SmtUtils]: Spent 870.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 14:59:31,432 INFO L154 LiptonReduction]: Checked pairs total: 43 [2021-03-25 14:59:31,432 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 14:59:31,432 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10823 [2021-03-25 14:59:31,432 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 820 flow [2021-03-25 14:59:31,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:31,433 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:31,433 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:31,433 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:59:31,433 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash 278749299, now seen corresponding path program 1 times [2021-03-25 14:59:31,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:31,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577337165] [2021-03-25 14:59:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:31,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:31,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:31,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:31,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:59:31,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:31,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:31,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577337165] [2021-03-25 14:59:31,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:31,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:59:31,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170910790] [2021-03-25 14:59:31,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:59:31,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:31,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:59:31,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:59:31,544 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 188 [2021-03-25 14:59:31,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 820 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:31,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:31,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 188 [2021-03-25 14:59:31,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:31,853 INFO L129 PetriNetUnfolder]: 101/265 cut-off events. [2021-03-25 14:59:31,853 INFO L130 PetriNetUnfolder]: For 2175/2387 co-relation queries the response was YES. [2021-03-25 14:59:31,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 265 events. 101/265 cut-off events. For 2175/2387 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1428 event pairs, 5 based on Foata normal form. 23/282 useless extension candidates. Maximal degree in co-relation 1528. Up to 146 conditions per place. [2021-03-25 14:59:31,857 INFO L132 encePairwiseOnDemand]: 183/188 looper letters, 54 selfloop transitions, 1 changer transitions 6/76 dead transitions. [2021-03-25 14:59:31,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 997 flow [2021-03-25 14:59:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:59:31,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:59:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 817 transitions. [2021-03-25 14:59:31,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.724290780141844 [2021-03-25 14:59:31,861 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 817 transitions. [2021-03-25 14:59:31,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 817 transitions. [2021-03-25 14:59:31,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:31,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 817 transitions. [2021-03-25 14:59:31,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:31,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:31,866 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 188.0) internal successors, (1316), 7 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:31,866 INFO L185 Difference]: Start difference. First operand has 68 places, 71 transitions, 820 flow. Second operand 6 states and 817 transitions. [2021-03-25 14:59:31,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 997 flow [2021-03-25 14:59:31,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 76 transitions, 933 flow, removed 23 selfloop flow, removed 7 redundant places. [2021-03-25 14:59:31,876 INFO L241 Difference]: Finished difference. Result has 69 places, 70 transitions, 757 flow [2021-03-25 14:59:31,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=757, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2021-03-25 14:59:31,877 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2021-03-25 14:59:31,877 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:31,877 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 70 transitions, 757 flow [2021-03-25 14:59:31,877 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 70 transitions, 757 flow [2021-03-25 14:59:31,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 70 transitions, 757 flow [2021-03-25 14:59:31,910 INFO L129 PetriNetUnfolder]: 91/233 cut-off events. [2021-03-25 14:59:31,910 INFO L130 PetriNetUnfolder]: For 1466/1604 co-relation queries the response was YES. [2021-03-25 14:59:31,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 233 events. 91/233 cut-off events. For 1466/1604 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1162 event pairs, 4 based on Foata normal form. 15/242 useless extension candidates. Maximal degree in co-relation 1091. Up to 97 conditions per place. [2021-03-25 14:59:31,913 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-25 14:59:33,269 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-03-25 14:59:33,891 WARN L205 SmtUtils]: Spent 621.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-03-25 14:59:36,671 WARN L205 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-03-25 14:59:37,948 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 255 [2021-03-25 14:59:37,954 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-25 14:59:37,954 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:59:37,955 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6078 [2021-03-25 14:59:37,955 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 755 flow [2021-03-25 14:59:37,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:37,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:37,956 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:37,956 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:59:37,956 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:37,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:37,956 INFO L82 PathProgramCache]: Analyzing trace with hash 478188972, now seen corresponding path program 1 times [2021-03-25 14:59:37,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:37,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327892746] [2021-03-25 14:59:37,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:38,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:38,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:59:38,054 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-25 14:59:38,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 14:59:38,090 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-25 14:59:38,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 14:59:38,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:38,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:38,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:38,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327892746] [2021-03-25 14:59:38,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:38,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:59:38,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382688219] [2021-03-25 14:59:38,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:59:38,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:59:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:59:38,147 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 189 [2021-03-25 14:59:38,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 755 flow. Second operand has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:38,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:38,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 189 [2021-03-25 14:59:38,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:38,600 INFO L129 PetriNetUnfolder]: 107/280 cut-off events. [2021-03-25 14:59:38,600 INFO L130 PetriNetUnfolder]: For 1930/2103 co-relation queries the response was YES. [2021-03-25 14:59:38,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 280 events. 107/280 cut-off events. For 1930/2103 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1504 event pairs, 7 based on Foata normal form. 39/315 useless extension candidates. Maximal degree in co-relation 1467. Up to 132 conditions per place. [2021-03-25 14:59:38,604 INFO L132 encePairwiseOnDemand]: 177/189 looper letters, 41 selfloop transitions, 15 changer transitions 24/94 dead transitions. [2021-03-25 14:59:38,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 1178 flow [2021-03-25 14:59:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:59:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:59:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 814 transitions. [2021-03-25 14:59:38,609 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7178130511463845 [2021-03-25 14:59:38,609 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 814 transitions. [2021-03-25 14:59:38,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 814 transitions. [2021-03-25 14:59:38,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:38,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 814 transitions. [2021-03-25 14:59:38,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:38,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:38,613 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:38,613 INFO L185 Difference]: Start difference. First operand has 65 places, 69 transitions, 755 flow. Second operand 6 states and 814 transitions. [2021-03-25 14:59:38,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 1178 flow [2021-03-25 14:59:38,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 1161 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-03-25 14:59:38,623 INFO L241 Difference]: Finished difference. Result has 69 places, 70 transitions, 814 flow [2021-03-25 14:59:38,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=814, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2021-03-25 14:59:38,623 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2021-03-25 14:59:38,624 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:38,624 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 70 transitions, 814 flow [2021-03-25 14:59:38,624 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 70 transitions, 814 flow [2021-03-25 14:59:38,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 70 transitions, 814 flow [2021-03-25 14:59:38,658 INFO L129 PetriNetUnfolder]: 85/217 cut-off events. [2021-03-25 14:59:38,658 INFO L130 PetriNetUnfolder]: For 1445/1585 co-relation queries the response was YES. [2021-03-25 14:59:38,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 217 events. 85/217 cut-off events. For 1445/1585 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1022 event pairs, 6 based on Foata normal form. 21/234 useless extension candidates. Maximal degree in co-relation 1097. Up to 95 conditions per place. [2021-03-25 14:59:38,661 INFO L142 LiptonReduction]: Number of co-enabled transitions 300 [2021-03-25 14:59:38,664 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:59:38,665 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:59:38,665 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 14:59:38,666 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 814 flow [2021-03-25 14:59:38,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:38,667 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:38,667 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:38,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 14:59:38,667 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:38,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:38,668 INFO L82 PathProgramCache]: Analyzing trace with hash 123515248, now seen corresponding path program 1 times [2021-03-25 14:59:38,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:38,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460544000] [2021-03-25 14:59:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:38,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:38,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:38,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:38,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:59:38,802 INFO L142 QuantifierPusher]: treesize reduction 15, result has 46.4 percent of original size [2021-03-25 14:59:38,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:38,812 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 14:59:38,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 14:59:38,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:38,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:59:38,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:38,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:38,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460544000] [2021-03-25 14:59:38,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:38,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:59:38,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111165662] [2021-03-25 14:59:38,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:59:38,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:38,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:59:38,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:59:38,933 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 189 [2021-03-25 14:59:38,934 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 814 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:38,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:38,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 189 [2021-03-25 14:59:38,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:39,502 INFO L129 PetriNetUnfolder]: 99/263 cut-off events. [2021-03-25 14:59:39,502 INFO L130 PetriNetUnfolder]: For 1817/1985 co-relation queries the response was YES. [2021-03-25 14:59:39,504 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 263 events. 99/263 cut-off events. For 1817/1985 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1397 event pairs, 6 based on Foata normal form. 48/307 useless extension candidates. Maximal degree in co-relation 1448. Up to 112 conditions per place. [2021-03-25 14:59:39,506 INFO L132 encePairwiseOnDemand]: 178/189 looper letters, 37 selfloop transitions, 14 changer transitions 17/82 dead transitions. [2021-03-25 14:59:39,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 82 transitions, 1096 flow [2021-03-25 14:59:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:59:39,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:59:39,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1000 transitions. [2021-03-25 14:59:39,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6613756613756614 [2021-03-25 14:59:39,511 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1000 transitions. [2021-03-25 14:59:39,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1000 transitions. [2021-03-25 14:59:39,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:39,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1000 transitions. [2021-03-25 14:59:39,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:39,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:39,516 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 189.0) internal successors, (1701), 9 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:39,516 INFO L185 Difference]: Start difference. First operand has 67 places, 70 transitions, 814 flow. Second operand 8 states and 1000 transitions. [2021-03-25 14:59:39,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 82 transitions, 1096 flow [2021-03-25 14:59:39,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 82 transitions, 1024 flow, removed 22 selfloop flow, removed 3 redundant places. [2021-03-25 14:59:39,524 INFO L241 Difference]: Finished difference. Result has 74 places, 65 transitions, 738 flow [2021-03-25 14:59:39,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=738, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2021-03-25 14:59:39,525 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2021-03-25 14:59:39,525 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:39,525 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 65 transitions, 738 flow [2021-03-25 14:59:39,528 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 65 transitions, 738 flow [2021-03-25 14:59:39,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 65 transitions, 738 flow [2021-03-25 14:59:39,556 INFO L129 PetriNetUnfolder]: 72/189 cut-off events. [2021-03-25 14:59:39,556 INFO L130 PetriNetUnfolder]: For 1226/1334 co-relation queries the response was YES. [2021-03-25 14:59:39,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 189 events. 72/189 cut-off events. For 1226/1334 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 858 event pairs, 5 based on Foata normal form. 14/200 useless extension candidates. Maximal degree in co-relation 917. Up to 82 conditions per place. [2021-03-25 14:59:39,560 INFO L142 LiptonReduction]: Number of co-enabled transitions 266 [2021-03-25 14:59:39,562 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:59:39,562 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:59:39,562 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 14:59:39,564 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 738 flow [2021-03-25 14:59:39,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:39,564 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:39,564 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:39,564 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 14:59:39,564 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash 747409098, now seen corresponding path program 2 times [2021-03-25 14:59:39,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:39,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760338428] [2021-03-25 14:59:39,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:39,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:39,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:39,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:39,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:39,699 INFO L142 QuantifierPusher]: treesize reduction 17, result has 78.5 percent of original size [2021-03-25 14:59:39,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-25 14:59:39,776 INFO L142 QuantifierPusher]: treesize reduction 19, result has 71.2 percent of original size [2021-03-25 14:59:39,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:59:39,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:39,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:59:39,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:39,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:59:39,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:39,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:59:39,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:39,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:39,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:39,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760338428] [2021-03-25 14:59:39,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:39,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 14:59:39,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890450504] [2021-03-25 14:59:39,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 14:59:39,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 14:59:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 14:59:39,979 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 189 [2021-03-25 14:59:39,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 738 flow. Second operand has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:39,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:39,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 189 [2021-03-25 14:59:39,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:40,787 INFO L129 PetriNetUnfolder]: 96/265 cut-off events. [2021-03-25 14:59:40,787 INFO L130 PetriNetUnfolder]: For 1607/1723 co-relation queries the response was YES. [2021-03-25 14:59:40,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1371 conditions, 265 events. 96/265 cut-off events. For 1607/1723 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1422 event pairs, 5 based on Foata normal form. 44/303 useless extension candidates. Maximal degree in co-relation 1342. Up to 99 conditions per place. [2021-03-25 14:59:40,793 INFO L132 encePairwiseOnDemand]: 181/189 looper letters, 46 selfloop transitions, 15 changer transitions 15/90 dead transitions. [2021-03-25 14:59:40,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 90 transitions, 1168 flow [2021-03-25 14:59:40,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:59:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:59:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2021-03-25 14:59:40,798 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6305114638447972 [2021-03-25 14:59:40,798 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2021-03-25 14:59:40,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2021-03-25 14:59:40,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:40,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2021-03-25 14:59:40,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:40,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:40,801 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:40,801 INFO L185 Difference]: Start difference. First operand has 70 places, 65 transitions, 738 flow. Second operand 6 states and 715 transitions. [2021-03-25 14:59:40,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 90 transitions, 1168 flow [2021-03-25 14:59:40,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 90 transitions, 1122 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-03-25 14:59:40,810 INFO L241 Difference]: Finished difference. Result has 70 places, 58 transitions, 661 flow [2021-03-25 14:59:40,810 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=661, PETRI_PLACES=70, PETRI_TRANSITIONS=58} [2021-03-25 14:59:40,810 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2021-03-25 14:59:40,811 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:40,811 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 58 transitions, 661 flow [2021-03-25 14:59:40,811 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 58 transitions, 661 flow [2021-03-25 14:59:40,811 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 58 transitions, 661 flow [2021-03-25 14:59:40,844 INFO L129 PetriNetUnfolder]: 74/212 cut-off events. [2021-03-25 14:59:40,844 INFO L130 PetriNetUnfolder]: For 1587/1706 co-relation queries the response was YES. [2021-03-25 14:59:40,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1027 conditions, 212 events. 74/212 cut-off events. For 1587/1706 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1065 event pairs, 9 based on Foata normal form. 25/233 useless extension candidates. Maximal degree in co-relation 1000. Up to 84 conditions per place. [2021-03-25 14:59:40,847 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-25 14:59:40,850 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:59:40,850 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:59:40,850 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-25 14:59:40,850 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 58 transitions, 661 flow [2021-03-25 14:59:40,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:40,851 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:40,851 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:40,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 14:59:40,851 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:40,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1347773488, now seen corresponding path program 2 times [2021-03-25 14:59:40,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:40,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634235639] [2021-03-25 14:59:40,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:40,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:40,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:40,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:40,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:59:40,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:40,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 14:59:41,023 INFO L142 QuantifierPusher]: treesize reduction 8, result has 81.0 percent of original size [2021-03-25 14:59:41,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 14:59:41,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:41,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:59:41,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:41,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:41,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634235639] [2021-03-25 14:59:41,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:41,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:59:41,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446263536] [2021-03-25 14:59:41,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:59:41,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:41,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:59:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:59:41,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 189 [2021-03-25 14:59:41,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 661 flow. Second operand has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:41,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:41,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 189 [2021-03-25 14:59:41,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:41,570 INFO L129 PetriNetUnfolder]: 87/250 cut-off events. [2021-03-25 14:59:41,571 INFO L130 PetriNetUnfolder]: For 1880/1990 co-relation queries the response was YES. [2021-03-25 14:59:41,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 250 events. 87/250 cut-off events. For 1880/1990 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1337 event pairs, 13 based on Foata normal form. 46/291 useless extension candidates. Maximal degree in co-relation 1293. Up to 111 conditions per place. [2021-03-25 14:59:41,574 INFO L132 encePairwiseOnDemand]: 181/189 looper letters, 32 selfloop transitions, 2 changer transitions 17/65 dead transitions. [2021-03-25 14:59:41,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 65 transitions, 846 flow [2021-03-25 14:59:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:59:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:59:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2021-03-25 14:59:41,579 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6402116402116402 [2021-03-25 14:59:41,580 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2021-03-25 14:59:41,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2021-03-25 14:59:41,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:41,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2021-03-25 14:59:41,581 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-25 14:59:41,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:41,583 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:41,584 INFO L185 Difference]: Start difference. First operand has 70 places, 58 transitions, 661 flow. Second operand 7 states and 847 transitions. [2021-03-25 14:59:41,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 65 transitions, 846 flow [2021-03-25 14:59:41,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 65 transitions, 803 flow, removed 8 selfloop flow, removed 6 redundant places. [2021-03-25 14:59:41,591 INFO L241 Difference]: Finished difference. Result has 72 places, 48 transitions, 506 flow [2021-03-25 14:59:41,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2021-03-25 14:59:41,592 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2021-03-25 14:59:41,592 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:41,592 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 48 transitions, 506 flow [2021-03-25 14:59:41,592 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 48 transitions, 506 flow [2021-03-25 14:59:41,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 48 transitions, 506 flow [2021-03-25 14:59:41,619 INFO L129 PetriNetUnfolder]: 70/199 cut-off events. [2021-03-25 14:59:41,620 INFO L130 PetriNetUnfolder]: For 1139/1171 co-relation queries the response was YES. [2021-03-25 14:59:41,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 199 events. 70/199 cut-off events. For 1139/1171 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1001 event pairs, 8 based on Foata normal form. 22/218 useless extension candidates. Maximal degree in co-relation 907. Up to 78 conditions per place. [2021-03-25 14:59:41,623 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-25 14:59:41,982 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-03-25 14:59:42,529 WARN L205 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-03-25 14:59:43,064 WARN L205 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 14:59:43,241 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-25 14:59:43,975 WARN L205 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-03-25 14:59:44,225 WARN L205 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-25 14:59:44,229 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-25 14:59:44,229 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:59:44,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2637 [2021-03-25 14:59:44,230 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 516 flow [2021-03-25 14:59:44,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:44,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:44,230 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-25 14:59:44,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 14:59:44,231 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash -763406051, now seen corresponding path program 1 times [2021-03-25 14:59:44,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:44,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937303695] [2021-03-25 14:59:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:44,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:44,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:44,321 INFO L142 QuantifierPusher]: treesize reduction 15, result has 74.6 percent of original size [2021-03-25 14:59:44,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:59:44,362 INFO L142 QuantifierPusher]: treesize reduction 15, result has 75.8 percent of original size [2021-03-25 14:59:44,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:59:44,412 INFO L142 QuantifierPusher]: treesize reduction 25, result has 44.4 percent of original size [2021-03-25 14:59:44,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:59:44,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:44,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:59:44,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:44,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937303695] [2021-03-25 14:59:44,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:44,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:59:44,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179904084] [2021-03-25 14:59:44,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:59:44,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:44,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:59:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:59:44,477 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 191 [2021-03-25 14:59:44,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 516 flow. Second operand has 7 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:44,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:44,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 191 [2021-03-25 14:59:44,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:44,980 INFO L129 PetriNetUnfolder]: 98/279 cut-off events. [2021-03-25 14:59:44,980 INFO L130 PetriNetUnfolder]: For 1555/1618 co-relation queries the response was YES. [2021-03-25 14:59:44,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 279 events. 98/279 cut-off events. For 1555/1618 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1575 event pairs, 9 based on Foata normal form. 42/317 useless extension candidates. Maximal degree in co-relation 1383. Up to 105 conditions per place. [2021-03-25 14:59:44,985 INFO L132 encePairwiseOnDemand]: 183/191 looper letters, 35 selfloop transitions, 9 changer transitions 13/71 dead transitions. [2021-03-25 14:59:44,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 879 flow [2021-03-25 14:59:44,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:59:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:59:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 914 transitions. [2021-03-25 14:59:44,995 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6836200448765893 [2021-03-25 14:59:44,995 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 914 transitions. [2021-03-25 14:59:44,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 914 transitions. [2021-03-25 14:59:44,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:44,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 914 transitions. [2021-03-25 14:59:45,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.57142857142858) internal successors, (914), 7 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,002 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 191.0) internal successors, (1528), 8 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,002 INFO L185 Difference]: Start difference. First operand has 62 places, 48 transitions, 516 flow. Second operand 7 states and 914 transitions. [2021-03-25 14:59:45,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 879 flow [2021-03-25 14:59:45,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 71 transitions, 748 flow, removed 59 selfloop flow, removed 7 redundant places. [2021-03-25 14:59:45,009 INFO L241 Difference]: Finished difference. Result has 62 places, 45 transitions, 408 flow [2021-03-25 14:59:45,009 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=408, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2021-03-25 14:59:45,009 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2021-03-25 14:59:45,009 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:45,010 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 45 transitions, 408 flow [2021-03-25 14:59:45,010 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 45 transitions, 408 flow [2021-03-25 14:59:45,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 45 transitions, 408 flow [2021-03-25 14:59:45,041 INFO L129 PetriNetUnfolder]: 75/218 cut-off events. [2021-03-25 14:59:45,041 INFO L130 PetriNetUnfolder]: For 774/813 co-relation queries the response was YES. [2021-03-25 14:59:45,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 218 events. 75/218 cut-off events. For 774/813 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1194 event pairs, 12 based on Foata normal form. 17/232 useless extension candidates. Maximal degree in co-relation 861. Up to 78 conditions per place. [2021-03-25 14:59:45,044 INFO L142 LiptonReduction]: Number of co-enabled transitions 186 [2021-03-25 14:59:45,045 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:59:45,046 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:59:45,046 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 14:59:45,046 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 408 flow [2021-03-25 14:59:45,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:45,047 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:45,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 14:59:45,047 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:45,047 INFO L82 PathProgramCache]: Analyzing trace with hash -485403765, now seen corresponding path program 1 times [2021-03-25 14:59:45,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:45,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022489745] [2021-03-25 14:59:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:45,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:45,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:45,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:45,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:45,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:45,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:59:45,197 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 14:59:45,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:59:45,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:45,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:59:45,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:45,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:59:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:45,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022489745] [2021-03-25 14:59:45,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:45,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:59:45,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129889583] [2021-03-25 14:59:45,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:59:45,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:59:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:59:45,295 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 191 [2021-03-25 14:59:45,296 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 408 flow. Second operand has 8 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,296 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:45,296 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 191 [2021-03-25 14:59:45,296 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:45,694 INFO L129 PetriNetUnfolder]: 74/214 cut-off events. [2021-03-25 14:59:45,694 INFO L130 PetriNetUnfolder]: For 913/969 co-relation queries the response was YES. [2021-03-25 14:59:45,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 214 events. 74/214 cut-off events. For 913/969 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1116 event pairs, 12 based on Foata normal form. 34/245 useless extension candidates. Maximal degree in co-relation 956. Up to 84 conditions per place. [2021-03-25 14:59:45,696 INFO L132 encePairwiseOnDemand]: 184/191 looper letters, 25 selfloop transitions, 2 changer transitions 16/57 dead transitions. [2021-03-25 14:59:45,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 609 flow [2021-03-25 14:59:45,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:59:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:59:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 764 transitions. [2021-03-25 14:59:45,701 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2021-03-25 14:59:45,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 764 transitions. [2021-03-25 14:59:45,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 764 transitions. [2021-03-25 14:59:45,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:45,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 764 transitions. [2021-03-25 14:59:45,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,707 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 191.0) internal successors, (1337), 7 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:45,707 INFO L185 Difference]: Start difference. First operand has 59 places, 45 transitions, 408 flow. Second operand 6 states and 764 transitions. [2021-03-25 14:59:45,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 609 flow [2021-03-25 14:59:45,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 517 flow, removed 29 selfloop flow, removed 9 redundant places. [2021-03-25 14:59:45,712 INFO L241 Difference]: Finished difference. Result has 57 places, 41 transitions, 305 flow [2021-03-25 14:59:45,712 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2021-03-25 14:59:45,712 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-03-25 14:59:45,712 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:45,712 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 41 transitions, 305 flow [2021-03-25 14:59:45,712 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 41 transitions, 305 flow [2021-03-25 14:59:45,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 305 flow [2021-03-25 14:59:45,731 INFO L129 PetriNetUnfolder]: 53/153 cut-off events. [2021-03-25 14:59:45,732 INFO L130 PetriNetUnfolder]: For 329/347 co-relation queries the response was YES. [2021-03-25 14:59:45,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 153 events. 53/153 cut-off events. For 329/347 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 699 event pairs, 9 based on Foata normal form. 13/164 useless extension candidates. Maximal degree in co-relation 549. Up to 60 conditions per place. [2021-03-25 14:59:45,733 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 14:59:46,004 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-03-25 14:59:46,107 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-03-25 14:59:46,665 WARN L205 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 89 [2021-03-25 14:59:46,900 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-03-25 14:59:46,904 INFO L154 LiptonReduction]: Checked pairs total: 1 [2021-03-25 14:59:46,905 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:59:46,905 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1193 [2021-03-25 14:59:46,905 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 310 flow [2021-03-25 14:59:46,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 124.125) internal successors, (993), 8 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:46,905 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:46,906 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:46,906 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 14:59:46,906 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:46,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:46,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1522473603, now seen corresponding path program 1 times [2021-03-25 14:59:46,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:46,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636424597] [2021-03-25 14:59:46,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:46,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:46,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:46,973 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 14:59:46,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:59:47,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:47,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:59:47,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:47,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:47,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636424597] [2021-03-25 14:59:47,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:47,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:59:47,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9718281] [2021-03-25 14:59:47,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:59:47,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:47,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:59:47,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:59:47,045 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 192 [2021-03-25 14:59:47,045 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:47,045 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:47,045 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 192 [2021-03-25 14:59:47,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:47,330 INFO L129 PetriNetUnfolder]: 68/196 cut-off events. [2021-03-25 14:59:47,330 INFO L130 PetriNetUnfolder]: For 501/537 co-relation queries the response was YES. [2021-03-25 14:59:47,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 196 events. 68/196 cut-off events. For 501/537 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1006 event pairs, 9 based on Foata normal form. 27/219 useless extension candidates. Maximal degree in co-relation 800. Up to 75 conditions per place. [2021-03-25 14:59:47,331 INFO L132 encePairwiseOnDemand]: 184/192 looper letters, 17 selfloop transitions, 5 changer transitions 13/49 dead transitions. [2021-03-25 14:59:47,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 438 flow [2021-03-25 14:59:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:59:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:59:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2021-03-25 14:59:47,335 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2021-03-25 14:59:47,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2021-03-25 14:59:47,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2021-03-25 14:59:47,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:47,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2021-03-25 14:59:47,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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-25 14:59:47,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:47,338 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:47,338 INFO L185 Difference]: Start difference. First operand has 54 places, 41 transitions, 310 flow. Second operand 6 states and 765 transitions. [2021-03-25 14:59:47,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 438 flow [2021-03-25 14:59:47,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 425 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-03-25 14:59:47,341 INFO L241 Difference]: Finished difference. Result has 55 places, 35 transitions, 242 flow [2021-03-25 14:59:47,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2021-03-25 14:59:47,342 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2021-03-25 14:59:47,342 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:47,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 35 transitions, 242 flow [2021-03-25 14:59:47,342 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 35 transitions, 242 flow [2021-03-25 14:59:47,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 35 transitions, 242 flow [2021-03-25 14:59:47,356 INFO L129 PetriNetUnfolder]: 38/115 cut-off events. [2021-03-25 14:59:47,357 INFO L130 PetriNetUnfolder]: For 194/211 co-relation queries the response was YES. [2021-03-25 14:59:47,357 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 115 events. 38/115 cut-off events. For 194/211 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 500 event pairs, 8 based on Foata normal form. 12/123 useless extension candidates. Maximal degree in co-relation 394. Up to 41 conditions per place. [2021-03-25 14:59:47,358 INFO L142 LiptonReduction]: Number of co-enabled transitions 88 [2021-03-25 14:59:48,596 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-25 14:59:49,025 WARN L205 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-25 14:59:51,719 WARN L205 SmtUtils]: Spent 2.69 s on a formula simplification. DAG size of input: 377 DAG size of output: 243 [2021-03-25 14:59:52,569 WARN L205 SmtUtils]: Spent 848.00 ms on a formula simplification that was a NOOP. DAG size: 222 [2021-03-25 14:59:53,882 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-03-25 14:59:54,211 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-03-25 14:59:57,004 WARN L205 SmtUtils]: Spent 2.79 s on a formula simplification. DAG size of input: 378 DAG size of output: 239 [2021-03-25 14:59:57,932 WARN L205 SmtUtils]: Spent 926.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2021-03-25 14:59:57,936 INFO L154 LiptonReduction]: Checked pairs total: 8 [2021-03-25 14:59:57,936 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:59:57,936 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10594 [2021-03-25 14:59:57,937 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 248 flow [2021-03-25 14:59:57,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 125.5) internal successors, (753), 6 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:57,937 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:57,937 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:57,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 14:59:57,937 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash 970611189, now seen corresponding path program 1 times [2021-03-25 14:59:57,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:57,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907635127] [2021-03-25 14:59:57,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:59:58,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:58,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:59:58,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:58,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:58,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:58,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:59:58,039 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.8 percent of original size [2021-03-25 14:59:58,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-03-25 14:59:58,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:59:58,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:59:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:59:58,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907635127] [2021-03-25 14:59:58,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:59:58,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:59:58,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457703946] [2021-03-25 14:59:58,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:59:58,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:59:58,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:59:58,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:59:58,139 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 194 [2021-03-25 14:59:58,140 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 35 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:58,140 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:59:58,140 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 194 [2021-03-25 14:59:58,140 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:59:58,366 INFO L129 PetriNetUnfolder]: 47/140 cut-off events. [2021-03-25 14:59:58,366 INFO L130 PetriNetUnfolder]: For 342/377 co-relation queries the response was YES. [2021-03-25 14:59:58,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 140 events. 47/140 cut-off events. For 342/377 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 616 event pairs, 7 based on Foata normal form. 24/158 useless extension candidates. Maximal degree in co-relation 530. Up to 44 conditions per place. [2021-03-25 14:59:58,367 INFO L132 encePairwiseOnDemand]: 186/194 looper letters, 13 selfloop transitions, 9 changer transitions 1/37 dead transitions. [2021-03-25 14:59:58,367 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 37 transitions, 310 flow [2021-03-25 14:59:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:59:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:59:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2021-03-25 14:59:58,371 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6868556701030928 [2021-03-25 14:59:58,371 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2021-03-25 14:59:58,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2021-03-25 14:59:58,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:59:58,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2021-03-25 14:59:58,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:58,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:58,373 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:58,373 INFO L185 Difference]: Start difference. First operand has 54 places, 35 transitions, 248 flow. Second operand 4 states and 533 transitions. [2021-03-25 14:59:58,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 37 transitions, 310 flow [2021-03-25 14:59:58,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 37 transitions, 276 flow, removed 7 selfloop flow, removed 8 redundant places. [2021-03-25 14:59:58,375 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 256 flow [2021-03-25 14:59:58,375 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-03-25 14:59:58,375 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2021-03-25 14:59:58,376 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:59:58,376 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 256 flow [2021-03-25 14:59:58,376 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 256 flow [2021-03-25 14:59:58,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 256 flow [2021-03-25 14:59:58,391 INFO L129 PetriNetUnfolder]: 46/142 cut-off events. [2021-03-25 14:59:58,392 INFO L130 PetriNetUnfolder]: For 249/265 co-relation queries the response was YES. [2021-03-25 14:59:58,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 142 events. 46/142 cut-off events. For 249/265 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 700 event pairs, 6 based on Foata normal form. 12/148 useless extension candidates. Maximal degree in co-relation 495. Up to 43 conditions per place. [2021-03-25 14:59:58,393 INFO L142 LiptonReduction]: Number of co-enabled transitions 102 [2021-03-25 14:59:58,394 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:59:58,394 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:59:58,394 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18 [2021-03-25 14:59:58,395 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 256 flow [2021-03-25 14:59:58,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:59:58,395 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:59:58,395 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:59:58,395 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 14:59:58,395 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:59:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:59:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1656120521, now seen corresponding path program 2 times [2021-03-25 14:59:58,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:59:58,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805805899] [2021-03-25 14:59:58,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:59:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:59:58,440 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:59:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:59:58,505 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:59:58,549 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:59:58,550 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:59:58,550 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 14:59:58,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:59:58 BasicIcfg [2021-03-25 14:59:58,645 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:59:58,646 INFO L168 Benchmark]: Toolchain (without parser) took 93859.87 ms. Allocated memory was 255.9 MB in the beginning and 866.1 MB in the end (delta: 610.3 MB). Free memory was 232.6 MB in the beginning and 552.1 MB in the end (delta: -319.5 MB). Peak memory consumption was 290.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:59:58,646 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:59:58,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.54 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 232.2 MB in the beginning and 321.5 MB in the end (delta: -89.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 14:59:58,646 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.97 ms. Allocated memory is still 364.9 MB. Free memory was 321.0 MB in the beginning and 318.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:59:58,646 INFO L168 Benchmark]: Boogie Preprocessor took 50.67 ms. Allocated memory is still 364.9 MB. Free memory was 318.4 MB in the beginning and 315.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:59:58,646 INFO L168 Benchmark]: RCFGBuilder took 2972.10 ms. Allocated memory was 364.9 MB in the beginning and 450.9 MB in the end (delta: 86.0 MB). Free memory was 315.2 MB in the beginning and 282.7 MB in the end (delta: 32.5 MB). Peak memory consumption was 120.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:59:58,647 INFO L168 Benchmark]: TraceAbstraction took 90226.05 ms. Allocated memory was 450.9 MB in the beginning and 866.1 MB in the end (delta: 415.2 MB). Free memory was 282.7 MB in the beginning and 552.1 MB in the end (delta: -269.4 MB). Peak memory consumption was 146.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:59:58,647 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.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 525.54 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 232.2 MB in the beginning and 321.5 MB in the end (delta: -89.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 77.97 ms. Allocated memory is still 364.9 MB. Free memory was 321.0 MB in the beginning and 318.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.67 ms. Allocated memory is still 364.9 MB. Free memory was 318.4 MB in the beginning and 315.2 MB in the end (delta: 3.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2972.10 ms. Allocated memory was 364.9 MB in the beginning and 450.9 MB in the end (delta: 86.0 MB). Free memory was 315.2 MB in the beginning and 282.7 MB in the end (delta: 32.5 MB). Peak memory consumption was 120.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 90226.05 ms. Allocated memory was 450.9 MB in the beginning and 866.1 MB in the end (delta: 415.2 MB). Free memory was 282.7 MB in the beginning and 552.1 MB in the end (delta: -269.4 MB). Peak memory consumption was 146.8 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6198.3ms, 104 PlacesBefore, 49 PlacesAfterwards, 96 TransitionsBefore, 40 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 5 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 3300 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1412, positive: 1324, positive conditional: 0, positive unconditional: 1324, negative: 88, negative conditional: 0, negative unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1047, positive: 1005, positive conditional: 0, positive unconditional: 1005, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1047, positive: 1005, positive conditional: 0, positive unconditional: 1005, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1047, positive: 1000, positive conditional: 0, positive unconditional: 1000, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 938, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 927, negative conditional: 0, negative unconditional: 927, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1412, positive: 319, positive conditional: 0, positive unconditional: 319, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 1047, unknown conditional: 0, unknown unconditional: 1047] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4484.8ms, 46 PlacesBefore, 36 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1585 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 298, positive: 205, positive conditional: 0, positive unconditional: 205, negative: 93, negative conditional: 0, negative unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 53, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 53, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 53, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 298, positive: 158, positive conditional: 0, positive unconditional: 158, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 53, unknown conditional: 0, unknown unconditional: 53] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1321.0ms, 39 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 22 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 909 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 171, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, positive: 103, positive conditional: 0, positive unconditional: 103, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.1ms, 35 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 495 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1ms, 33 PlacesBefore, 33 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 200 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3272.3ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 163 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 39, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 61, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3056.8ms, 44 PlacesBefore, 44 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 124, positive: 110, positive conditional: 0, positive unconditional: 110, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 124, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 114.7ms, 51 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 93 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 85, Positive conditional cache size: 0, Positive unconditional cache size: 85, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.0ms, 50 PlacesBefore, 49 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.0ms, 50 PlacesBefore, 50 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 203 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 81, positive conditional: 0, positive unconditional: 81, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6920.5ms, 54 PlacesBefore, 54 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 606 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 328, positive: 300, positive conditional: 0, positive unconditional: 300, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 328, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12182.9ms, 61 PlacesBefore, 61 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1046 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 651, positive: 609, positive conditional: 0, positive unconditional: 609, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 651, positive: 601, positive conditional: 0, positive unconditional: 601, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 130, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4824.9ms, 63 PlacesBefore, 63 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 958 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 471, positive: 433, positive conditional: 0, positive unconditional: 433, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 471, positive: 430, positive conditional: 0, positive unconditional: 430, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 133.0ms, 64 PlacesBefore, 64 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 504 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 647 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 260, positive: 237, positive conditional: 0, positive unconditional: 237, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 260, positive: 237, positive conditional: 0, positive unconditional: 237, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 133, Positive cache size: 109, Positive conditional cache size: 0, Positive unconditional cache size: 109, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1321.4ms, 70 PlacesBefore, 70 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 678 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 841.9ms, 75 PlacesBefore, 75 PlacesAfterwards, 82 TransitionsBefore, 80 TransitionsAfterwards, 764 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 96, positive conditional: 0, positive unconditional: 96, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 94, positive conditional: 0, positive unconditional: 94, 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): 91, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10822.3ms, 72 PlacesBefore, 68 PlacesAfterwards, 74 TransitionsBefore, 71 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 43, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6077.4ms, 69 PlacesBefore, 65 PlacesAfterwards, 70 TransitionsBefore, 69 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, positive: 26, positive conditional: 0, positive unconditional: 26, 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): 73, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.8ms, 69 PlacesBefore, 67 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.3ms, 74 PlacesBefore, 70 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 266 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.1ms, 70 PlacesBefore, 70 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2637.2ms, 72 PlacesBefore, 62 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.8ms, 62 PlacesBefore, 59 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1192.1ms, 57 PlacesBefore, 54 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1 MoverChecksTotal, Independence Relation Statistics: 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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 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): 73, Positive cache size: 70, Positive conditional cache size: 0, Positive unconditional cache size: 70, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10593.9ms, 55 PlacesBefore, 54 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 8 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.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: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.2ms, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 102 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2336; [L855] FCALL, FORK 0 pthread_create(&t2336, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2337; [L857] FCALL, FORK 0 pthread_create(&t2337, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2338; [L859] FCALL, FORK 0 pthread_create(&t2338, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L744] 1 y = 1 [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=59, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 89938.0ms, OverallIterations: 26, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 8078.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6305.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 140 SDtfs, 77 SDslu, 69 SDs, 0 SdLazy, 1733 SolverSat, 412 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3538.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2935.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1117occurred in iteration=13, InterpolantAutomatonStates: 143, 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: 129.7ms SsaConstructionTime, 1051.7ms SatisfiabilityAnalysisTime, 3721.2ms InterpolantComputationTime, 404 NumberOfCodeBlocks, 404 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 3436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...