/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:10:30,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:10:30,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:10:30,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:10:30,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:10:30,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:10:30,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:10:30,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:10:30,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:10:30,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:10:30,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:10:30,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:10:30,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:10:30,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:10:30,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:10:30,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:10:30,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:10:30,390 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:10:30,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:10:30,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:10:30,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:10:30,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:10:30,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:10:30,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:10:30,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:10:30,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:10:30,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:10:30,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:10:30,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:10:30,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:10:30,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:10:30,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:10:30,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:10:30,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:10:30,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:10:30,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:10:30,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:10:30,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:10:30,401 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:10:30,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:10:30,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:10:30,414 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:10:30,430 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:10:30,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:10:30,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:10:30,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:10:30,431 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:10:30,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:10:30,431 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:10:30,432 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:10:30,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:10:30,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:10:30,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:10:30,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:10:30,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:10:30,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:10:30,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:10:30,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:10:30,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:10:30,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:10:30,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:10:30,434 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:10:30,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:10:30,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:10:30,434 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:10:30,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:10:30,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:10:30,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:10:30,716 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:10:30,716 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:10:30,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2021-03-26 10:10:30,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30d6572c/cb3bda07c855441bb419d861d080f850/FLAG69b652084 [2021-03-26 10:10:31,236 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:10:31,236 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_rmo.opt.i [2021-03-26 10:10:31,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30d6572c/cb3bda07c855441bb419d861d080f850/FLAG69b652084 [2021-03-26 10:10:31,270 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30d6572c/cb3bda07c855441bb419d861d080f850 [2021-03-26 10:10:31,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:10:31,272 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:10:31,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:31,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:10:31,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:10:31,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681ec50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31, skipping insertion in model container [2021-03-26 10:10:31,277 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:10:31,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:10:31,524 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/mix045_rmo.opt.i[948,961] [2021-03-26 10:10:31,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:31,683 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:10:31,690 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/mix045_rmo.opt.i[948,961] [2021-03-26 10:10:31,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:31,797 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:10:31,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31 WrapperNode [2021-03-26 10:10:31,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:31,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:31,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:10:31,800 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:10:31,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,860 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:31,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:10:31,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:10:31,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:10:31,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... [2021-03-26 10:10:31,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:10:31,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:10:31,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:10:31,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:10:31,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:10:31,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:10:31,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:10:31,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:10:31,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:10:31,970 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:10:31,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:10:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:10:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:10:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:10:31,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:10:31,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:10:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:10:31,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:10:31,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:10:31,974 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:10:33,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:10:33,165 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:10:33,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:33 BoogieIcfgContainer [2021-03-26 10:10:33,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:10:33,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:10:33,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:10:33,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:10:33,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:10:31" (1/3) ... [2021-03-26 10:10:33,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5811dd73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:33, skipping insertion in model container [2021-03-26 10:10:33,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:31" (2/3) ... [2021-03-26 10:10:33,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5811dd73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:33, skipping insertion in model container [2021-03-26 10:10:33,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:33" (3/3) ... [2021-03-26 10:10:33,173 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_rmo.opt.i [2021-03-26 10:10:33,179 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:10:33,183 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:10:33,184 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:10:33,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,236 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,239 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,244 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,244 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,244 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,256 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,258 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,258 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:33,260 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:10:33,285 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:10:33,309 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:10:33,309 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:10:33,309 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:10:33,309 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:10:33,309 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:10:33,309 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:10:33,309 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:10:33,309 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:10:33,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:33,367 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:33,368 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:33,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:33,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:33,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:33,386 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:33,394 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:33,396 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:33,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:33,409 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:33,409 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:33,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:33,411 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-26 10:10:34,086 WARN L205 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:10:34,714 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 10:10:35,883 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:10:36,379 WARN L205 SmtUtils]: Spent 492.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:10:37,266 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:37,587 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:10:38,688 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:38,956 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:40,156 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 267 DAG size of output: 266 [2021-03-26 10:10:40,812 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:10:40,984 INFO L154 LiptonReduction]: Checked pairs total: 2726 [2021-03-26 10:10:40,985 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-26 10:10:40,986 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7600 [2021-03-26 10:10:40,996 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:10:40,997 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:40,997 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:40,997 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:40,997 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:41,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:41,001 INFO L82 PathProgramCache]: Analyzing trace with hash 429548733, now seen corresponding path program 1 times [2021-03-26 10:10:41,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:41,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730104591] [2021-03-26 10:10:41,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:41,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:41,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:41,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:41,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:41,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730104591] [2021-03-26 10:10:41,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:41,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:41,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071221281] [2021-03-26 10:10:41,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:41,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:41,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:41,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:41,202 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 167 [2021-03-26 10:10:41,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:41,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 167 [2021-03-26 10:10:41,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:41,274 INFO L129 PetriNetUnfolder]: 23/102 cut-off events. [2021-03-26 10:10:41,274 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:41,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 102 events. 23/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 3 based on Foata normal form. 5/99 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-26 10:10:41,276 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 7 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2021-03-26 10:10:41,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:41,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 10:10:41,291 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902195608782435 [2021-03-26 10:10:41,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 10:10:41,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 10:10:41,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:41,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 10:10:41,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:41,306 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 446 transitions. [2021-03-26 10:10:41,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:41,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:41,309 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:41,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-26 10:10:41,311 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-26 10:10:41,311 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:41,311 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:41,312 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:41,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 10:10:41,318 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 10:10:41,318 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:41,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:10:41,319 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-26 10:10:41,751 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:42,023 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:42,597 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:10:43,171 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:10:44,087 INFO L154 LiptonReduction]: Checked pairs total: 1054 [2021-03-26 10:10:44,088 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:10:44,088 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2777 [2021-03-26 10:10:44,089 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 10:10:44,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,089 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:44,089 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:44,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:10:44,089 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1980972199, now seen corresponding path program 1 times [2021-03-26 10:10:44,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:44,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922651344] [2021-03-26 10:10:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:44,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:44,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:44,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:44,205 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:10:44,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:10:44,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:44,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922651344] [2021-03-26 10:10:44,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:44,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:44,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442402817] [2021-03-26 10:10:44,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:44,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:44,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:44,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:44,211 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 178 [2021-03-26 10:10:44,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:44,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 178 [2021-03-26 10:10:44,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:44,222 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 10:10:44,222 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:44,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:10:44,230 INFO L132 encePairwiseOnDemand]: 174/178 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-26 10:10:44,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 10:10:44,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8782771535580525 [2021-03-26 10:10:44,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 10:10:44,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 10:10:44,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:44,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 10:10:44,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,235 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,235 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 469 transitions. [2021-03-26 10:10:44,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:44,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:44,235 INFO L241 Difference]: Finished difference. Result has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:44,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2021-03-26 10:10:44,236 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:10:44,236 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:44,236 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:44,236 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:44,237 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:44,240 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:10:44,240 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:10:44,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-03-26 10:10:44,240 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 10:10:44,747 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:45,130 WARN L205 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:45,310 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:10:45,316 INFO L154 LiptonReduction]: Checked pairs total: 633 [2021-03-26 10:10:45,319 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:45,319 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1083 [2021-03-26 10:10:45,324 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-26 10:10:45,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,325 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:45,325 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:45,325 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:10:45,325 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:45,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:45,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1508873391, now seen corresponding path program 1 times [2021-03-26 10:10:45,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:45,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466089250] [2021-03-26 10:10:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:45,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:45,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466089250] [2021-03-26 10:10:45,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:45,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:10:45,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715261320] [2021-03-26 10:10:45,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:45,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:45,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:45,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:45,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 180 [2021-03-26 10:10:45,409 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:45,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 180 [2021-03-26 10:10:45,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:45,423 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 10:10:45,423 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:10:45,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 33 events. 3/33 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:10:45,424 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 10:10:45,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 73 flow [2021-03-26 10:10:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-26 10:10:45,426 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8851851851851852 [2021-03-26 10:10:45,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-26 10:10:45,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-26 10:10:45,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:45,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-26 10:10:45,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,432 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 478 transitions. [2021-03-26 10:10:45,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 73 flow [2021-03-26 10:10:45,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:45,434 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:45,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 10:10:45,434 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:10:45,435 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:45,435 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:45,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:45,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:45,439 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-26 10:10:45,441 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:10:45,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:10:45,442 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-26 10:10:45,444 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-26 10:10:45,444 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:45,445 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-26 10:10:45,445 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:45,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,446 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:45,446 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:45,446 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:10:45,446 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1510579461, now seen corresponding path program 1 times [2021-03-26 10:10:45,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:45,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110255654] [2021-03-26 10:10:45,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:45,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:45,571 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-26 10:10:45,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 10:10:45,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:45,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:10:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:45,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110255654] [2021-03-26 10:10:45,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:45,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:45,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739977306] [2021-03-26 10:10:45,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:45,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:45,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:45,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:45,606 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 180 [2021-03-26 10:10:45,606 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:45,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 180 [2021-03-26 10:10:45,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:45,688 INFO L129 PetriNetUnfolder]: 61/146 cut-off events. [2021-03-26 10:10:45,688 INFO L130 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2021-03-26 10:10:45,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 146 events. 61/146 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 634 event pairs, 28 based on Foata normal form. 3/134 useless extension candidates. Maximal degree in co-relation 308. Up to 93 conditions per place. [2021-03-26 10:10:45,693 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 8 selfloop transitions, 8 changer transitions 0/32 dead transitions. [2021-03-26 10:10:45,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 125 flow [2021-03-26 10:10:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2021-03-26 10:10:45,696 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.77 [2021-03-26 10:10:45,696 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2021-03-26 10:10:45,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2021-03-26 10:10:45,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:45,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2021-03-26 10:10:45,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,700 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:45,700 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 5 states and 693 transitions. [2021-03-26 10:10:45,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 125 flow [2021-03-26 10:10:45,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:45,701 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:45,702 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-03-26 10:10:45,702 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -11 predicate places. [2021-03-26 10:10:45,702 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:45,702 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:45,702 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:45,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 123 flow [2021-03-26 10:10:45,712 INFO L129 PetriNetUnfolder]: 15/70 cut-off events. [2021-03-26 10:10:45,712 INFO L130 PetriNetUnfolder]: For 88/91 co-relation queries the response was YES. [2021-03-26 10:10:45,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 70 events. 15/70 cut-off events. For 88/91 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 274 event pairs, 5 based on Foata normal form. 1/61 useless extension candidates. Maximal degree in co-relation 163. Up to 23 conditions per place. [2021-03-26 10:10:45,715 INFO L142 LiptonReduction]: Number of co-enabled transitions 326 [2021-03-26 10:10:45,872 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:10:46,233 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2021-03-26 10:10:46,357 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:10:46,382 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-26 10:10:46,382 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:46,382 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 680 [2021-03-26 10:10:46,386 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 125 flow [2021-03-26 10:10:46,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,387 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:46,387 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:46,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:10:46,388 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:46,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:46,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1499624061, now seen corresponding path program 2 times [2021-03-26 10:10:46,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:46,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90970290] [2021-03-26 10:10:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:46,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:46,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:46,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:46,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:46,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90970290] [2021-03-26 10:10:46,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:46,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:46,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52782719] [2021-03-26 10:10:46,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:46,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:46,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:46,496 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 181 [2021-03-26 10:10:46,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:46,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 181 [2021-03-26 10:10:46,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:46,566 INFO L129 PetriNetUnfolder]: 55/134 cut-off events. [2021-03-26 10:10:46,567 INFO L130 PetriNetUnfolder]: For 162/168 co-relation queries the response was YES. [2021-03-26 10:10:46,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 134 events. 55/134 cut-off events. For 162/168 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 558 event pairs, 13 based on Foata normal form. 4/125 useless extension candidates. Maximal degree in co-relation 397. Up to 90 conditions per place. [2021-03-26 10:10:46,568 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 9 selfloop transitions, 10 changer transitions 0/35 dead transitions. [2021-03-26 10:10:46,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 184 flow [2021-03-26 10:10:46,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2021-03-26 10:10:46,570 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.761049723756906 [2021-03-26 10:10:46,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2021-03-26 10:10:46,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2021-03-26 10:10:46,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:46,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2021-03-26 10:10:46,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,573 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,573 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 125 flow. Second operand 4 states and 551 transitions. [2021-03-26 10:10:46,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 184 flow [2021-03-26 10:10:46,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 182 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:46,576 INFO L241 Difference]: Finished difference. Result has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:46,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2021-03-26 10:10:46,576 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2021-03-26 10:10:46,576 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:46,576 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:46,576 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:46,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:46,585 INFO L129 PetriNetUnfolder]: 24/82 cut-off events. [2021-03-26 10:10:46,586 INFO L130 PetriNetUnfolder]: For 199/206 co-relation queries the response was YES. [2021-03-26 10:10:46,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 82 events. 24/82 cut-off events. For 199/206 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 309 event pairs, 7 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 249. Up to 29 conditions per place. [2021-03-26 10:10:46,587 INFO L142 LiptonReduction]: Number of co-enabled transitions 346 [2021-03-26 10:10:46,589 INFO L154 LiptonReduction]: Checked pairs total: 210 [2021-03-26 10:10:46,589 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:46,589 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-26 10:10:46,591 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 180 flow [2021-03-26 10:10:46,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:46,592 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:46,592 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:10:46,592 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1262809101, now seen corresponding path program 1 times [2021-03-26 10:10:46,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:46,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544669054] [2021-03-26 10:10:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:46,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:46,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:46,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 10:10:46,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:10:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:46,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544669054] [2021-03-26 10:10:46,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:46,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:46,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167999424] [2021-03-26 10:10:46,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:46,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:46,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:46,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:46,699 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 181 [2021-03-26 10:10:46,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:46,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 181 [2021-03-26 10:10:46,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:46,824 INFO L129 PetriNetUnfolder]: 52/140 cut-off events. [2021-03-26 10:10:46,824 INFO L130 PetriNetUnfolder]: For 232/234 co-relation queries the response was YES. [2021-03-26 10:10:46,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 140 events. 52/140 cut-off events. For 232/234 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 653 event pairs, 5 based on Foata normal form. 6/135 useless extension candidates. Maximal degree in co-relation 467. Up to 58 conditions per place. [2021-03-26 10:10:46,826 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 11 selfloop transitions, 14 changer transitions 0/41 dead transitions. [2021-03-26 10:10:46,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 263 flow [2021-03-26 10:10:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:46,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2021-03-26 10:10:46,828 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7823204419889502 [2021-03-26 10:10:46,828 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2021-03-26 10:10:46,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2021-03-26 10:10:46,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:46,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2021-03-26 10:10:46,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,831 INFO L185 Difference]: Start difference. First operand has 43 places, 34 transitions, 180 flow. Second operand 5 states and 708 transitions. [2021-03-26 10:10:46,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 263 flow [2021-03-26 10:10:46,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 257 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:46,834 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:46,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 10:10:46,835 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2021-03-26 10:10:46,835 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:46,835 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:46,835 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:46,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:46,883 INFO L129 PetriNetUnfolder]: 29/90 cut-off events. [2021-03-26 10:10:46,884 INFO L130 PetriNetUnfolder]: For 200/205 co-relation queries the response was YES. [2021-03-26 10:10:46,884 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 90 events. 29/90 cut-off events. For 200/205 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 330 event pairs, 6 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 301. Up to 32 conditions per place. [2021-03-26 10:10:46,885 INFO L142 LiptonReduction]: Number of co-enabled transitions 390 [2021-03-26 10:10:46,887 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-26 10:10:46,887 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:46,888 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-26 10:10:46,888 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 239 flow [2021-03-26 10:10:46,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 138.83333333333334) internal successors, (833), 6 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,889 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:46,889 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:46,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:10:46,889 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:46,889 INFO L82 PathProgramCache]: Analyzing trace with hash -416675652, now seen corresponding path program 1 times [2021-03-26 10:10:46,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:46,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476907047] [2021-03-26 10:10:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:46,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:46,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:10:46,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:10:46,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:46,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:10:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:46,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476907047] [2021-03-26 10:10:46,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:46,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:46,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603946327] [2021-03-26 10:10:46,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:46,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:46,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:46,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:46,985 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 181 [2021-03-26 10:10:46,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:46,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:46,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 181 [2021-03-26 10:10:46,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:47,084 INFO L129 PetriNetUnfolder]: 54/167 cut-off events. [2021-03-26 10:10:47,085 INFO L130 PetriNetUnfolder]: For 380/382 co-relation queries the response was YES. [2021-03-26 10:10:47,086 INFO L84 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 167 events. 54/167 cut-off events. For 380/382 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 852 event pairs, 6 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 624. Up to 68 conditions per place. [2021-03-26 10:10:47,088 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 16 selfloop transitions, 12 changer transitions 0/44 dead transitions. [2021-03-26 10:10:47,088 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 333 flow [2021-03-26 10:10:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2021-03-26 10:10:47,090 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7845303867403315 [2021-03-26 10:10:47,090 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2021-03-26 10:10:47,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2021-03-26 10:10:47,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:47,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2021-03-26 10:10:47,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,093 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 239 flow. Second operand 5 states and 710 transitions. [2021-03-26 10:10:47,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 333 flow [2021-03-26 10:10:47,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 44 transitions, 323 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:47,097 INFO L241 Difference]: Finished difference. Result has 52 places, 40 transitions, 283 flow [2021-03-26 10:10:47,097 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2021-03-26 10:10:47,097 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2021-03-26 10:10:47,098 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:47,098 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 283 flow [2021-03-26 10:10:47,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 283 flow [2021-03-26 10:10:47,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 283 flow [2021-03-26 10:10:47,112 INFO L129 PetriNetUnfolder]: 26/102 cut-off events. [2021-03-26 10:10:47,113 INFO L130 PetriNetUnfolder]: For 277/282 co-relation queries the response was YES. [2021-03-26 10:10:47,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 102 events. 26/102 cut-off events. For 277/282 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 447 event pairs, 6 based on Foata normal form. 3/94 useless extension candidates. Maximal degree in co-relation 343. Up to 34 conditions per place. [2021-03-26 10:10:47,114 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-26 10:10:47,117 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-26 10:10:47,117 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:47,117 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 10:10:47,118 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 283 flow [2021-03-26 10:10:47,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,119 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:47,119 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:47,119 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:10:47,119 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:47,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:47,119 INFO L82 PathProgramCache]: Analyzing trace with hash 145310436, now seen corresponding path program 1 times [2021-03-26 10:10:47,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:47,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416162218] [2021-03-26 10:10:47,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:47,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:47,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:10:47,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:10:47,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:10:47,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:10:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:47,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416162218] [2021-03-26 10:10:47,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:47,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:47,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556843419] [2021-03-26 10:10:47,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:10:47,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:47,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:10:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:10:47,245 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 181 [2021-03-26 10:10:47,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:47,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 181 [2021-03-26 10:10:47,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:47,359 INFO L129 PetriNetUnfolder]: 53/167 cut-off events. [2021-03-26 10:10:47,359 INFO L130 PetriNetUnfolder]: For 484/486 co-relation queries the response was YES. [2021-03-26 10:10:47,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 167 events. 53/167 cut-off events. For 484/486 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 832 event pairs, 7 based on Foata normal form. 4/160 useless extension candidates. Maximal degree in co-relation 671. Up to 60 conditions per place. [2021-03-26 10:10:47,360 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 12 selfloop transitions, 17 changer transitions 0/45 dead transitions. [2021-03-26 10:10:47,361 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 375 flow [2021-03-26 10:10:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2021-03-26 10:10:47,363 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7657458563535912 [2021-03-26 10:10:47,363 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2021-03-26 10:10:47,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2021-03-26 10:10:47,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:47,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2021-03-26 10:10:47,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,366 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,366 INFO L185 Difference]: Start difference. First operand has 52 places, 40 transitions, 283 flow. Second operand 5 states and 693 transitions. [2021-03-26 10:10:47,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 375 flow [2021-03-26 10:10:47,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 365 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:47,370 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 355 flow [2021-03-26 10:10:47,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-03-26 10:10:47,370 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2021-03-26 10:10:47,370 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:47,370 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 355 flow [2021-03-26 10:10:47,370 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 355 flow [2021-03-26 10:10:47,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 355 flow [2021-03-26 10:10:47,380 INFO L129 PetriNetUnfolder]: 22/94 cut-off events. [2021-03-26 10:10:47,380 INFO L130 PetriNetUnfolder]: For 324/330 co-relation queries the response was YES. [2021-03-26 10:10:47,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 94 events. 22/94 cut-off events. For 324/330 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 396 event pairs, 3 based on Foata normal form. 4/89 useless extension candidates. Maximal degree in co-relation 365. Up to 27 conditions per place. [2021-03-26 10:10:47,381 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 10:10:47,385 INFO L154 LiptonReduction]: Checked pairs total: 371 [2021-03-26 10:10:47,385 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:47,385 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-26 10:10:47,385 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 355 flow [2021-03-26 10:10:47,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,386 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:47,386 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:47,386 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:10:47,386 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:47,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:47,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1951175976, now seen corresponding path program 1 times [2021-03-26 10:10:47,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:47,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343329798] [2021-03-26 10:10:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:47,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:47,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:47,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:47,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343329798] [2021-03-26 10:10:47,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:47,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:47,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675761137] [2021-03-26 10:10:47,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:47,432 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:47,433 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:47,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:47,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:47,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:47,489 INFO L129 PetriNetUnfolder]: 170/398 cut-off events. [2021-03-26 10:10:47,489 INFO L130 PetriNetUnfolder]: For 876/943 co-relation queries the response was YES. [2021-03-26 10:10:47,490 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 398 events. 170/398 cut-off events. For 876/943 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2514 event pairs, 54 based on Foata normal form. 49/371 useless extension candidates. Maximal degree in co-relation 1198. Up to 243 conditions per place. [2021-03-26 10:10:47,492 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 12 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2021-03-26 10:10:47,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 417 flow [2021-03-26 10:10:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 770 transitions. [2021-03-26 10:10:47,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.850828729281768 [2021-03-26 10:10:47,494 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 770 transitions. [2021-03-26 10:10:47,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 770 transitions. [2021-03-26 10:10:47,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:47,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 770 transitions. [2021-03-26 10:10:47,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,496 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,497 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 355 flow. Second operand 5 states and 770 transitions. [2021-03-26 10:10:47,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 417 flow [2021-03-26 10:10:47,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 386 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:47,501 INFO L241 Difference]: Finished difference. Result has 61 places, 50 transitions, 392 flow [2021-03-26 10:10:47,501 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2021-03-26 10:10:47,501 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2021-03-26 10:10:47,501 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:47,501 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 50 transitions, 392 flow [2021-03-26 10:10:47,501 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 50 transitions, 392 flow [2021-03-26 10:10:47,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 50 transitions, 392 flow [2021-03-26 10:10:47,529 INFO L129 PetriNetUnfolder]: 131/334 cut-off events. [2021-03-26 10:10:47,530 INFO L130 PetriNetUnfolder]: For 829/928 co-relation queries the response was YES. [2021-03-26 10:10:47,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 334 events. 131/334 cut-off events. For 829/928 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2064 event pairs, 35 based on Foata normal form. 8/307 useless extension candidates. Maximal degree in co-relation 1203. Up to 176 conditions per place. [2021-03-26 10:10:47,533 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 10:10:47,542 INFO L154 LiptonReduction]: Checked pairs total: 258 [2021-03-26 10:10:47,543 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:47,543 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 42 [2021-03-26 10:10:47,546 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 392 flow [2021-03-26 10:10:47,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:47,547 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:47,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:10:47,547 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:47,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2103552726, now seen corresponding path program 1 times [2021-03-26 10:10:47,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:47,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118721358] [2021-03-26 10:10:47,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:47,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:47,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:47,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:47,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:47,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:47,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118721358] [2021-03-26 10:10:47,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:47,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:47,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387819429] [2021-03-26 10:10:47,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:47,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:47,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:47,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:47,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2021-03-26 10:10:47,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:47,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2021-03-26 10:10:47,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:47,643 INFO L129 PetriNetUnfolder]: 229/548 cut-off events. [2021-03-26 10:10:47,643 INFO L130 PetriNetUnfolder]: For 1737/1925 co-relation queries the response was YES. [2021-03-26 10:10:47,645 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 548 events. 229/548 cut-off events. For 1737/1925 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 3835 event pairs, 72 based on Foata normal form. 33/520 useless extension candidates. Maximal degree in co-relation 1913. Up to 331 conditions per place. [2021-03-26 10:10:47,646 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 4 selfloop transitions, 1 changer transitions 8/52 dead transitions. [2021-03-26 10:10:47,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 418 flow [2021-03-26 10:10:47,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 643 transitions. [2021-03-26 10:10:47,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.888121546961326 [2021-03-26 10:10:47,648 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 643 transitions. [2021-03-26 10:10:47,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 643 transitions. [2021-03-26 10:10:47,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:47,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 643 transitions. [2021-03-26 10:10:47,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,651 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:47,651 INFO L185 Difference]: Start difference. First operand has 61 places, 50 transitions, 392 flow. Second operand 4 states and 643 transitions. [2021-03-26 10:10:47,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 418 flow [2021-03-26 10:10:47,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 412 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:47,656 INFO L241 Difference]: Finished difference. Result has 65 places, 43 transitions, 316 flow [2021-03-26 10:10:47,656 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2021-03-26 10:10:47,656 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2021-03-26 10:10:47,657 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:47,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 43 transitions, 316 flow [2021-03-26 10:10:47,657 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 43 transitions, 316 flow [2021-03-26 10:10:47,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 43 transitions, 316 flow [2021-03-26 10:10:47,681 INFO L129 PetriNetUnfolder]: 129/313 cut-off events. [2021-03-26 10:10:47,681 INFO L130 PetriNetUnfolder]: For 888/930 co-relation queries the response was YES. [2021-03-26 10:10:47,682 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 313 events. 129/313 cut-off events. For 888/930 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 1955 event pairs, 48 based on Foata normal form. 7/278 useless extension candidates. Maximal degree in co-relation 1074. Up to 188 conditions per place. [2021-03-26 10:10:47,684 INFO L142 LiptonReduction]: Number of co-enabled transitions 486 [2021-03-26 10:10:47,858 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:10:48,214 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:10:48,333 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:10:48,362 INFO L154 LiptonReduction]: Checked pairs total: 43 [2021-03-26 10:10:48,362 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:48,363 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 706 [2021-03-26 10:10:48,363 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 328 flow [2021-03-26 10:10:48,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:48,363 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:48,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:10:48,363 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:48,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:48,364 INFO L82 PathProgramCache]: Analyzing trace with hash 538069803, now seen corresponding path program 1 times [2021-03-26 10:10:48,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:48,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562720843] [2021-03-26 10:10:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:48,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:48,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562720843] [2021-03-26 10:10:48,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:48,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:48,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715982695] [2021-03-26 10:10:48,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:48,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:48,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:48,444 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2021-03-26 10:10:48,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:48,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2021-03-26 10:10:48,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:48,515 INFO L129 PetriNetUnfolder]: 159/386 cut-off events. [2021-03-26 10:10:48,515 INFO L130 PetriNetUnfolder]: For 1117/1783 co-relation queries the response was YES. [2021-03-26 10:10:48,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 386 events. 159/386 cut-off events. For 1117/1783 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 2324 event pairs, 5 based on Foata normal form. 158/497 useless extension candidates. Maximal degree in co-relation 1465. Up to 249 conditions per place. [2021-03-26 10:10:48,517 INFO L132 encePairwiseOnDemand]: 177/183 looper letters, 8 selfloop transitions, 15 changer transitions 5/55 dead transitions. [2021-03-26 10:10:48,517 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 444 flow [2021-03-26 10:10:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1092 transitions. [2021-03-26 10:10:48,520 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8524590163934426 [2021-03-26 10:10:48,520 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1092 transitions. [2021-03-26 10:10:48,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1092 transitions. [2021-03-26 10:10:48,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:48,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1092 transitions. [2021-03-26 10:10:48,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.0) internal successors, (1092), 7 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,524 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 183.0) internal successors, (1464), 8 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,524 INFO L185 Difference]: Start difference. First operand has 64 places, 43 transitions, 328 flow. Second operand 7 states and 1092 transitions. [2021-03-26 10:10:48,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 444 flow [2021-03-26 10:10:48,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 55 transitions, 410 flow, removed 5 selfloop flow, removed 7 redundant places. [2021-03-26 10:10:48,526 INFO L241 Difference]: Finished difference. Result has 66 places, 48 transitions, 373 flow [2021-03-26 10:10:48,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=373, PETRI_PLACES=66, PETRI_TRANSITIONS=48} [2021-03-26 10:10:48,527 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2021-03-26 10:10:48,527 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:48,527 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 48 transitions, 373 flow [2021-03-26 10:10:48,527 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 48 transitions, 373 flow [2021-03-26 10:10:48,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 48 transitions, 373 flow [2021-03-26 10:10:48,544 INFO L129 PetriNetUnfolder]: 68/256 cut-off events. [2021-03-26 10:10:48,544 INFO L130 PetriNetUnfolder]: For 996/1283 co-relation queries the response was YES. [2021-03-26 10:10:48,545 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 256 events. 68/256 cut-off events. For 996/1283 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 1705 event pairs, 5 based on Foata normal form. 5/245 useless extension candidates. Maximal degree in co-relation 1100. Up to 157 conditions per place. [2021-03-26 10:10:48,547 INFO L142 LiptonReduction]: Number of co-enabled transitions 516 [2021-03-26 10:10:48,571 INFO L154 LiptonReduction]: Checked pairs total: 76 [2021-03-26 10:10:48,571 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:10:48,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44 [2021-03-26 10:10:48,573 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 355 flow [2021-03-26 10:10:48,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,574 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:48,574 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:48,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:10:48,574 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:48,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1416294070, now seen corresponding path program 1 times [2021-03-26 10:10:48,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:48,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049052968] [2021-03-26 10:10:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:48,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:48,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:48,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049052968] [2021-03-26 10:10:48,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:48,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:48,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959123239] [2021-03-26 10:10:48,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:48,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:48,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:48,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:48,602 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 184 [2021-03-26 10:10:48,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:48,603 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 184 [2021-03-26 10:10:48,603 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:48,626 INFO L129 PetriNetUnfolder]: 60/214 cut-off events. [2021-03-26 10:10:48,627 INFO L130 PetriNetUnfolder]: For 933/968 co-relation queries the response was YES. [2021-03-26 10:10:48,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 214 events. 60/214 cut-off events. For 933/968 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1193 event pairs, 8 based on Foata normal form. 9/214 useless extension candidates. Maximal degree in co-relation 939. Up to 129 conditions per place. [2021-03-26 10:10:48,628 INFO L132 encePairwiseOnDemand]: 180/184 looper letters, 3 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2021-03-26 10:10:48,628 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 39 transitions, 310 flow [2021-03-26 10:10:48,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2021-03-26 10:10:48,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8822463768115942 [2021-03-26 10:10:48,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2021-03-26 10:10:48,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2021-03-26 10:10:48,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:48,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2021-03-26 10:10:48,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,631 INFO L185 Difference]: Start difference. First operand has 65 places, 45 transitions, 355 flow. Second operand 3 states and 487 transitions. [2021-03-26 10:10:48,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 39 transitions, 310 flow [2021-03-26 10:10:48,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 39 transitions, 272 flow, removed 11 selfloop flow, removed 7 redundant places. [2021-03-26 10:10:48,635 INFO L241 Difference]: Finished difference. Result has 56 places, 39 transitions, 271 flow [2021-03-26 10:10:48,635 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=271, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2021-03-26 10:10:48,635 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2021-03-26 10:10:48,635 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:48,636 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 39 transitions, 271 flow [2021-03-26 10:10:48,636 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 39 transitions, 271 flow [2021-03-26 10:10:48,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 39 transitions, 271 flow [2021-03-26 10:10:48,650 INFO L129 PetriNetUnfolder]: 60/215 cut-off events. [2021-03-26 10:10:48,650 INFO L130 PetriNetUnfolder]: For 385/394 co-relation queries the response was YES. [2021-03-26 10:10:48,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 215 events. 60/215 cut-off events. For 385/394 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1228 event pairs, 8 based on Foata normal form. 1/205 useless extension candidates. Maximal degree in co-relation 738. Up to 85 conditions per place. [2021-03-26 10:10:48,652 INFO L142 LiptonReduction]: Number of co-enabled transitions 280 [2021-03-26 10:10:48,654 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:10:48,654 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:48,654 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-26 10:10:48,654 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 271 flow [2021-03-26 10:10:48,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,655 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:48,655 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:48,655 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:10:48,655 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:48,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1300194258, now seen corresponding path program 1 times [2021-03-26 10:10:48,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:48,655 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485463922] [2021-03-26 10:10:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:48,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:48,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:48,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:10:48,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485463922] [2021-03-26 10:10:48,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:48,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:48,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549677446] [2021-03-26 10:10:48,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:48,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:48,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:48,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:48,700 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 184 [2021-03-26 10:10:48,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:48,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 184 [2021-03-26 10:10:48,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:48,753 INFO L129 PetriNetUnfolder]: 119/291 cut-off events. [2021-03-26 10:10:48,753 INFO L130 PetriNetUnfolder]: For 456/652 co-relation queries the response was YES. [2021-03-26 10:10:48,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 291 events. 119/291 cut-off events. For 456/652 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1594 event pairs, 0 based on Foata normal form. 58/306 useless extension candidates. Maximal degree in co-relation 1094. Up to 125 conditions per place. [2021-03-26 10:10:48,755 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 5 selfloop transitions, 11 changer transitions 13/46 dead transitions. [2021-03-26 10:10:48,755 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 46 transitions, 347 flow [2021-03-26 10:10:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1093 transitions. [2021-03-26 10:10:48,757 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8486024844720497 [2021-03-26 10:10:48,757 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1093 transitions. [2021-03-26 10:10:48,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1093 transitions. [2021-03-26 10:10:48,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:48,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1093 transitions. [2021-03-26 10:10:48,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.14285714285714) internal successors, (1093), 7 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,761 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 184.0) internal successors, (1472), 8 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:48,761 INFO L185 Difference]: Start difference. First operand has 56 places, 39 transitions, 271 flow. Second operand 7 states and 1093 transitions. [2021-03-26 10:10:48,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 46 transitions, 347 flow [2021-03-26 10:10:48,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 316 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:48,763 INFO L241 Difference]: Finished difference. Result has 63 places, 31 transitions, 222 flow [2021-03-26 10:10:48,763 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=222, PETRI_PLACES=63, PETRI_TRANSITIONS=31} [2021-03-26 10:10:48,764 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2021-03-26 10:10:48,764 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:48,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 31 transitions, 222 flow [2021-03-26 10:10:48,764 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 31 transitions, 222 flow [2021-03-26 10:10:48,764 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 31 transitions, 222 flow [2021-03-26 10:10:48,769 INFO L129 PetriNetUnfolder]: 13/66 cut-off events. [2021-03-26 10:10:48,769 INFO L130 PetriNetUnfolder]: For 131/136 co-relation queries the response was YES. [2021-03-26 10:10:48,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 66 events. 13/66 cut-off events. For 131/136 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 209 event pairs, 0 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 255. Up to 27 conditions per place. [2021-03-26 10:10:48,770 INFO L142 LiptonReduction]: Number of co-enabled transitions 120 [2021-03-26 10:10:48,929 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:49,300 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2021-03-26 10:10:49,417 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:10:49,680 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:49,806 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:50,112 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:10:50,252 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2021-03-26 10:10:50,452 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 71 [2021-03-26 10:10:50,749 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 90 [2021-03-26 10:10:51,441 WARN L205 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:10:51,678 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:10:53,010 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 349 DAG size of output: 270 [2021-03-26 10:10:53,480 WARN L205 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:10:53,633 INFO L154 LiptonReduction]: Checked pairs total: 50 [2021-03-26 10:10:53,634 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-26 10:10:53,634 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4870 [2021-03-26 10:10:53,634 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 26 transitions, 212 flow [2021-03-26 10:10:53,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:53,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:53,635 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:53,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:10:53,635 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash -559594899, now seen corresponding path program 1 times [2021-03-26 10:10:53,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:53,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85397996] [2021-03-26 10:10:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:53,658 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:53,686 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:53,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:10:53,715 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:10:53,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:10:53,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:10:53 BasicIcfg [2021-03-26 10:10:53,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:10:53,793 INFO L168 Benchmark]: Toolchain (without parser) took 22519.88 ms. Allocated memory was 371.2 MB in the beginning and 748.7 MB in the end (delta: 377.5 MB). Free memory was 333.8 MB in the beginning and 472.6 MB in the end (delta: -138.8 MB). Peak memory consumption was 240.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:53,793 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 371.2 MB. Free memory was 352.6 MB in the beginning and 352.5 MB in the end (delta: 75.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:10:53,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.43 ms. Allocated memory is still 371.2 MB. Free memory was 333.6 MB in the beginning and 330.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:53,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.16 ms. Allocated memory is still 371.2 MB. Free memory was 330.2 MB in the beginning and 327.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:53,793 INFO L168 Benchmark]: Boogie Preprocessor took 29.64 ms. Allocated memory is still 371.2 MB. Free memory was 327.1 MB in the beginning and 325.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:53,793 INFO L168 Benchmark]: RCFGBuilder took 1275.66 ms. Allocated memory is still 371.2 MB. Free memory was 325.0 MB in the beginning and 316.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 172.5 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:53,794 INFO L168 Benchmark]: TraceAbstraction took 20623.58 ms. Allocated memory was 371.2 MB in the beginning and 748.7 MB in the end (delta: 377.5 MB). Free memory was 316.0 MB in the beginning and 472.6 MB in the end (delta: -156.5 MB). Peak memory consumption was 222.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:53,794 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.16 ms. Allocated memory is still 371.2 MB. Free memory was 352.6 MB in the beginning and 352.5 MB in the end (delta: 75.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 525.43 ms. Allocated memory is still 371.2 MB. Free memory was 333.6 MB in the beginning and 330.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 61.16 ms. Allocated memory is still 371.2 MB. Free memory was 330.2 MB in the beginning and 327.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.64 ms. Allocated memory is still 371.2 MB. Free memory was 327.1 MB in the beginning and 325.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1275.66 ms. Allocated memory is still 371.2 MB. Free memory was 325.0 MB in the beginning and 316.0 MB in the end (delta: 8.9 MB). Peak memory consumption was 172.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20623.58 ms. Allocated memory was 371.2 MB in the beginning and 748.7 MB in the end (delta: 377.5 MB). Free memory was 316.0 MB in the beginning and 472.6 MB in the end (delta: -156.5 MB). Peak memory consumption was 222.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7588.7ms, 105 PlacesBefore, 49 PlacesAfterwards, 97 TransitionsBefore, 40 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2726 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 1527, positive unconditional: 0, negative: 74, negative conditional: 74, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1212, positive: 1177, positive conditional: 0, positive unconditional: 1177, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1212, positive: 1171, positive conditional: 0, positive unconditional: 1171, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 443, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 430, negative conditional: 0, negative unconditional: 430, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1601, positive: 350, positive conditional: 0, positive unconditional: 350, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1177, Positive conditional cache size: 0, Positive unconditional cache size: 1177, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2775.3ms, 46 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1054 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 306, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, positive: 46, positive conditional: 2, positive unconditional: 44, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 430, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 383, negative conditional: 101, negative unconditional: 282, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 384, positive: 260, positive conditional: 7, positive unconditional: 253, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 68, unknown conditional: 4, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1223, Positive conditional cache size: 2, Positive unconditional cache size: 1221, Negative cache size: 57, Negative conditional cache size: 2, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1082.4ms, 33 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 633 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 77, negative conditional: 0, negative unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1293, Positive cache size: 1230, Positive conditional cache size: 2, Positive unconditional cache size: 1228, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 56, positive conditional: 56, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1236, Positive conditional cache size: 2, Positive unconditional cache size: 1234, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 679.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 326 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 96, positive conditional: 96, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, positive: 96, positive conditional: 12, positive unconditional: 84, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 96, positive conditional: 12, positive unconditional: 84, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 2, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, positive: 90, positive conditional: 10, positive unconditional: 80, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1242, Positive conditional cache size: 4, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.9ms, 43 PlacesBefore, 43 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 346 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 210 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 61, positive conditional: 61, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 75, positive: 61, positive conditional: 4, positive unconditional: 57, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 75, positive: 61, positive conditional: 4, positive unconditional: 57, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 75, positive: 61, positive conditional: 4, positive unconditional: 57, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1306, Positive cache size: 1242, Positive conditional cache size: 4, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.4ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, positive: 67, positive conditional: 12, positive unconditional: 55, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 67, positive conditional: 12, positive unconditional: 55, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, positive: 62, positive conditional: 7, positive unconditional: 55, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1311, Positive cache size: 1247, Positive conditional cache size: 9, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, positive: 57, positive conditional: 57, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, positive: 57, positive conditional: 5, positive unconditional: 52, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 57, positive conditional: 5, positive unconditional: 52, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 56, positive conditional: 4, positive unconditional: 52, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1248, Positive conditional cache size: 10, Positive unconditional cache size: 1238, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.5ms, 56 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 371 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 138, positive: 115, positive conditional: 115, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 138, positive: 115, positive conditional: 17, positive unconditional: 98, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 115, positive conditional: 17, positive unconditional: 98, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 138, positive: 114, positive conditional: 17, positive unconditional: 97, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1313, Positive cache size: 1249, Positive conditional cache size: 10, Positive unconditional cache size: 1239, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 41.2ms, 61 PlacesBefore, 61 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 258 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62, positive: 50, positive conditional: 20, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 50, positive conditional: 20, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 62, positive: 50, positive conditional: 20, positive unconditional: 30, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1313, Positive cache size: 1249, Positive conditional cache size: 10, Positive unconditional cache size: 1239, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 705.6ms, 65 PlacesBefore, 64 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 43, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, positive: 43, positive conditional: 27, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 43, positive conditional: 27, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 43, positive: 37, positive conditional: 22, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1319, Positive cache size: 1255, Positive conditional cache size: 15, Positive unconditional cache size: 1240, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.4ms, 66 PlacesBefore, 65 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 516 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 76 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 76, positive conditional: 76, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, positive: 76, positive conditional: 53, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 76, positive conditional: 53, positive unconditional: 23, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 16, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 57, positive conditional: 37, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 19, unknown conditional: 16, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1274, Positive conditional cache size: 31, Positive unconditional cache size: 1243, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.9ms, 56 PlacesBefore, 56 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 280 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1338, Positive cache size: 1274, Positive conditional cache size: 31, Positive unconditional cache size: 1243, Negative cache size: 64, Negative conditional cache size: 2, Negative unconditional cache size: 62, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4869.7ms, 63 PlacesBefore, 55 PlacesAfterwards, 31 TransitionsBefore, 26 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 4 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 50 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 50, positive conditional: 15, positive unconditional: 35, negative: 10, negative conditional: 8, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 50, positive conditional: 15, positive unconditional: 35, negative: 10, negative conditional: 8, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 10, positive conditional: 6, positive unconditional: 4, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 90, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 79, negative conditional: 70, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 40, positive conditional: 9, positive unconditional: 31, negative: 5, negative conditional: 4, negative unconditional: 1, unknown: 15, unknown conditional: 10, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1353, Positive cache size: 1284, Positive conditional cache size: 37, Positive unconditional cache size: 1247, Negative cache size: 69, Negative conditional cache size: 6, Negative unconditional cache size: 63, Eliminated conditions: 37 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1208; [L824] FCALL, FORK 0 pthread_create(&t1208, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1209; [L826] FCALL, FORK 0 pthread_create(&t1209, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1210; [L828] FCALL, FORK 0 pthread_create(&t1210, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y = 1 [L766] 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) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] 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) [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 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 [L801] 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) [L801] 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) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 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 [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 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 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] 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) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] 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) [L834] 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) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 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 [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 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 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20409.2ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1073.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7682.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 46 SDtfs, 23 SDslu, 19 SDs, 0 SdLazy, 257 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 295.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 279.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=9, InterpolantAutomatonStates: 59, 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: 41.3ms SsaConstructionTime, 337.2ms SatisfiabilityAnalysisTime, 698.8ms InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...