/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:13:34,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:13:34,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:13:34,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:13:34,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:13:34,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:13:34,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:13:34,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:13:34,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:13:34,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:13:34,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:13:34,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:13:34,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:13:34,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:13:34,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:13:34,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:13:34,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:13:34,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:13:34,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:13:34,607 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:13:34,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:13:34,609 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:13:34,609 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:13:34,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:13:34,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:13:34,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:13:34,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:13:34,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:13:34,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:13:34,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:13:34,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:13:34,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:13:34,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:13:34,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:13:34,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:13:34,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:13:34,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:13:34,616 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:13:34,616 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:13:34,617 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:13:34,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:13:34,617 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:13:34,631 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:13:34,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:13:34,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:13:34,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:13:34,632 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:13:34,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:13:34,632 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:13:34,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:13:34,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:13:34,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:13:34,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:13:34,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:13:34,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:13:34,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:13:34,634 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:13:34,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:13:34,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:13:34,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:13:34,875 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:13:34,875 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:13:34,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2021-03-26 00:13:34,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb0adddf/7ab3c140ce4b417da4e54fef18bf5092/FLAG3014cd8de [2021-03-26 00:13:35,361 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:13:35,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_pso.opt.i [2021-03-26 00:13:35,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb0adddf/7ab3c140ce4b417da4e54fef18bf5092/FLAG3014cd8de [2021-03-26 00:13:35,381 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecb0adddf/7ab3c140ce4b417da4e54fef18bf5092 [2021-03-26 00:13:35,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:13:35,383 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:13:35,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:13:35,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:13:35,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:13:35,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2443ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35, skipping insertion in model container [2021-03-26 00:13:35,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:13:35,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:13:35,549 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/mix030_pso.opt.i[948,961] [2021-03-26 00:13:35,678 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:13:35,684 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:13:35,691 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/mix030_pso.opt.i[948,961] [2021-03-26 00:13:35,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:13:35,779 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:13:35,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35 WrapperNode [2021-03-26 00:13:35,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:13:35,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:13:35,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:13:35,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:13:35,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:13:35,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:13:35,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:13:35,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:13:35,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... [2021-03-26 00:13:35,893 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:13:35,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:13:35,894 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:13:35,894 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:13:35,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:13:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:13:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:13:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:13:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:13:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:13:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:13:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:13:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:13:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:13:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:13:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:13:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:13:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:13:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:13:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:13:35,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:13:35,998 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:13:37,242 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:13:37,242 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:13:37,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:13:37 BoogieIcfgContainer [2021-03-26 00:13:37,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:13:37,246 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:13:37,246 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:13:37,248 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:13:37,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:13:35" (1/3) ... [2021-03-26 00:13:37,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f183142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:13:37, skipping insertion in model container [2021-03-26 00:13:37,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:35" (2/3) ... [2021-03-26 00:13:37,250 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f183142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:13:37, skipping insertion in model container [2021-03-26 00:13:37,250 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:13:37" (3/3) ... [2021-03-26 00:13:37,251 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2021-03-26 00:13:37,256 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:13:37,260 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:13:37,260 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:13:37,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,289 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,289 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,290 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,291 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,292 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,293 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,296 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,297 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,301 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,301 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,302 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,304 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,305 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,305 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,306 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,306 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:37,308 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:13:37,321 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:13:37,335 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:13:37,335 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:13:37,335 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:13:37,335 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:13:37,335 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:13:37,335 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:13:37,335 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:13:37,335 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:13:37,343 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2021-03-26 00:13:37,370 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 00:13:37,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:37,373 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:13:37,373 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 115 transitions, 250 flow [2021-03-26 00:13:37,376 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 111 transitions, 234 flow [2021-03-26 00:13:37,377 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:37,385 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-26 00:13:37,388 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 234 flow [2021-03-26 00:13:37,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 234 flow [2021-03-26 00:13:37,402 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2021-03-26 00:13:37,402 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:37,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:13:37,405 INFO L142 LiptonReduction]: Number of co-enabled transitions 2630 [2021-03-26 00:13:39,409 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-26 00:13:39,670 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:13:40,946 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-03-26 00:13:41,504 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 00:13:41,814 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:13:42,179 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:13:42,290 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:13:43,343 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:13:43,608 WARN L205 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:13:44,181 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:13:44,732 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:13:45,381 INFO L154 LiptonReduction]: Checked pairs total: 5123 [2021-03-26 00:13:45,381 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 00:13:45,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8009 [2021-03-26 00:13:45,408 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 00:13:45,408 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:45,408 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:45,409 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:45,409 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:45,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1005604732, now seen corresponding path program 1 times [2021-03-26 00:13:45,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:45,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807903401] [2021-03-26 00:13:45,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:45,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:45,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:45,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:45,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:45,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807903401] [2021-03-26 00:13:45,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:45,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:45,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796818382] [2021-03-26 00:13:45,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:13:45,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:45,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:13:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:13:45,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 190 [2021-03-26 00:13:45,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:45,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:45,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 190 [2021-03-26 00:13:45,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:45,785 INFO L129 PetriNetUnfolder]: 69/214 cut-off events. [2021-03-26 00:13:45,786 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:45,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 214 events. 69/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1046 event pairs, 39 based on Foata normal form. 10/202 useless extension candidates. Maximal degree in co-relation 327. Up to 89 conditions per place. [2021-03-26 00:13:45,788 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 9 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2021-03-26 00:13:45,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 130 flow [2021-03-26 00:13:45,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:45,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2021-03-26 00:13:45,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9070175438596492 [2021-03-26 00:13:45,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 517 transitions. [2021-03-26 00:13:45,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 517 transitions. [2021-03-26 00:13:45,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:45,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 517 transitions. [2021-03-26 00:13:45,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:45,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:45,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:45,822 INFO L185 Difference]: Start difference. First operand has 56 places, 44 transitions, 100 flow. Second operand 3 states and 517 transitions. [2021-03-26 00:13:45,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 130 flow [2021-03-26 00:13:45,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:13:45,826 INFO L241 Difference]: Finished difference. Result has 52 places, 36 transitions, 84 flow [2021-03-26 00:13:45,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2021-03-26 00:13:45,828 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -4 predicate places. [2021-03-26 00:13:45,828 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:45,829 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 36 transitions, 84 flow [2021-03-26 00:13:45,831 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 36 transitions, 84 flow [2021-03-26 00:13:45,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 36 transitions, 84 flow [2021-03-26 00:13:45,836 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-26 00:13:45,837 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:45,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 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-26 00:13:45,841 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 00:13:46,319 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-26 00:13:46,688 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 00:13:47,042 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 00:13:47,616 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:13:48,243 WARN L205 SmtUtils]: Spent 614.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 00:13:48,940 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 00:13:49,194 INFO L154 LiptonReduction]: Checked pairs total: 2040 [2021-03-26 00:13:49,194 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 00:13:49,194 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3366 [2021-03-26 00:13:49,195 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-26 00:13:49,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:49,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:49,196 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:49,196 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:13:49,196 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:49,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash -614472852, now seen corresponding path program 1 times [2021-03-26 00:13:49,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:49,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610769602] [2021-03-26 00:13:49,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:49,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:49,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:49,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:49,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:49,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610769602] [2021-03-26 00:13:49,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:49,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:49,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242466565] [2021-03-26 00:13:49,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:49,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:49,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:49,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:49,364 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 00:13:49,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:49,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:49,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 00:13:49,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:49,374 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-03-26 00:13:49,375 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:49,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:13:49,375 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 1 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2021-03-26 00:13:49,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 29 transitions, 76 flow [2021-03-26 00:13:49,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-03-26 00:13:49,389 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8798646362098139 [2021-03-26 00:13:49,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-03-26 00:13:49,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-03-26 00:13:49,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:49,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-03-26 00:13:49,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:49,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:49,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:49,391 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 520 transitions. [2021-03-26 00:13:49,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 29 transitions, 76 flow [2021-03-26 00:13:49,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 72 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:13:49,392 INFO L241 Difference]: Finished difference. Result has 41 places, 28 transitions, 72 flow [2021-03-26 00:13:49,392 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2021-03-26 00:13:49,393 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -15 predicate places. [2021-03-26 00:13:49,393 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:49,393 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-26 00:13:49,393 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 28 transitions, 72 flow [2021-03-26 00:13:49,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-26 00:13:49,396 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 00:13:49,396 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:49,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 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/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 00:13:49,396 INFO L142 LiptonReduction]: Number of co-enabled transitions 366 [2021-03-26 00:13:49,962 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:13:50,107 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:13:50,419 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 00:13:50,561 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 00:13:50,698 INFO L154 LiptonReduction]: Checked pairs total: 896 [2021-03-26 00:13:50,698 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:13:50,698 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1305 [2021-03-26 00:13:50,699 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-03-26 00:13:50,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:50,699 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:50,699 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:50,700 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:13:50,700 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:50,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:50,700 INFO L82 PathProgramCache]: Analyzing trace with hash -355359768, now seen corresponding path program 1 times [2021-03-26 00:13:50,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:50,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952280687] [2021-03-26 00:13:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:50,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:50,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:50,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:50,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:13:50,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:50,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:50,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952280687] [2021-03-26 00:13:50,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:50,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:50,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835464840] [2021-03-26 00:13:50,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:50,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:50,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:50,848 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 198 [2021-03-26 00:13:50,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:50,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:50,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 198 [2021-03-26 00:13:50,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:50,902 INFO L129 PetriNetUnfolder]: 77/167 cut-off events. [2021-03-26 00:13:50,903 INFO L130 PetriNetUnfolder]: For 6/13 co-relation queries the response was YES. [2021-03-26 00:13:50,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 167 events. 77/167 cut-off events. For 6/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 694 event pairs, 52 based on Foata normal form. 6/163 useless extension candidates. Maximal degree in co-relation 317. Up to 120 conditions per place. [2021-03-26 00:13:50,904 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 10 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2021-03-26 00:13:50,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 118 flow [2021-03-26 00:13:50,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 634 transitions. [2021-03-26 00:13:50,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8005050505050505 [2021-03-26 00:13:50,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 634 transitions. [2021-03-26 00:13:50,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 634 transitions. [2021-03-26 00:13:50,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:50,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 634 transitions. [2021-03-26 00:13:50,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.5) internal successors, (634), 4 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:50,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:50,909 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:50,909 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 4 states and 634 transitions. [2021-03-26 00:13:50,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 118 flow [2021-03-26 00:13:50,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:13:50,910 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 107 flow [2021-03-26 00:13:50,910 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-26 00:13:50,910 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -14 predicate places. [2021-03-26 00:13:50,910 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:50,910 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 107 flow [2021-03-26 00:13:50,911 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 107 flow [2021-03-26 00:13:50,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 107 flow [2021-03-26 00:13:50,918 INFO L129 PetriNetUnfolder]: 14/68 cut-off events. [2021-03-26 00:13:50,918 INFO L130 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2021-03-26 00:13:50,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 68 events. 14/68 cut-off events. For 31/34 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 227 event pairs, 8 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 133. Up to 27 conditions per place. [2021-03-26 00:13:50,919 INFO L142 LiptonReduction]: Number of co-enabled transitions 464 [2021-03-26 00:13:51,066 INFO L154 LiptonReduction]: Checked pairs total: 412 [2021-03-26 00:13:51,067 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:51,067 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 157 [2021-03-26 00:13:51,068 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 107 flow [2021-03-26 00:13:51,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.0) internal successors, (620), 4 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,068 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:51,068 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:51,068 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:13:51,068 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1905807429, now seen corresponding path program 1 times [2021-03-26 00:13:51,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:51,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687243409] [2021-03-26 00:13:51,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:51,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:51,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:51,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:51,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:13:51,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:51,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:51,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687243409] [2021-03-26 00:13:51,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:51,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:51,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811259399] [2021-03-26 00:13:51,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:51,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:51,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:51,128 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198 [2021-03-26 00:13:51,128 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,128 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:51,128 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198 [2021-03-26 00:13:51,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:51,198 INFO L129 PetriNetUnfolder]: 77/182 cut-off events. [2021-03-26 00:13:51,198 INFO L130 PetriNetUnfolder]: For 105/158 co-relation queries the response was YES. [2021-03-26 00:13:51,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 182 events. 77/182 cut-off events. For 105/158 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 808 event pairs, 9 based on Foata normal form. 9/182 useless extension candidates. Maximal degree in co-relation 454. Up to 103 conditions per place. [2021-03-26 00:13:51,202 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 14 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2021-03-26 00:13:51,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 177 flow [2021-03-26 00:13:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:51,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2021-03-26 00:13:51,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2021-03-26 00:13:51,204 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2021-03-26 00:13:51,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2021-03-26 00:13:51,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:51,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2021-03-26 00:13:51,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 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-26 00:13:51,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,207 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,207 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 107 flow. Second operand 4 states and 638 transitions. [2021-03-26 00:13:51,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 177 flow [2021-03-26 00:13:51,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 177 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 00:13:51,209 INFO L241 Difference]: Finished difference. Result has 46 places, 35 transitions, 141 flow [2021-03-26 00:13:51,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2021-03-26 00:13:51,209 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -10 predicate places. [2021-03-26 00:13:51,209 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:51,209 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 35 transitions, 141 flow [2021-03-26 00:13:51,209 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 35 transitions, 141 flow [2021-03-26 00:13:51,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 141 flow [2021-03-26 00:13:51,220 INFO L129 PetriNetUnfolder]: 28/100 cut-off events. [2021-03-26 00:13:51,220 INFO L130 PetriNetUnfolder]: For 103/117 co-relation queries the response was YES. [2021-03-26 00:13:51,220 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 100 events. 28/100 cut-off events. For 103/117 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 403 event pairs, 9 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 245. Up to 40 conditions per place. [2021-03-26 00:13:51,221 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-26 00:13:51,329 INFO L154 LiptonReduction]: Checked pairs total: 403 [2021-03-26 00:13:51,329 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:51,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 120 [2021-03-26 00:13:51,330 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 141 flow [2021-03-26 00:13:51,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,330 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:51,330 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:51,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:13:51,330 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:51,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1844561142, now seen corresponding path program 1 times [2021-03-26 00:13:51,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:51,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443831680] [2021-03-26 00:13:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:51,409 INFO L142 QuantifierPusher]: treesize reduction 14, result has 36.4 percent of original size [2021-03-26 00:13:51,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 00:13:51,414 INFO L142 QuantifierPusher]: treesize reduction 15, result has 42.3 percent of original size [2021-03-26 00:13:51,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:13:51,422 INFO L142 QuantifierPusher]: treesize reduction 10, result has 69.7 percent of original size [2021-03-26 00:13:51,422 INFO L147 QuantifierPusher]: treesize reduction 5, result has 78.3 percent of original size 18 [2021-03-26 00:13:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:51,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443831680] [2021-03-26 00:13:51,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:51,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:51,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107184412] [2021-03-26 00:13:51,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:51,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:51,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:51,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:51,443 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 198 [2021-03-26 00:13:51,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:51,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 198 [2021-03-26 00:13:51,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:51,502 INFO L129 PetriNetUnfolder]: 75/168 cut-off events. [2021-03-26 00:13:51,502 INFO L130 PetriNetUnfolder]: For 211/288 co-relation queries the response was YES. [2021-03-26 00:13:51,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 168 events. 75/168 cut-off events. For 211/288 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 692 event pairs, 27 based on Foata normal form. 15/174 useless extension candidates. Maximal degree in co-relation 515. Up to 102 conditions per place. [2021-03-26 00:13:51,503 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 14 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2021-03-26 00:13:51,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 220 flow [2021-03-26 00:13:51,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2021-03-26 00:13:51,506 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8295454545454546 [2021-03-26 00:13:51,506 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2021-03-26 00:13:51,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2021-03-26 00:13:51,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:51,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2021-03-26 00:13:51,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,508 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:51,508 INFO L185 Difference]: Start difference. First operand has 46 places, 35 transitions, 141 flow. Second operand 4 states and 657 transitions. [2021-03-26 00:13:51,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 220 flow [2021-03-26 00:13:51,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 207 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:51,511 INFO L241 Difference]: Finished difference. Result has 50 places, 39 transitions, 188 flow [2021-03-26 00:13:51,512 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2021-03-26 00:13:51,512 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2021-03-26 00:13:51,512 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:51,512 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 39 transitions, 188 flow [2021-03-26 00:13:51,512 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 39 transitions, 188 flow [2021-03-26 00:13:51,512 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 39 transitions, 188 flow [2021-03-26 00:13:51,525 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1081] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse17 (= (mod v_~y$r_buff1_thd0~0_326 256) 0)) (.cse18 (= (mod v_~y$w_buff1_used~0_536 256) 0)) (.cse9 (= 0 (mod v_~y$r_buff0_thd0~0_379 256)))) (let ((.cse10 (not .cse9)) (.cse0 (= (mod v_~weak$$choice2~0_127 256) 0)) (.cse15 (and .cse9 .cse18)) (.cse16 (and .cse9 .cse17)) (.cse19 (= (mod v_~y$w_buff0_used~0_651 256) 0))) (let ((.cse4 (or .cse15 .cse16 .cse19)) (.cse2 (not .cse19)) (.cse6 (not .cse0)) (.cse1 (or .cse10 (not .cse18))) (.cse3 (or (not .cse17) .cse10))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse5 (= |v_ULTIMATE.start_main_#t~ite40_201| |v_ULTIMATE.start_main_#t~ite40_200|))) (or (and .cse0 (or (and .cse1 (= |v_ULTIMATE.start_main_#t~ite40_201| |v_ULTIMATE.start_main_#t~ite41_193|) .cse2 (= v_~y$w_buff1~0_270 |v_ULTIMATE.start_main_#t~ite40_201|) .cse3) (and .cse4 .cse5 (= v_~y$w_buff1~0_270 |v_ULTIMATE.start_main_#t~ite41_193|))) (= v_~y$w_buff1~0_269 |v_ULTIMATE.start_main_#t~ite41_193|)) (and .cse6 (= v_~y$w_buff1~0_269 v_~y$w_buff1~0_270) .cse5 (= |v_ULTIMATE.start_main_#t~ite41_193| |v_ULTIMATE.start_main_#t~ite41_192|)))) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite37_181| |v_ULTIMATE.start_main_#t~ite37_180|))) (or (and (or (and (= |v_ULTIMATE.start_main_#t~ite37_181| |v_ULTIMATE.start_main_#t~ite38_177|) (= |v_ULTIMATE.start_main_#t~ite37_181| v_~y$w_buff0~0_269) .cse1 .cse2 .cse3) (and .cse7 .cse4 (= |v_ULTIMATE.start_main_#t~ite38_177| v_~y$w_buff0~0_269))) (= |v_ULTIMATE.start_main_#t~ite38_177| v_~y$w_buff0~0_268) .cse0) (and (= |v_ULTIMATE.start_main_#t~ite38_177| |v_ULTIMATE.start_main_#t~ite38_176|) .cse6 .cse7 (= v_~y$w_buff0~0_269 v_~y$w_buff0~0_268)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite52_201| |v_ULTIMATE.start_main_#t~ite52_200|))) (or (and (= v_~y$r_buff1_thd0~0_326 v_~y$r_buff1_thd0~0_325) .cse6 .cse8 (= |v_ULTIMATE.start_main_#t~ite53_191| |v_ULTIMATE.start_main_#t~ite53_190|)) (and (= v_~y$r_buff1_thd0~0_325 |v_ULTIMATE.start_main_#t~ite53_191|) .cse8 (= v_~y$r_buff1_thd0~0_326 |v_ULTIMATE.start_main_#t~ite53_191|) .cse0))) (or (and .cse4 (= v_~y~0_403 v_~y~0_402) (= |v_ULTIMATE.start_main_#t~ite35_173| |v_ULTIMATE.start_main_#t~ite35_172|)) (and .cse1 (or (and (= v_~y$w_buff1~0_270 |v_ULTIMATE.start_main_#t~ite35_173|) .cse9) (and .cse10 (= |v_ULTIMATE.start_main_#t~ite35_173| v_~y$w_buff0~0_269))) (= v_~y~0_403 |v_ULTIMATE.start_main_#t~ite35_173|) .cse2 .cse3)) (= (mod v_~main$tmp_guard1~0_75 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_81) (= 2 v_~__unbuffered_p3_EAX~0_79) (= v_~y~0_403 2) (= v_~x~0_86 2) (= v_~z~0_93 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_75) (or (and (= v_~y~0_403 v_~y~0_401) .cse0) (and .cse6 (= v_~y~0_401 v_~y$mem_tmp~0_79))) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite49_191| |v_ULTIMATE.start_main_#t~ite49_190|))) (or (and (= v_~y$r_buff0_thd0~0_379 |v_ULTIMATE.start_main_#t~ite50_185|) .cse11 .cse0 (= v_~y$r_buff0_thd0~0_378 |v_ULTIMATE.start_main_#t~ite50_185|)) (and .cse6 .cse11 (= v_~y$r_buff0_thd0~0_379 v_~y$r_buff0_thd0~0_378) (= |v_ULTIMATE.start_main_#t~ite50_185| |v_ULTIMATE.start_main_#t~ite50_184|)))) (= v_~y~0_402 v_~y$mem_tmp~0_79) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite43_197| |v_ULTIMATE.start_main_#t~ite43_196|))) (or (and .cse6 (= |v_ULTIMATE.start_main_#t~ite44_191| |v_ULTIMATE.start_main_#t~ite44_190|) .cse12 (= v_~y$w_buff0_used~0_651 v_~y$w_buff0_used~0_650)) (and (or (and .cse4 (= v_~y$w_buff0_used~0_651 |v_ULTIMATE.start_main_#t~ite44_191|) .cse12) (and .cse1 (= |v_ULTIMATE.start_main_#t~ite43_197| |v_ULTIMATE.start_main_#t~ite44_191|) .cse2 (or (and .cse10 (= |v_ULTIMATE.start_main_#t~ite43_197| 0)) (and (= v_~y$w_buff0_used~0_651 |v_ULTIMATE.start_main_#t~ite43_197|) .cse9)) .cse3)) .cse0 (= v_~y$w_buff0_used~0_650 |v_ULTIMATE.start_main_#t~ite44_191|)))) (= v_~weak$$choice2~0_127 |v_ULTIMATE.start_main_#t~nondet34_119|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite46_205| |v_ULTIMATE.start_main_#t~ite46_204|))) (or (and .cse6 (= |v_ULTIMATE.start_main_#t~ite47_199| |v_ULTIMATE.start_main_#t~ite47_198|) (= v_~y$w_buff1_used~0_536 v_~y$w_buff1_used~0_535) .cse13) (and (let ((.cse14 (= (mod v_~y$w_buff0_used~0_650 256) 0))) (or (and .cse1 (not .cse14) (= |v_ULTIMATE.start_main_#t~ite46_205| |v_ULTIMATE.start_main_#t~ite47_199|) (= |v_ULTIMATE.start_main_#t~ite46_205| 0) .cse3) (and (or .cse15 .cse14 .cse16) (= v_~y$w_buff1_used~0_536 |v_ULTIMATE.start_main_#t~ite47_199|) .cse13))) (= v_~y$w_buff1_used~0_535 |v_ULTIMATE.start_main_#t~ite47_199|) .cse0))) (= v_~weak$$choice0~0_60 |v_ULTIMATE.start_main_#t~nondet33_113|) (= v_~y$flush_delayed~0_107 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_651, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_119|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_113|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_198|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_204|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_190|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_196|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_190|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_184|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_200|, ~y$w_buff0~0=v_~y$w_buff0~0_269, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, ~y~0=v_~y~0_402, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_172|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_176|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_81, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_180|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_190|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_192|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_200|, ~y$w_buff1~0=v_~y$w_buff1~0_270, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_379, ~z~0=v_~z~0_93, ~x~0=v_~x~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_326, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_536} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_118|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_112|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_197|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_203|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_75, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_189|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_83|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_195|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_81|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_81|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_189|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_183|, ~y$mem_tmp~0=v_~y$mem_tmp~0_79, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_199|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_85|, ~y$w_buff0~0=v_~y$w_buff0~0_268, ~y$flush_delayed~0=v_~y$flush_delayed~0_107, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, ~y~0=v_~y~0_401, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_22|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_85|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_171|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_73|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_175|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_81, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_179|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_87|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_189|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_79|, ~weak$$choice0~0=v_~weak$$choice0~0_60, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_191|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_199|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_378, ~z~0=v_~z~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_127, ~x~0=v_~x~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_325, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_535} AuxVars[|v_ULTIMATE.start_main_#t~ite46_205|, |v_ULTIMATE.start_main_#t~ite53_191|, |v_ULTIMATE.start_main_#t~ite38_177|, |v_ULTIMATE.start_main_#t~ite41_193|, |v_ULTIMATE.start_main_#t~ite35_173|, |v_ULTIMATE.start_main_#t~ite52_201|, |v_ULTIMATE.start_main_#t~ite37_181|, |v_ULTIMATE.start_main_#t~ite50_185|, |v_ULTIMATE.start_main_#t~ite43_197|, |v_ULTIMATE.start_main_#t~ite44_191|, v_~y~0_403, |v_ULTIMATE.start_main_#t~ite40_201|, |v_ULTIMATE.start_main_#t~ite47_199|, |v_ULTIMATE.start_main_#t~ite49_191|] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet34, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][6], [P0Thread1of1ForFork2InUse, Black: 161#(= ~__unbuffered_p3_EAX~0 0), 70#L774true, 103#L827true, 39#L804true, 235#true, 172#true, 48#P0ENTRYtrue, Black: 238#(and (= ~y~0 1) (= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 174#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 0) (= ~y$r_buff0_thd0~0 0)), Black: 239#(and (= ~y$w_buff0~0 0) (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1) (= ~y~0 0)) (not (= 2 ~y$w_buff1~0))), Black: 175#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0) (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y$r_buff0_thd0~0 0)), Black: 210#(and (= ~y$r_buff1_thd0~0 0) (= ~y~0 1) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd0~0 0)), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork3InUse, P3Thread1of1ForFork1InUse]) [2021-03-26 00:13:51,526 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 00:13:51,526 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 00:13:51,526 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 00:13:51,526 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 00:13:51,526 INFO L129 PetriNetUnfolder]: 50/138 cut-off events. [2021-03-26 00:13:51,526 INFO L130 PetriNetUnfolder]: For 251/270 co-relation queries the response was YES. [2021-03-26 00:13:51,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 138 events. 50/138 cut-off events. For 251/270 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 634 event pairs, 14 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 407. Up to 65 conditions per place. [2021-03-26 00:13:51,527 INFO L142 LiptonReduction]: Number of co-enabled transitions 552 [2021-03-26 00:13:51,735 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:13:52,079 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 00:13:52,188 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 00:13:52,195 INFO L154 LiptonReduction]: Checked pairs total: 924 [2021-03-26 00:13:52,195 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:13:52,195 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 683 [2021-03-26 00:13:52,196 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 192 flow [2021-03-26 00:13:52,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,196 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:52,196 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:52,197 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:13:52,197 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:52,197 INFO L82 PathProgramCache]: Analyzing trace with hash -593200751, now seen corresponding path program 1 times [2021-03-26 00:13:52,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:52,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302401508] [2021-03-26 00:13:52,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:52,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:52,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:52,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:52,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:13:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:52,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302401508] [2021-03-26 00:13:52,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:52,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:13:52,254 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261325858] [2021-03-26 00:13:52,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:13:52,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:52,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:13:52,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:13:52,255 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 199 [2021-03-26 00:13:52,256 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 192 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-26 00:13:52,256 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:52,256 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 199 [2021-03-26 00:13:52,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:52,339 INFO L129 PetriNetUnfolder]: 84/195 cut-off events. [2021-03-26 00:13:52,339 INFO L130 PetriNetUnfolder]: For 364/532 co-relation queries the response was YES. [2021-03-26 00:13:52,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 195 events. 84/195 cut-off events. For 364/532 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 853 event pairs, 7 based on Foata normal form. 35/218 useless extension candidates. Maximal degree in co-relation 645. Up to 92 conditions per place. [2021-03-26 00:13:52,341 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 13 selfloop transitions, 18 changer transitions 0/50 dead transitions. [2021-03-26 00:13:52,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 50 transitions, 304 flow [2021-03-26 00:13:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:13:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:13:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 975 transitions. [2021-03-26 00:13:52,343 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8165829145728644 [2021-03-26 00:13:52,343 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 975 transitions. [2021-03-26 00:13:52,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 975 transitions. [2021-03-26 00:13:52,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:52,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 975 transitions. [2021-03-26 00:13:52,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.5) internal successors, (975), 6 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,346 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,346 INFO L185 Difference]: Start difference. First operand has 50 places, 39 transitions, 192 flow. Second operand 6 states and 975 transitions. [2021-03-26 00:13:52,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 50 transitions, 304 flow [2021-03-26 00:13:52,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 293 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:52,348 INFO L241 Difference]: Finished difference. Result has 56 places, 46 transitions, 281 flow [2021-03-26 00:13:52,348 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2021-03-26 00:13:52,348 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2021-03-26 00:13:52,348 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:52,348 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 46 transitions, 281 flow [2021-03-26 00:13:52,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 46 transitions, 281 flow [2021-03-26 00:13:52,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 46 transitions, 281 flow [2021-03-26 00:13:52,364 INFO L129 PetriNetUnfolder]: 62/167 cut-off events. [2021-03-26 00:13:52,364 INFO L130 PetriNetUnfolder]: For 428/532 co-relation queries the response was YES. [2021-03-26 00:13:52,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 167 events. 62/167 cut-off events. For 428/532 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 764 event pairs, 16 based on Foata normal form. 2/161 useless extension candidates. Maximal degree in co-relation 584. Up to 63 conditions per place. [2021-03-26 00:13:52,366 INFO L142 LiptonReduction]: Number of co-enabled transitions 668 [2021-03-26 00:13:52,397 INFO L154 LiptonReduction]: Checked pairs total: 589 [2021-03-26 00:13:52,397 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:52,397 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 00:13:52,398 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 281 flow [2021-03-26 00:13:52,398 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-26 00:13:52,398 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:52,398 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:52,398 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:13:52,398 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:52,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:52,399 INFO L82 PathProgramCache]: Analyzing trace with hash -607856229, now seen corresponding path program 1 times [2021-03-26 00:13:52,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:52,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255143782] [2021-03-26 00:13:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:52,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:52,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255143782] [2021-03-26 00:13:52,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:52,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:13:52,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554591365] [2021-03-26 00:13:52,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:13:52,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:13:52,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:13:52,431 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 199 [2021-03-26 00:13:52,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:52,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 199 [2021-03-26 00:13:52,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:52,467 INFO L129 PetriNetUnfolder]: 147/327 cut-off events. [2021-03-26 00:13:52,468 INFO L130 PetriNetUnfolder]: For 1169/1412 co-relation queries the response was YES. [2021-03-26 00:13:52,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 327 events. 147/327 cut-off events. For 1169/1412 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1747 event pairs, 38 based on Foata normal form. 10/302 useless extension candidates. Maximal degree in co-relation 1208. Up to 133 conditions per place. [2021-03-26 00:13:52,470 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 3 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2021-03-26 00:13:52,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 48 transitions, 297 flow [2021-03-26 00:13:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2021-03-26 00:13:52,472 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8860971524288107 [2021-03-26 00:13:52,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2021-03-26 00:13:52,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2021-03-26 00:13:52,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:52,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2021-03-26 00:13:52,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,474 INFO L185 Difference]: Start difference. First operand has 56 places, 46 transitions, 281 flow. Second operand 3 states and 529 transitions. [2021-03-26 00:13:52,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 48 transitions, 297 flow [2021-03-26 00:13:52,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 48 transitions, 272 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-26 00:13:52,476 INFO L241 Difference]: Finished difference. Result has 57 places, 48 transitions, 275 flow [2021-03-26 00:13:52,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=275, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2021-03-26 00:13:52,476 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 1 predicate places. [2021-03-26 00:13:52,477 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:52,477 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 48 transitions, 275 flow [2021-03-26 00:13:52,477 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 48 transitions, 275 flow [2021-03-26 00:13:52,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 275 flow [2021-03-26 00:13:52,507 INFO L129 PetriNetUnfolder]: 147/327 cut-off events. [2021-03-26 00:13:52,507 INFO L130 PetriNetUnfolder]: For 951/1116 co-relation queries the response was YES. [2021-03-26 00:13:52,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 327 events. 147/327 cut-off events. For 951/1116 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1737 event pairs, 30 based on Foata normal form. 2/295 useless extension candidates. Maximal degree in co-relation 1152. Up to 117 conditions per place. [2021-03-26 00:13:52,510 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-26 00:13:52,597 INFO L154 LiptonReduction]: Checked pairs total: 545 [2021-03-26 00:13:52,597 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:52,598 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 121 [2021-03-26 00:13:52,600 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 275 flow [2021-03-26 00:13:52,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,600 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:52,600 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:52,600 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:13:52,600 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1385530484, now seen corresponding path program 1 times [2021-03-26 00:13:52,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:52,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756445753] [2021-03-26 00:13:52,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:52,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:52,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:52,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:13:52,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:13:52,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:52,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:13:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:52,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756445753] [2021-03-26 00:13:52,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:52,714 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:13:52,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137339604] [2021-03-26 00:13:52,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:13:52,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:13:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:13:52,716 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 199 [2021-03-26 00:13:52,717 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 275 flow. Second operand has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,717 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:52,717 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 199 [2021-03-26 00:13:52,717 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:52,844 INFO L129 PetriNetUnfolder]: 196/397 cut-off events. [2021-03-26 00:13:52,844 INFO L130 PetriNetUnfolder]: For 1250/1989 co-relation queries the response was YES. [2021-03-26 00:13:52,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1685 conditions, 397 events. 196/397 cut-off events. For 1250/1989 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1988 event pairs, 31 based on Foata normal form. 31/390 useless extension candidates. Maximal degree in co-relation 1662. Up to 245 conditions per place. [2021-03-26 00:13:52,848 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 23 selfloop transitions, 14 changer transitions 0/58 dead transitions. [2021-03-26 00:13:52,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 416 flow [2021-03-26 00:13:52,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:13:52,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:13:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 781 transitions. [2021-03-26 00:13:52,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7849246231155779 [2021-03-26 00:13:52,851 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 781 transitions. [2021-03-26 00:13:52,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 781 transitions. [2021-03-26 00:13:52,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:52,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 781 transitions. [2021-03-26 00:13:52,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,854 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,854 INFO L185 Difference]: Start difference. First operand has 57 places, 48 transitions, 275 flow. Second operand 5 states and 781 transitions. [2021-03-26 00:13:52,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 416 flow [2021-03-26 00:13:52,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 58 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:52,857 INFO L241 Difference]: Finished difference. Result has 61 places, 54 transitions, 359 flow [2021-03-26 00:13:52,858 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2021-03-26 00:13:52,858 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2021-03-26 00:13:52,858 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:52,858 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 54 transitions, 359 flow [2021-03-26 00:13:52,858 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 54 transitions, 359 flow [2021-03-26 00:13:52,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 54 transitions, 359 flow [2021-03-26 00:13:52,887 INFO L129 PetriNetUnfolder]: 93/233 cut-off events. [2021-03-26 00:13:52,887 INFO L130 PetriNetUnfolder]: For 1114/1299 co-relation queries the response was YES. [2021-03-26 00:13:52,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 233 events. 93/233 cut-off events. For 1114/1299 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1144 event pairs, 25 based on Foata normal form. 5/216 useless extension candidates. Maximal degree in co-relation 918. Up to 91 conditions per place. [2021-03-26 00:13:52,891 INFO L142 LiptonReduction]: Number of co-enabled transitions 826 [2021-03-26 00:13:52,966 INFO L154 LiptonReduction]: Checked pairs total: 813 [2021-03-26 00:13:52,966 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:52,966 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-26 00:13:52,967 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 359 flow [2021-03-26 00:13:52,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.0) internal successors, (918), 6 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:52,967 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:52,967 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:52,967 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:13:52,967 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:52,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1937683332, now seen corresponding path program 2 times [2021-03-26 00:13:52,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:52,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655665025] [2021-03-26 00:13:52,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:53,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:53,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:53,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:53,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:13:53,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:53,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:13:53,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:53,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:13:53,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:53,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 00:13:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:53,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655665025] [2021-03-26 00:13:53,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:53,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:13:53,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51696960] [2021-03-26 00:13:53,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:13:53,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:13:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:13:53,115 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 199 [2021-03-26 00:13:53,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:53,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 199 [2021-03-26 00:13:53,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:53,284 INFO L129 PetriNetUnfolder]: 204/423 cut-off events. [2021-03-26 00:13:53,285 INFO L130 PetriNetUnfolder]: For 1777/2736 co-relation queries the response was YES. [2021-03-26 00:13:53,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2005 conditions, 423 events. 204/423 cut-off events. For 1777/2736 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2201 event pairs, 29 based on Foata normal form. 56/441 useless extension candidates. Maximal degree in co-relation 1980. Up to 253 conditions per place. [2021-03-26 00:13:53,289 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 23 selfloop transitions, 19 changer transitions 0/63 dead transitions. [2021-03-26 00:13:53,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 515 flow [2021-03-26 00:13:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:13:53,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:13:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 955 transitions. [2021-03-26 00:13:53,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7998324958123953 [2021-03-26 00:13:53,292 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 955 transitions. [2021-03-26 00:13:53,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 955 transitions. [2021-03-26 00:13:53,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:53,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 955 transitions. [2021-03-26 00:13:53,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 159.16666666666666) internal successors, (955), 6 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,296 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 199.0) internal successors, (1393), 7 states have internal predecessors, (1393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,296 INFO L185 Difference]: Start difference. First operand has 61 places, 54 transitions, 359 flow. Second operand 6 states and 955 transitions. [2021-03-26 00:13:53,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 515 flow [2021-03-26 00:13:53,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 484 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-26 00:13:53,300 INFO L241 Difference]: Finished difference. Result has 65 places, 60 transitions, 438 flow [2021-03-26 00:13:53,300 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2021-03-26 00:13:53,300 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 9 predicate places. [2021-03-26 00:13:53,300 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:53,300 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 60 transitions, 438 flow [2021-03-26 00:13:53,300 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 60 transitions, 438 flow [2021-03-26 00:13:53,301 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 60 transitions, 438 flow [2021-03-26 00:13:53,327 INFO L129 PetriNetUnfolder]: 96/241 cut-off events. [2021-03-26 00:13:53,327 INFO L130 PetriNetUnfolder]: For 1476/1677 co-relation queries the response was YES. [2021-03-26 00:13:53,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 241 events. 96/241 cut-off events. For 1476/1677 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1212 event pairs, 23 based on Foata normal form. 8/227 useless extension candidates. Maximal degree in co-relation 1042. Up to 92 conditions per place. [2021-03-26 00:13:53,330 INFO L142 LiptonReduction]: Number of co-enabled transitions 912 [2021-03-26 00:13:53,340 INFO L154 LiptonReduction]: Checked pairs total: 1161 [2021-03-26 00:13:53,340 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:53,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 00:13:53,341 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 438 flow [2021-03-26 00:13:53,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:53,342 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:53,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:13:53,342 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:53,342 INFO L82 PathProgramCache]: Analyzing trace with hash 266540394, now seen corresponding path program 3 times [2021-03-26 00:13:53,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:53,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173085109] [2021-03-26 00:13:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:53,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:53,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:13:53,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:53,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:13:53,431 INFO L142 QuantifierPusher]: treesize reduction 22, result has 51.1 percent of original size [2021-03-26 00:13:53,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 00:13:53,445 INFO L142 QuantifierPusher]: treesize reduction 30, result has 40.0 percent of original size [2021-03-26 00:13:53,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:13:53,458 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.3 percent of original size [2021-03-26 00:13:53,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-26 00:13:53,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:53,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173085109] [2021-03-26 00:13:53,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:53,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:13:53,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053810559] [2021-03-26 00:13:53,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:13:53,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:53,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:13:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:13:53,482 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2021-03-26 00:13:53,482 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 147.85714285714286) internal successors, (1035), 7 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:53,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2021-03-26 00:13:53,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:53,619 INFO L129 PetriNetUnfolder]: 206/435 cut-off events. [2021-03-26 00:13:53,620 INFO L130 PetriNetUnfolder]: For 2229/3227 co-relation queries the response was YES. [2021-03-26 00:13:53,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 435 events. 206/435 cut-off events. For 2229/3227 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2318 event pairs, 25 based on Foata normal form. 55/452 useless extension candidates. Maximal degree in co-relation 2189. Up to 255 conditions per place. [2021-03-26 00:13:53,624 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 26 selfloop transitions, 18 changer transitions 0/65 dead transitions. [2021-03-26 00:13:53,624 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 580 flow [2021-03-26 00:13:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:13:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:13:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2021-03-26 00:13:53,626 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7597989949748744 [2021-03-26 00:13:53,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 756 transitions. [2021-03-26 00:13:53,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 756 transitions. [2021-03-26 00:13:53,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:53,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 756 transitions. [2021-03-26 00:13:53,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,629 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,629 INFO L185 Difference]: Start difference. First operand has 65 places, 60 transitions, 438 flow. Second operand 5 states and 756 transitions. [2021-03-26 00:13:53,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 580 flow [2021-03-26 00:13:53,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 546 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-26 00:13:53,632 INFO L241 Difference]: Finished difference. Result has 67 places, 62 transitions, 481 flow [2021-03-26 00:13:53,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2021-03-26 00:13:53,633 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2021-03-26 00:13:53,633 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:53,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 62 transitions, 481 flow [2021-03-26 00:13:53,634 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 481 flow [2021-03-26 00:13:53,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 62 transitions, 481 flow [2021-03-26 00:13:53,658 INFO L129 PetriNetUnfolder]: 96/245 cut-off events. [2021-03-26 00:13:53,658 INFO L130 PetriNetUnfolder]: For 1917/2125 co-relation queries the response was YES. [2021-03-26 00:13:53,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 245 events. 96/245 cut-off events. For 1917/2125 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1244 event pairs, 23 based on Foata normal form. 9/232 useless extension candidates. Maximal degree in co-relation 1133. Up to 95 conditions per place. [2021-03-26 00:13:53,661 INFO L142 LiptonReduction]: Number of co-enabled transitions 938 [2021-03-26 00:13:53,670 INFO L154 LiptonReduction]: Checked pairs total: 1412 [2021-03-26 00:13:53,670 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:53,670 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-26 00:13:53,673 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 481 flow [2021-03-26 00:13:53,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 147.85714285714286) internal successors, (1035), 7 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:53,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:53,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:13:53,674 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:53,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1826566784, now seen corresponding path program 4 times [2021-03-26 00:13:53,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:53,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292375246] [2021-03-26 00:13:53,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:53,729 INFO L142 QuantifierPusher]: treesize reduction 18, result has 70.5 percent of original size [2021-03-26 00:13:53,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-26 00:13:53,752 INFO L142 QuantifierPusher]: treesize reduction 19, result has 70.8 percent of original size [2021-03-26 00:13:53,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 00:13:53,788 INFO L142 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size [2021-03-26 00:13:53,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:13:53,797 INFO L142 QuantifierPusher]: treesize reduction 4, result has 77.8 percent of original size [2021-03-26 00:13:53,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:13:53,806 INFO L142 QuantifierPusher]: treesize reduction 7, result has 61.1 percent of original size [2021-03-26 00:13:53,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:13:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:53,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292375246] [2021-03-26 00:13:53,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:53,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:13:53,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800231325] [2021-03-26 00:13:53,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:13:53,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:53,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:13:53,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:13:53,816 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 199 [2021-03-26 00:13:53,817 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 154.85714285714286) internal successors, (1084), 7 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:53,817 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:53,817 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 199 [2021-03-26 00:13:53,817 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:53,995 INFO L129 PetriNetUnfolder]: 203/432 cut-off events. [2021-03-26 00:13:53,995 INFO L130 PetriNetUnfolder]: For 2825/3890 co-relation queries the response was YES. [2021-03-26 00:13:53,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 432 events. 203/432 cut-off events. For 2825/3890 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2330 event pairs, 19 based on Foata normal form. 57/453 useless extension candidates. Maximal degree in co-relation 2278. Up to 197 conditions per place. [2021-03-26 00:13:54,000 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 21 selfloop transitions, 26 changer transitions 0/68 dead transitions. [2021-03-26 00:13:54,000 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 643 flow [2021-03-26 00:13:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:13:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:13:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 792 transitions. [2021-03-26 00:13:54,002 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7959798994974875 [2021-03-26 00:13:54,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 792 transitions. [2021-03-26 00:13:54,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 792 transitions. [2021-03-26 00:13:54,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:54,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 792 transitions. [2021-03-26 00:13:54,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.4) internal successors, (792), 5 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,005 INFO L185 Difference]: Start difference. First operand has 67 places, 62 transitions, 481 flow. Second operand 5 states and 792 transitions. [2021-03-26 00:13:54,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 643 flow [2021-03-26 00:13:54,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 612 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 00:13:54,011 INFO L241 Difference]: Finished difference. Result has 69 places, 64 transitions, 558 flow [2021-03-26 00:13:54,011 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=558, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2021-03-26 00:13:54,011 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2021-03-26 00:13:54,011 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:54,011 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 64 transitions, 558 flow [2021-03-26 00:13:54,011 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 64 transitions, 558 flow [2021-03-26 00:13:54,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 558 flow [2021-03-26 00:13:54,039 INFO L129 PetriNetUnfolder]: 101/252 cut-off events. [2021-03-26 00:13:54,039 INFO L130 PetriNetUnfolder]: For 2347/2630 co-relation queries the response was YES. [2021-03-26 00:13:54,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1316 conditions, 252 events. 101/252 cut-off events. For 2347/2630 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1259 event pairs, 27 based on Foata normal form. 9/238 useless extension candidates. Maximal degree in co-relation 1289. Up to 97 conditions per place. [2021-03-26 00:13:54,042 INFO L142 LiptonReduction]: Number of co-enabled transitions 960 [2021-03-26 00:13:54,053 INFO L154 LiptonReduction]: Checked pairs total: 1510 [2021-03-26 00:13:54,053 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:54,053 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 00:13:54,054 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 558 flow [2021-03-26 00:13:54,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 154.85714285714286) internal successors, (1084), 7 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,054 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:54,054 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:54,054 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:13:54,054 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1776669920, now seen corresponding path program 1 times [2021-03-26 00:13:54,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:54,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213671068] [2021-03-26 00:13:54,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:54,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:54,098 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:54,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:54,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:54,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213671068] [2021-03-26 00:13:54,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:54,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:54,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971888490] [2021-03-26 00:13:54,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:54,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:54,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:54,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:54,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2021-03-26 00:13:54,106 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:54,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2021-03-26 00:13:54,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:54,371 INFO L129 PetriNetUnfolder]: 639/1223 cut-off events. [2021-03-26 00:13:54,371 INFO L130 PetriNetUnfolder]: For 6911/7660 co-relation queries the response was YES. [2021-03-26 00:13:54,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5067 conditions, 1223 events. 639/1223 cut-off events. For 6911/7660 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 8395 event pairs, 208 based on Foata normal form. 180/1260 useless extension candidates. Maximal degree in co-relation 5038. Up to 586 conditions per place. [2021-03-26 00:13:54,399 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 14 selfloop transitions, 10 changer transitions 0/77 dead transitions. [2021-03-26 00:13:54,399 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 77 transitions, 632 flow [2021-03-26 00:13:54,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:13:54,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:13:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 832 transitions. [2021-03-26 00:13:54,401 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8361809045226131 [2021-03-26 00:13:54,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 832 transitions. [2021-03-26 00:13:54,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 832 transitions. [2021-03-26 00:13:54,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:54,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 832 transitions. [2021-03-26 00:13:54,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.4) internal successors, (832), 5 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,404 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,404 INFO L185 Difference]: Start difference. First operand has 69 places, 64 transitions, 558 flow. Second operand 5 states and 832 transitions. [2021-03-26 00:13:54,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 77 transitions, 632 flow [2021-03-26 00:13:54,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 582 flow, removed 10 selfloop flow, removed 3 redundant places. [2021-03-26 00:13:54,410 INFO L241 Difference]: Finished difference. Result has 73 places, 73 transitions, 599 flow [2021-03-26 00:13:54,410 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=599, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2021-03-26 00:13:54,410 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2021-03-26 00:13:54,410 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:54,410 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 73 transitions, 599 flow [2021-03-26 00:13:54,411 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 73 transitions, 599 flow [2021-03-26 00:13:54,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 73 transitions, 599 flow [2021-03-26 00:13:54,542 INFO L129 PetriNetUnfolder]: 536/990 cut-off events. [2021-03-26 00:13:54,542 INFO L130 PetriNetUnfolder]: For 3917/4453 co-relation queries the response was YES. [2021-03-26 00:13:54,546 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4037 conditions, 990 events. 536/990 cut-off events. For 3917/4453 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 6447 event pairs, 201 based on Foata normal form. 25/853 useless extension candidates. Maximal degree in co-relation 4007. Up to 590 conditions per place. [2021-03-26 00:13:54,555 INFO L142 LiptonReduction]: Number of co-enabled transitions 1302 [2021-03-26 00:13:54,577 INFO L154 LiptonReduction]: Checked pairs total: 897 [2021-03-26 00:13:54,577 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:54,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 167 [2021-03-26 00:13:54,579 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 599 flow [2021-03-26 00:13:54,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,579 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:54,579 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:54,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:13:54,579 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:54,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1873384142, now seen corresponding path program 1 times [2021-03-26 00:13:54,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:54,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172020131] [2021-03-26 00:13:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:54,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:54,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:54,623 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:54,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:54,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:54,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172020131] [2021-03-26 00:13:54,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:54,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:13:54,630 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803457271] [2021-03-26 00:13:54,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:54,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:54,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:54,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:54,631 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2021-03-26 00:13:54,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 599 flow. Second operand has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 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-26 00:13:54,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:54,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2021-03-26 00:13:54,632 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:54,762 INFO L129 PetriNetUnfolder]: 391/857 cut-off events. [2021-03-26 00:13:54,762 INFO L130 PetriNetUnfolder]: For 4421/6930 co-relation queries the response was YES. [2021-03-26 00:13:54,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 857 events. 391/857 cut-off events. For 4421/6930 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 5969 event pairs, 59 based on Foata normal form. 412/1182 useless extension candidates. Maximal degree in co-relation 3826. Up to 510 conditions per place. [2021-03-26 00:13:54,771 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 14 selfloop transitions, 19 changer transitions 0/83 dead transitions. [2021-03-26 00:13:54,771 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 83 transitions, 709 flow [2021-03-26 00:13:54,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:13:54,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:13:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1165 transitions. [2021-03-26 00:13:54,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.83632447954056 [2021-03-26 00:13:54,773 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1165 transitions. [2021-03-26 00:13:54,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1165 transitions. [2021-03-26 00:13:54,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:54,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1165 transitions. [2021-03-26 00:13:54,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.42857142857142) internal successors, (1165), 7 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,777 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,777 INFO L185 Difference]: Start difference. First operand has 73 places, 73 transitions, 599 flow. Second operand 7 states and 1165 transitions. [2021-03-26 00:13:54,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 83 transitions, 709 flow [2021-03-26 00:13:54,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 83 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:54,782 INFO L241 Difference]: Finished difference. Result has 81 places, 79 transitions, 712 flow [2021-03-26 00:13:54,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=712, PETRI_PLACES=81, PETRI_TRANSITIONS=79} [2021-03-26 00:13:54,783 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2021-03-26 00:13:54,783 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:54,783 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 79 transitions, 712 flow [2021-03-26 00:13:54,783 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 79 transitions, 712 flow [2021-03-26 00:13:54,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 79 transitions, 712 flow [2021-03-26 00:13:54,849 INFO L129 PetriNetUnfolder]: 355/741 cut-off events. [2021-03-26 00:13:54,849 INFO L130 PetriNetUnfolder]: For 4641/5764 co-relation queries the response was YES. [2021-03-26 00:13:54,853 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 741 events. 355/741 cut-off events. For 4641/5764 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 4988 event pairs, 63 based on Foata normal form. 39/677 useless extension candidates. Maximal degree in co-relation 3789. Up to 463 conditions per place. [2021-03-26 00:13:54,859 INFO L142 LiptonReduction]: Number of co-enabled transitions 1498 [2021-03-26 00:13:54,890 INFO L154 LiptonReduction]: Checked pairs total: 848 [2021-03-26 00:13:54,890 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:54,890 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 107 [2021-03-26 00:13:54,891 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 79 transitions, 712 flow [2021-03-26 00:13:54,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.8) internal successors, (814), 5 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-26 00:13:54,891 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:54,891 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:54,892 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:13:54,892 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash 102305301, now seen corresponding path program 1 times [2021-03-26 00:13:54,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:54,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829945457] [2021-03-26 00:13:54,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:54,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:54,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:54,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:54,946 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:54,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:54,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:54,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:54,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829945457] [2021-03-26 00:13:54,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:54,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:13:54,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976536027] [2021-03-26 00:13:54,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:13:54,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:13:54,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:13:54,955 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2021-03-26 00:13:54,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 79 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:54,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:54,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2021-03-26 00:13:54,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:55,072 INFO L129 PetriNetUnfolder]: 271/661 cut-off events. [2021-03-26 00:13:55,072 INFO L130 PetriNetUnfolder]: For 5631/11337 co-relation queries the response was YES. [2021-03-26 00:13:55,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 661 events. 271/661 cut-off events. For 5631/11337 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4724 event pairs, 12 based on Foata normal form. 561/1146 useless extension candidates. Maximal degree in co-relation 3601. Up to 471 conditions per place. [2021-03-26 00:13:55,078 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 7 selfloop transitions, 28 changer transitions 4/83 dead transitions. [2021-03-26 00:13:55,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 805 flow [2021-03-26 00:13:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:13:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:13:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1498 transitions. [2021-03-26 00:13:55,081 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8364042434394193 [2021-03-26 00:13:55,081 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1498 transitions. [2021-03-26 00:13:55,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1498 transitions. [2021-03-26 00:13:55,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:55,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1498 transitions. [2021-03-26 00:13:55,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 166.44444444444446) internal successors, (1498), 9 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,095 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 199.0) internal successors, (1990), 10 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,095 INFO L185 Difference]: Start difference. First operand has 81 places, 79 transitions, 712 flow. Second operand 9 states and 1498 transitions. [2021-03-26 00:13:55,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 83 transitions, 805 flow [2021-03-26 00:13:55,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 83 transitions, 729 flow, removed 23 selfloop flow, removed 6 redundant places. [2021-03-26 00:13:55,104 INFO L241 Difference]: Finished difference. Result has 86 places, 79 transitions, 707 flow [2021-03-26 00:13:55,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=707, PETRI_PLACES=86, PETRI_TRANSITIONS=79} [2021-03-26 00:13:55,104 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2021-03-26 00:13:55,104 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:55,105 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 79 transitions, 707 flow [2021-03-26 00:13:55,105 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 79 transitions, 707 flow [2021-03-26 00:13:55,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 79 transitions, 707 flow [2021-03-26 00:13:55,142 INFO L129 PetriNetUnfolder]: 224/533 cut-off events. [2021-03-26 00:13:55,142 INFO L130 PetriNetUnfolder]: For 3076/3500 co-relation queries the response was YES. [2021-03-26 00:13:55,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 533 events. 224/533 cut-off events. For 3076/3500 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3608 event pairs, 7 based on Foata normal form. 13/461 useless extension candidates. Maximal degree in co-relation 2674. Up to 279 conditions per place. [2021-03-26 00:13:55,148 INFO L142 LiptonReduction]: Number of co-enabled transitions 1570 [2021-03-26 00:13:55,161 INFO L154 LiptonReduction]: Checked pairs total: 803 [2021-03-26 00:13:55,161 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:55,161 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-03-26 00:13:55,162 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 79 transitions, 707 flow [2021-03-26 00:13:55,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,163 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:55,163 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:55,163 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:13:55,163 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:55,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:55,163 INFO L82 PathProgramCache]: Analyzing trace with hash -532604035, now seen corresponding path program 1 times [2021-03-26 00:13:55,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:55,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380379598] [2021-03-26 00:13:55,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:55,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:55,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:55,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:55,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:55,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:55,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:55,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:55,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:55,219 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:55,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:55,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:55,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:55,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380379598] [2021-03-26 00:13:55,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:55,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:13:55,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554799846] [2021-03-26 00:13:55,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:13:55,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:13:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:13:55,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 199 [2021-03-26 00:13:55,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 79 transitions, 707 flow. Second operand has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:55,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 199 [2021-03-26 00:13:55,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:55,353 INFO L129 PetriNetUnfolder]: 245/612 cut-off events. [2021-03-26 00:13:55,353 INFO L130 PetriNetUnfolder]: For 4795/8140 co-relation queries the response was YES. [2021-03-26 00:13:55,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 612 events. 245/612 cut-off events. For 4795/8140 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4325 event pairs, 5 based on Foata normal form. 440/978 useless extension candidates. Maximal degree in co-relation 3380. Up to 286 conditions per place. [2021-03-26 00:13:55,359 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 33 changer transitions 4/82 dead transitions. [2021-03-26 00:13:55,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 82 transitions, 814 flow [2021-03-26 00:13:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 00:13:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 00:13:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1823 transitions. [2021-03-26 00:13:55,362 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8328003654636821 [2021-03-26 00:13:55,362 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1823 transitions. [2021-03-26 00:13:55,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1823 transitions. [2021-03-26 00:13:55,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:55,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1823 transitions. [2021-03-26 00:13:55,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 165.72727272727272) internal successors, (1823), 11 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 199.0) internal successors, (2388), 12 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,367 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 199.0) internal successors, (2388), 12 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:55,367 INFO L185 Difference]: Start difference. First operand has 86 places, 79 transitions, 707 flow. Second operand 11 states and 1823 transitions. [2021-03-26 00:13:55,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 82 transitions, 814 flow [2021-03-26 00:13:55,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 82 transitions, 671 flow, removed 47 selfloop flow, removed 9 redundant places. [2021-03-26 00:13:55,382 INFO L241 Difference]: Finished difference. Result has 90 places, 78 transitions, 631 flow [2021-03-26 00:13:55,382 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=631, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2021-03-26 00:13:55,382 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 34 predicate places. [2021-03-26 00:13:55,382 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:55,382 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 78 transitions, 631 flow [2021-03-26 00:13:55,382 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 78 transitions, 631 flow [2021-03-26 00:13:55,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 78 transitions, 631 flow [2021-03-26 00:13:55,452 INFO L129 PetriNetUnfolder]: 206/493 cut-off events. [2021-03-26 00:13:55,452 INFO L130 PetriNetUnfolder]: For 1754/2064 co-relation queries the response was YES. [2021-03-26 00:13:55,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 493 events. 206/493 cut-off events. For 1754/2064 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 3362 event pairs, 2 based on Foata normal form. 10/422 useless extension candidates. Maximal degree in co-relation 2129. Up to 150 conditions per place. [2021-03-26 00:13:55,459 INFO L142 LiptonReduction]: Number of co-enabled transitions 1532 [2021-03-26 00:13:56,033 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-26 00:13:56,239 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 00:13:57,505 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 00:13:57,965 WARN L205 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 00:13:58,200 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:13:58,429 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:13:58,936 WARN L205 SmtUtils]: Spent 505.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:13:59,418 WARN L205 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 00:13:59,430 INFO L154 LiptonReduction]: Checked pairs total: 2337 [2021-03-26 00:13:59,430 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:13:59,430 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4048 [2021-03-26 00:13:59,431 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 72 transitions, 591 flow [2021-03-26 00:13:59,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.85714285714286) internal successors, (1140), 7 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:59,431 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:59,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:13:59,431 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 911999213, now seen corresponding path program 1 times [2021-03-26 00:13:59,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:59,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167077614] [2021-03-26 00:13:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:59,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:59,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:59,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:59,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:59,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167077614] [2021-03-26 00:13:59,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:59,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:59,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143758183] [2021-03-26 00:13:59,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:13:59,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:59,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:13:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:13:59,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 201 [2021-03-26 00:13:59,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 72 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 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-26 00:13:59,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:59,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 201 [2021-03-26 00:13:59,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:59,507 INFO L129 PetriNetUnfolder]: 196/451 cut-off events. [2021-03-26 00:13:59,508 INFO L130 PetriNetUnfolder]: For 6915/7282 co-relation queries the response was YES. [2021-03-26 00:13:59,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 451 events. 196/451 cut-off events. For 6915/7282 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2600 event pairs, 5 based on Foata normal form. 52/451 useless extension candidates. Maximal degree in co-relation 1806. Up to 128 conditions per place. [2021-03-26 00:13:59,512 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 5 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2021-03-26 00:13:59,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 62 transitions, 493 flow [2021-03-26 00:13:59,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:59,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2021-03-26 00:13:59,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 00:13:59,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2021-03-26 00:13:59,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2021-03-26 00:13:59,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:59,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2021-03-26 00:13:59,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,515 INFO L185 Difference]: Start difference. First operand has 87 places, 72 transitions, 591 flow. Second operand 3 states and 536 transitions. [2021-03-26 00:13:59,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 62 transitions, 493 flow [2021-03-26 00:13:59,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 62 transitions, 406 flow, removed 28 selfloop flow, removed 13 redundant places. [2021-03-26 00:13:59,521 INFO L241 Difference]: Finished difference. Result has 67 places, 61 transitions, 400 flow [2021-03-26 00:13:59,521 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2021-03-26 00:13:59,521 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2021-03-26 00:13:59,521 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:59,521 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 61 transitions, 400 flow [2021-03-26 00:13:59,521 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 61 transitions, 400 flow [2021-03-26 00:13:59,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 61 transitions, 400 flow [2021-03-26 00:13:59,539 INFO L129 PetriNetUnfolder]: 131/300 cut-off events. [2021-03-26 00:13:59,539 INFO L130 PetriNetUnfolder]: For 637/743 co-relation queries the response was YES. [2021-03-26 00:13:59,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 300 events. 131/300 cut-off events. For 637/743 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1641 event pairs, 2 based on Foata normal form. 16/281 useless extension candidates. Maximal degree in co-relation 978. Up to 98 conditions per place. [2021-03-26 00:13:59,542 INFO L142 LiptonReduction]: Number of co-enabled transitions 916 [2021-03-26 00:13:59,548 INFO L154 LiptonReduction]: Checked pairs total: 295 [2021-03-26 00:13:59,549 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:59,549 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-26 00:13:59,549 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 400 flow [2021-03-26 00:13:59,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 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-26 00:13:59,550 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:59,550 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:59,550 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:13:59,550 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1433790407, now seen corresponding path program 1 times [2021-03-26 00:13:59,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:59,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914039842] [2021-03-26 00:13:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:59,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:59,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:59,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:59,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:59,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:59,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:59,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914039842] [2021-03-26 00:13:59,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:59,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:59,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359347575] [2021-03-26 00:13:59,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:59,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:59,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:59,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:59,590 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201 [2021-03-26 00:13:59,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 400 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:59,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201 [2021-03-26 00:13:59,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:59,656 INFO L129 PetriNetUnfolder]: 356/784 cut-off events. [2021-03-26 00:13:59,656 INFO L130 PetriNetUnfolder]: For 2553/3038 co-relation queries the response was YES. [2021-03-26 00:13:59,659 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2685 conditions, 784 events. 356/784 cut-off events. For 2553/3038 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5207 event pairs, 11 based on Foata normal form. 66/770 useless extension candidates. Maximal degree in co-relation 2656. Up to 232 conditions per place. [2021-03-26 00:13:59,661 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2021-03-26 00:13:59,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 412 flow [2021-03-26 00:13:59,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:59,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:59,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2021-03-26 00:13:59,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8681592039800995 [2021-03-26 00:13:59,664 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2021-03-26 00:13:59,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2021-03-26 00:13:59,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:59,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2021-03-26 00:13:59,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,666 INFO L185 Difference]: Start difference. First operand has 67 places, 61 transitions, 400 flow. Second operand 4 states and 698 transitions. [2021-03-26 00:13:59,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 412 flow [2021-03-26 00:13:59,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 410 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:59,675 INFO L241 Difference]: Finished difference. Result has 71 places, 62 transitions, 411 flow [2021-03-26 00:13:59,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2021-03-26 00:13:59,675 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 15 predicate places. [2021-03-26 00:13:59,675 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:59,675 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 62 transitions, 411 flow [2021-03-26 00:13:59,676 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 62 transitions, 411 flow [2021-03-26 00:13:59,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 411 flow [2021-03-26 00:13:59,707 INFO L129 PetriNetUnfolder]: 254/557 cut-off events. [2021-03-26 00:13:59,707 INFO L130 PetriNetUnfolder]: For 971/1126 co-relation queries the response was YES. [2021-03-26 00:13:59,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 557 events. 254/557 cut-off events. For 971/1126 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 3562 event pairs, 4 based on Foata normal form. 13/488 useless extension candidates. Maximal degree in co-relation 1816. Up to 196 conditions per place. [2021-03-26 00:13:59,713 INFO L142 LiptonReduction]: Number of co-enabled transitions 958 [2021-03-26 00:13:59,721 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-26 00:13:59,721 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:59,721 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 46 [2021-03-26 00:13:59,722 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 411 flow [2021-03-26 00:13:59,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,722 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:59,722 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:59,722 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:13:59,722 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:59,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1600704541, now seen corresponding path program 2 times [2021-03-26 00:13:59,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:59,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458395938] [2021-03-26 00:13:59,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:59,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:59,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:59,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:59,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:59,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458395938] [2021-03-26 00:13:59,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:59,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:59,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976405989] [2021-03-26 00:13:59,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:13:59,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:59,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:13:59,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:13:59,752 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2021-03-26 00:13:59,753 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,753 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:59,753 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2021-03-26 00:13:59,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:59,817 INFO L129 PetriNetUnfolder]: 456/976 cut-off events. [2021-03-26 00:13:59,818 INFO L130 PetriNetUnfolder]: For 2402/2851 co-relation queries the response was YES. [2021-03-26 00:13:59,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3262 conditions, 976 events. 456/976 cut-off events. For 2402/2851 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 6816 event pairs, 11 based on Foata normal form. 56/890 useless extension candidates. Maximal degree in co-relation 3231. Up to 326 conditions per place. [2021-03-26 00:13:59,823 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 3 selfloop transitions, 3 changer transitions 15/62 dead transitions. [2021-03-26 00:13:59,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 62 transitions, 423 flow [2021-03-26 00:13:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2021-03-26 00:13:59,824 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8756218905472637 [2021-03-26 00:13:59,824 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2021-03-26 00:13:59,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2021-03-26 00:13:59,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:59,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2021-03-26 00:13:59,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:59,826 INFO L185 Difference]: Start difference. First operand has 71 places, 62 transitions, 411 flow. Second operand 3 states and 528 transitions. [2021-03-26 00:13:59,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 62 transitions, 423 flow [2021-03-26 00:13:59,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 62 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:59,838 INFO L241 Difference]: Finished difference. Result has 73 places, 47 transitions, 305 flow [2021-03-26 00:13:59,838 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=305, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2021-03-26 00:13:59,838 INFO L343 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2021-03-26 00:13:59,839 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:59,839 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 47 transitions, 305 flow [2021-03-26 00:13:59,839 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 47 transitions, 305 flow [2021-03-26 00:13:59,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 47 transitions, 305 flow [2021-03-26 00:13:59,852 INFO L129 PetriNetUnfolder]: 95/223 cut-off events. [2021-03-26 00:13:59,852 INFO L130 PetriNetUnfolder]: For 534/609 co-relation queries the response was YES. [2021-03-26 00:13:59,852 INFO L84 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 223 events. 95/223 cut-off events. For 534/609 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1037 event pairs, 0 based on Foata normal form. 18/219 useless extension candidates. Maximal degree in co-relation 712. Up to 82 conditions per place. [2021-03-26 00:13:59,854 INFO L142 LiptonReduction]: Number of co-enabled transitions 520 [2021-03-26 00:14:00,020 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:14:00,440 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 00:14:00,570 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 00:14:00,958 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2021-03-26 00:14:01,250 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-03-26 00:14:01,312 INFO L154 LiptonReduction]: Checked pairs total: 168 [2021-03-26 00:14:01,312 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-26 00:14:01,312 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1474 [2021-03-26 00:14:01,313 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 309 flow [2021-03-26 00:14:01,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:14:01,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:14:01,313 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:14:01,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 00:14:01,313 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:14:01,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:14:01,313 INFO L82 PathProgramCache]: Analyzing trace with hash 772847966, now seen corresponding path program 1 times [2021-03-26 00:14:01,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:14:01,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680149823] [2021-03-26 00:14:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:14:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:14:01,335 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:14:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:14:01,356 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:14:01,381 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:14:01,381 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:14:01,381 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 00:14:01,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:14:01 BasicIcfg [2021-03-26 00:14:01,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:14:01,488 INFO L168 Benchmark]: Toolchain (without parser) took 26103.51 ms. Allocated memory was 383.8 MB in the beginning and 1.2 GB in the end (delta: 786.4 MB). Free memory was 346.8 MB in the beginning and 907.4 MB in the end (delta: -560.6 MB). Peak memory consumption was 227.9 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:01,488 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 383.8 MB. Free memory was 365.2 MB in the beginning and 365.2 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:14:01,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.75 ms. Allocated memory is still 383.8 MB. Free memory was 346.7 MB in the beginning and 343.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:01,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.13 ms. Allocated memory is still 383.8 MB. Free memory was 343.5 MB in the beginning and 340.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:01,489 INFO L168 Benchmark]: Boogie Preprocessor took 47.19 ms. Allocated memory is still 383.8 MB. Free memory was 340.4 MB in the beginning and 338.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:01,489 INFO L168 Benchmark]: RCFGBuilder took 1350.86 ms. Allocated memory is still 383.8 MB. Free memory was 338.3 MB in the beginning and 287.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 165.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:01,490 INFO L168 Benchmark]: TraceAbstraction took 24240.58 ms. Allocated memory was 383.8 MB in the beginning and 1.2 GB in the end (delta: 786.4 MB). Free memory was 287.4 MB in the beginning and 907.4 MB in the end (delta: -620.0 MB). Peak memory consumption was 166.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:14:01,494 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.57 ms. Allocated memory is still 383.8 MB. Free memory was 365.2 MB in the beginning and 365.2 MB in the end (delta: 75.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 396.75 ms. Allocated memory is still 383.8 MB. Free memory was 346.7 MB in the beginning and 343.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 6.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.13 ms. Allocated memory is still 383.8 MB. Free memory was 343.5 MB in the beginning and 340.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 47.19 ms. Allocated memory is still 383.8 MB. Free memory was 340.4 MB in the beginning and 338.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1350.86 ms. Allocated memory is still 383.8 MB. Free memory was 338.3 MB in the beginning and 287.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 165.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24240.58 ms. Allocated memory was 383.8 MB in the beginning and 1.2 GB in the end (delta: 786.4 MB). Free memory was 287.4 MB in the beginning and 907.4 MB in the end (delta: -620.0 MB). Peak memory consumption was 166.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7993.5ms, 122 PlacesBefore, 56 PlacesAfterwards, 111 TransitionsBefore, 44 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 5123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2573, positive: 2451, positive conditional: 2451, positive unconditional: 0, negative: 122, negative conditional: 122, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1804, positive: 1755, positive conditional: 0, positive unconditional: 1755, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1804, positive: 1755, positive conditional: 0, positive unconditional: 1755, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1804, positive: 1736, positive conditional: 0, positive unconditional: 1736, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 68, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 820, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 778, negative conditional: 0, negative unconditional: 778, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2573, positive: 696, positive conditional: 696, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 1804, unknown conditional: 1804, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 116, Positive conditional cache size: 116, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3363.0ms, 52 PlacesBefore, 40 PlacesAfterwards, 36 TransitionsBefore, 29 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 4 FixpointIterations, 6 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 2040 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 763, positive: 652, positive conditional: 652, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, positive: 108, positive conditional: 17, positive unconditional: 91, negative: 18, negative conditional: 8, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 126, positive: 108, positive conditional: 17, positive unconditional: 91, negative: 18, negative conditional: 8, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 126, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 18, negative conditional: 8, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 296, negative conditional: 178, negative unconditional: 118, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 763, positive: 544, positive conditional: 544, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 126, unknown conditional: 126, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 198, Positive conditional cache size: 198, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1304.9ms, 41 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 366 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 896 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 247, positive: 195, positive conditional: 195, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, positive: 16, positive conditional: 6, positive unconditional: 10, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32, positive: 16, positive conditional: 6, positive unconditional: 10, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 32, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 393, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 367, negative conditional: 2, negative unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 247, positive: 179, positive conditional: 179, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 32, unknown conditional: 32, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 214, Positive conditional cache size: 214, Positive unconditional cache size: 0, Negative cache size: 51, Negative conditional cache size: 51, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 155.5ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 464 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 412 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 176, positive conditional: 176, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 67, positive: 63, positive conditional: 28, positive unconditional: 35, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 67, positive: 63, positive conditional: 28, positive unconditional: 35, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 67, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 79, positive conditional: 67, positive unconditional: 13, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 113, positive conditional: 113, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 67, unknown conditional: 67, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 277, Positive conditional cache size: 277, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 119.7ms, 46 PlacesBefore, 46 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 403 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 171, positive: 153, positive conditional: 153, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 33, positive conditional: 21, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 33, positive conditional: 21, positive unconditional: 12, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 104, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 38, unknown conditional: 38, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 370, Positive cache size: 310, Positive conditional cache size: 310, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 683.2ms, 50 PlacesBefore, 50 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 552 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 924 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 376, positive: 338, positive conditional: 338, positive unconditional: 0, negative: 38, negative conditional: 38, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 55, positive: 52, positive conditional: 43, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 55, positive: 52, positive conditional: 43, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 55, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 376, positive: 286, positive conditional: 286, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 55, unknown conditional: 55, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 333, Positive conditional cache size: 333, Positive unconditional cache size: 0, Negative cache size: 55, Negative conditional cache size: 55, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.2ms, 56 PlacesBefore, 56 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 668 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 589 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 254, positive: 233, positive conditional: 233, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, positive: 94, positive conditional: 78, positive unconditional: 16, 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: 95, positive: 94, positive conditional: 78, positive unconditional: 16, 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: 95, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, positive: 139, positive conditional: 139, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 95, unknown conditional: 95, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 427, Positive conditional cache size: 427, Positive unconditional cache size: 0, Negative cache size: 56, Negative conditional cache size: 56, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.7ms, 57 PlacesBefore, 57 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 545 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 237, positive conditional: 237, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 60, positive conditional: 29, positive unconditional: 31, 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: 61, positive: 60, positive conditional: 29, positive unconditional: 31, 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: 61, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, positive: 177, positive conditional: 177, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 544, Positive cache size: 487, Positive conditional cache size: 487, Positive unconditional cache size: 0, Negative cache size: 57, Negative conditional cache size: 57, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.7ms, 61 PlacesBefore, 61 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 826 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 813 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 251, positive conditional: 251, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 32, positive conditional: 19, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, positive: 32, positive conditional: 19, positive unconditional: 13, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 277, positive: 219, positive conditional: 219, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 579, Positive cache size: 519, Positive conditional cache size: 519, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.9ms, 65 PlacesBefore, 65 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1161 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 563, positive: 529, positive conditional: 529, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 86, positive conditional: 71, positive unconditional: 15, 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: 86, positive: 86, positive conditional: 71, positive unconditional: 15, 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: 86, positive: 86, positive conditional: 0, positive unconditional: 86, 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: 563, positive: 443, positive conditional: 443, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 86, unknown conditional: 86, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 665, Positive cache size: 605, Positive conditional cache size: 605, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.5ms, 67 PlacesBefore, 67 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 938 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1412 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 634, positive: 593, positive conditional: 593, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 40, positive conditional: 33, positive unconditional: 7, 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: 40, positive: 40, positive conditional: 33, positive unconditional: 7, 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: 40, positive: 40, positive conditional: 0, positive unconditional: 40, 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: 634, positive: 553, positive conditional: 553, positive unconditional: 0, negative: 41, negative conditional: 41, negative unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 705, Positive cache size: 645, Positive conditional cache size: 645, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.9ms, 69 PlacesBefore, 69 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 682, positive: 638, positive conditional: 638, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 35, 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: 39, positive: 39, positive conditional: 35, 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: 39, positive: 39, positive conditional: 0, positive unconditional: 39, 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: 682, positive: 599, positive conditional: 599, positive unconditional: 0, negative: 44, negative conditional: 44, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 744, Positive cache size: 684, Positive conditional cache size: 684, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 166.6ms, 73 PlacesBefore, 73 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 897 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 397, positive: 377, positive conditional: 377, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 82, positive: 82, positive conditional: 69, positive unconditional: 13, 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: 82, positive: 82, positive conditional: 69, positive unconditional: 13, 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: 82, positive: 82, positive conditional: 0, positive unconditional: 82, 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: 397, positive: 295, positive conditional: 295, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 82, unknown conditional: 82, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 826, Positive cache size: 766, Positive conditional cache size: 766, Positive unconditional cache size: 0, Negative cache size: 60, Negative conditional cache size: 60, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.5ms, 81 PlacesBefore, 81 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 848 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 404, positive: 384, positive conditional: 384, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 61, positive conditional: 42, positive unconditional: 19, 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: 62, positive: 61, positive conditional: 42, positive unconditional: 19, 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: 62, positive: 61, positive conditional: 0, positive unconditional: 61, 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: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 404, positive: 323, positive conditional: 323, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 62, unknown conditional: 62, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 827, Positive conditional cache size: 827, Positive unconditional cache size: 0, Negative cache size: 61, Negative conditional cache size: 61, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.1ms, 86 PlacesBefore, 86 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 803 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 379, positive: 362, positive conditional: 362, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, positive: 86, positive conditional: 84, 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: 86, positive: 86, positive conditional: 84, 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: 86, positive: 86, positive conditional: 0, positive unconditional: 86, 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: 379, positive: 276, positive conditional: 276, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 86, unknown conditional: 86, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 974, Positive cache size: 913, Positive conditional cache size: 913, Positive unconditional cache size: 0, Negative cache size: 61, Negative conditional cache size: 61, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4047.7ms, 90 PlacesBefore, 87 PlacesAfterwards, 78 TransitionsBefore, 72 TransitionsAfterwards, 1532 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 2337 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1143, positive: 1092, positive conditional: 1092, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, positive: 197, positive conditional: 195, 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: 197, positive: 197, positive conditional: 195, 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: 197, positive: 197, positive conditional: 0, positive unconditional: 197, 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: 1143, positive: 895, positive conditional: 895, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 197, unknown conditional: 197, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 820, Positive conditional cache size: 820, Positive unconditional cache size: 0, Negative cache size: 18, Negative conditional cache size: 18, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.2ms, 67 PlacesBefore, 67 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 916 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 295 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 110, positive conditional: 110, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 26, positive conditional: 22, positive unconditional: 4, 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: 28, positive: 26, positive conditional: 22, positive unconditional: 4, 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: 28, positive: 26, positive conditional: 0, positive unconditional: 26, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 866, Positive cache size: 846, Positive conditional cache size: 846, Positive unconditional cache size: 0, Negative cache size: 20, Negative conditional cache size: 20, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.5ms, 71 PlacesBefore, 71 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 958 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 16, positive unconditional: 4, 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: 22, positive: 20, positive conditional: 16, positive unconditional: 4, 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: 22, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 22, unknown conditional: 22, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 888, Positive cache size: 866, Positive conditional cache size: 866, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1473.2ms, 73 PlacesBefore, 65 PlacesAfterwards, 47 TransitionsBefore, 43 TransitionsAfterwards, 520 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 168 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, positive: 93, positive conditional: 75, positive unconditional: 18, 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: 94, positive: 93, positive conditional: 75, positive unconditional: 18, 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: 94, positive: 93, positive conditional: 0, positive unconditional: 93, 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: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 146, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 94, unknown conditional: 94, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 86, Positive conditional cache size: 86, Positive unconditional cache size: 0, Negative cache size: 3, Negative conditional cache size: 3, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 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_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t813; [L845] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L846] 0 pthread_t t814; [L847] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L848] 0 pthread_t t815; [L849] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L850] 0 pthread_t t816; [L851] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] [L799] 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) [L799] 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) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 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 [L769] 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) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] 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) [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 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 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] 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) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] 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) [L857] 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) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 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 [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] 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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24049.4ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2195.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8066.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 77 SDtfs, 37 SDslu, 23 SDs, 0 SdLazy, 517 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 469.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 476.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=712occurred in iteration=13, InterpolantAutomatonStates: 90, 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: 56.9ms SsaConstructionTime, 425.6ms SatisfiabilityAnalysisTime, 1064.7ms InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 2146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...