/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:13:07,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:13:07,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:13:07,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:13:07,107 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:13:07,108 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:13:07,109 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:13:07,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:13:07,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:13:07,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:13:07,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:13:07,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:13:07,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:13:07,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:13:07,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:13:07,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:13:07,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:13:07,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:13:07,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:13:07,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:13:07,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:13:07,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:13:07,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:13:07,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:13:07,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:13:07,126 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:13:07,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:13:07,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:13:07,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:13:07,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:13:07,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:13:07,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:13:07,129 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:13:07,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:13:07,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:13:07,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:13:07,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:13:07,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:13:07,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:13:07,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:13:07,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:13:07,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:13:07,153 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:13:07,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:13:07,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:13:07,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:13:07,155 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:13:07,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:13:07,155 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:13:07,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:13:07,155 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:13:07,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:13:07,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:13:07,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:13:07,157 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 00:13:07,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:13:07,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:13:07,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:13:07,465 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:13:07,466 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:13:07,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i [2021-03-26 00:13:07,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d7bc5b8/ca3ef6dc8da74cef931e31b2e5927d84/FLAGeb8e037ca [2021-03-26 00:13:07,937 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:13:07,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_rmo.opt.i [2021-03-26 00:13:07,952 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d7bc5b8/ca3ef6dc8da74cef931e31b2e5927d84/FLAGeb8e037ca [2021-03-26 00:13:08,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0d7bc5b8/ca3ef6dc8da74cef931e31b2e5927d84 [2021-03-26 00:13:08,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:13:08,286 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:13:08,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:13:08,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:13:08,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:13:08,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1a31a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08, skipping insertion in model container [2021-03-26 00:13:08,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:13:08,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:13:08,451 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/mix029_rmo.opt.i[948,961] [2021-03-26 00:13:08,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:13:08,658 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:13:08,666 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/mix029_rmo.opt.i[948,961] [2021-03-26 00:13:08,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:13:08,760 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:13:08,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08 WrapperNode [2021-03-26 00:13:08,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:13:08,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:13:08,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:13:08,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:13:08,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,796 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:13:08,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:13:08,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:13:08,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:13:08,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... [2021-03-26 00:13:08,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:13:08,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:13:08,875 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:13:08,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:13:08,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:13:08,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:13:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:13:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:13:08,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:13:08,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:13:08,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:13:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:13:08,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:13:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 00:13:08,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 00:13:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 00:13:08,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 00:13:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:13:08,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:13:08,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:13:08,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:13:08,942 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 00:13:10,317 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:13:10,317 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:13:10,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:13:10 BoogieIcfgContainer [2021-03-26 00:13:10,319 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:13:10,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:13:10,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:13:10,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:13:10,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:13:08" (1/3) ... [2021-03-26 00:13:10,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7046e131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:13:10, skipping insertion in model container [2021-03-26 00:13:10,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:13:08" (2/3) ... [2021-03-26 00:13:10,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7046e131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:13:10, skipping insertion in model container [2021-03-26 00:13:10,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:13:10" (3/3) ... [2021-03-26 00:13:10,323 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_rmo.opt.i [2021-03-26 00:13:10,328 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:13:10,331 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:13:10,332 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:13:10,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,355 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,356 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,357 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,358 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,359 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,359 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,360 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,363 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,364 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,365 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,367 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,368 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,369 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,370 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,370 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,371 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,372 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,373 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:13:10,374 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:13:10,387 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 00:13:10,401 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:13:10,401 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:13:10,401 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:13:10,402 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:13:10,402 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:13:10,402 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:13:10,402 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:13:10,402 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:13:10,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-26 00:13:10,437 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-26 00:13:10,437 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:10,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:13:10,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-26 00:13:10,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-26 00:13:10,443 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:10,451 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-26 00:13:10,453 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-26 00:13:10,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-26 00:13:10,467 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-26 00:13:10,468 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:10,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-26 00:13:10,470 INFO L142 LiptonReduction]: Number of co-enabled transitions 2630 [2021-03-26 00:13:11,751 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:13:12,079 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:13:12,186 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 00:13:13,098 WARN L205 SmtUtils]: Spent 881.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-26 00:13:13,348 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 00:13:14,600 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-26 00:13:15,231 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 00:13:16,441 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:13:16,706 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 00:13:17,343 WARN L205 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:13:17,924 WARN L205 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:13:18,359 INFO L154 LiptonReduction]: Checked pairs total: 5205 [2021-03-26 00:13:18,359 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-26 00:13:18,360 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7918 [2021-03-26 00:13:18,367 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-26 00:13:18,367 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:18,367 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:18,368 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 00:13:18,368 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 595482538, now seen corresponding path program 1 times [2021-03-26 00:13:18,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:18,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432278651] [2021-03-26 00:13:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:18,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:18,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:18,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:18,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:18,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432278651] [2021-03-26 00:13:18,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:18,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:18,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965027633] [2021-03-26 00:13:18,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:13:18,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:18,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:13:18,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:13:18,611 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 190 [2021-03-26 00:13:18,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:18,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:18,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 190 [2021-03-26 00:13:18,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:18,703 INFO L129 PetriNetUnfolder]: 69/206 cut-off events. [2021-03-26 00:13:18,703 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:18,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 206 events. 69/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 954 event pairs, 39 based on Foata normal form. 10/194 useless extension candidates. Maximal degree in co-relation 315. Up to 89 conditions per place. [2021-03-26 00:13:18,706 INFO L132 encePairwiseOnDemand]: 186/190 looper letters, 9 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-26 00:13:18,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 136 flow [2021-03-26 00:13:18,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-26 00:13:18,719 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9175438596491228 [2021-03-26 00:13:18,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-26 00:13:18,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-26 00:13:18,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:18,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-26 00:13:18,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:18,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:18,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:18,734 INFO L185 Difference]: Start difference. First operand has 59 places, 47 transitions, 106 flow. Second operand 3 states and 523 transitions. [2021-03-26 00:13:18,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 136 flow [2021-03-26 00:13:18,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 00:13:18,737 INFO L241 Difference]: Finished difference. Result has 55 places, 40 transitions, 92 flow [2021-03-26 00:13:18,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=190, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2021-03-26 00:13:18,738 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2021-03-26 00:13:18,739 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:18,739 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 40 transitions, 92 flow [2021-03-26 00:13:18,742 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 40 transitions, 92 flow [2021-03-26 00:13:18,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2021-03-26 00:13:18,749 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 00:13:18,749 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:18,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:13:18,754 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 00:13:19,331 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 00:13:19,618 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 00:13:20,905 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 270 DAG size of output: 269 [2021-03-26 00:13:21,560 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 00:13:22,299 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 00:13:23,020 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:13:23,182 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:13:23,512 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-26 00:13:23,645 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-26 00:13:23,658 INFO L154 LiptonReduction]: Checked pairs total: 2544 [2021-03-26 00:13:23,658 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 00:13:23,658 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4919 [2021-03-26 00:13:23,660 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-26 00:13:23,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,660 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:23,661 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:23,661 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:13:23,661 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:23,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1052868086, now seen corresponding path program 1 times [2021-03-26 00:13:23,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:23,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574215245] [2021-03-26 00:13:23,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:23,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:23,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:23,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:23,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:23,823 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 00:13:23,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 00:13:23,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:23,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574215245] [2021-03-26 00:13:23,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:23,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:23,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544570038] [2021-03-26 00:13:23,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:23,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:23,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:23,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:23,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 202 [2021-03-26 00:13:23,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:23,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 202 [2021-03-26 00:13:23,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:23,845 INFO L129 PetriNetUnfolder]: 7/50 cut-off events. [2021-03-26 00:13:23,845 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:23,845 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 50 events. 7/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 116 event pairs, 3 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 72. Up to 18 conditions per place. [2021-03-26 00:13:23,846 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 4 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-26 00:13:23,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 86 flow [2021-03-26 00:13:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2021-03-26 00:13:23,850 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8844884488448845 [2021-03-26 00:13:23,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2021-03-26 00:13:23,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2021-03-26 00:13:23,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:23,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2021-03-26 00:13:23,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,852 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 536 transitions. [2021-03-26 00:13:23,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 86 flow [2021-03-26 00:13:23,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:13:23,853 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 83 flow [2021-03-26 00:13:23,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-03-26 00:13:23,854 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -19 predicate places. [2021-03-26 00:13:23,854 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:23,854 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 83 flow [2021-03-26 00:13:23,854 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 83 flow [2021-03-26 00:13:23,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 83 flow [2021-03-26 00:13:23,858 INFO L129 PetriNetUnfolder]: 3/38 cut-off events. [2021-03-26 00:13:23,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:13:23,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 38 events. 3/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 84 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-26 00:13:23,861 INFO L142 LiptonReduction]: Number of co-enabled transitions 436 [2021-03-26 00:13:23,867 INFO L154 LiptonReduction]: Checked pairs total: 460 [2021-03-26 00:13:23,867 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:23,867 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-26 00:13:23,869 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 83 flow [2021-03-26 00:13:23,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:23,871 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:23,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:13:23,871 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:23,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:23,871 INFO L82 PathProgramCache]: Analyzing trace with hash 529659452, now seen corresponding path program 1 times [2021-03-26 00:13:23,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:23,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084722017] [2021-03-26 00:13:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:23,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:23,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:23,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084722017] [2021-03-26 00:13:23,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:23,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 00:13:23,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167718161] [2021-03-26 00:13:23,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:13:23,974 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:23,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:13:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:13:23,975 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 202 [2021-03-26 00:13:23,976 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,976 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:23,976 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 202 [2021-03-26 00:13:23,976 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:23,983 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-03-26 00:13:23,983 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 00:13:23,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 36 events. 2/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 64 event pairs, 0 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 53. Up to 8 conditions per place. [2021-03-26 00:13:23,984 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 1 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2021-03-26 00:13:23,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 89 flow [2021-03-26 00:13:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-26 00:13:23,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9026402640264026 [2021-03-26 00:13:23,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-26 00:13:23,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-26 00:13:23,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:23,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-26 00:13:23,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,988 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:23,988 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 83 flow. Second operand 3 states and 547 transitions. [2021-03-26 00:13:23,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 89 flow [2021-03-26 00:13:23,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 86 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:23,989 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 88 flow [2021-03-26 00:13:23,999 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-03-26 00:13:24,000 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -17 predicate places. [2021-03-26 00:13:24,000 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:24,000 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 88 flow [2021-03-26 00:13:24,000 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 88 flow [2021-03-26 00:13:24,000 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 88 flow [2021-03-26 00:13:24,003 INFO L129 PetriNetUnfolder]: 2/36 cut-off events. [2021-03-26 00:13:24,003 INFO L130 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2021-03-26 00:13:24,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 36 events. 2/36 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 51. Up to 8 conditions per place. [2021-03-26 00:13:24,004 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-26 00:13:24,081 INFO L154 LiptonReduction]: Checked pairs total: 443 [2021-03-26 00:13:24,081 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:24,081 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 81 [2021-03-26 00:13:24,082 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 88 flow [2021-03-26 00:13:24,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:24,083 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:24,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:13:24,083 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:24,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash -760427881, now seen corresponding path program 1 times [2021-03-26 00:13:24,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:24,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843857561] [2021-03-26 00:13:24,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:24,157 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 00:13:24,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:13:24,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:24,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:24,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843857561] [2021-03-26 00:13:24,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:24,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:24,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834410128] [2021-03-26 00:13:24,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:24,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:24,184 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 202 [2021-03-26 00:13:24,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:24,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 202 [2021-03-26 00:13:24,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:24,253 INFO L129 PetriNetUnfolder]: 106/231 cut-off events. [2021-03-26 00:13:24,253 INFO L130 PetriNetUnfolder]: For 63/74 co-relation queries the response was YES. [2021-03-26 00:13:24,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 231 events. 106/231 cut-off events. For 63/74 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1069 event pairs, 64 based on Foata normal form. 2/211 useless extension candidates. Maximal degree in co-relation 476. Up to 156 conditions per place. [2021-03-26 00:13:24,256 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 8 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2021-03-26 00:13:24,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 120 flow [2021-03-26 00:13:24,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:24,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2021-03-26 00:13:24,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8481848184818482 [2021-03-26 00:13:24,258 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2021-03-26 00:13:24,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2021-03-26 00:13:24,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:24,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2021-03-26 00:13:24,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,260 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 88 flow. Second operand 3 states and 514 transitions. [2021-03-26 00:13:24,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 120 flow [2021-03-26 00:13:24,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:13:24,262 INFO L241 Difference]: Finished difference. Result has 43 places, 33 transitions, 110 flow [2021-03-26 00:13:24,263 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2021-03-26 00:13:24,263 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -16 predicate places. [2021-03-26 00:13:24,263 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:24,263 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 33 transitions, 110 flow [2021-03-26 00:13:24,263 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 33 transitions, 110 flow [2021-03-26 00:13:24,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 33 transitions, 110 flow [2021-03-26 00:13:24,272 INFO L129 PetriNetUnfolder]: 19/78 cut-off events. [2021-03-26 00:13:24,273 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2021-03-26 00:13:24,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 78 events. 19/78 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 261 event pairs, 10 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 148. Up to 34 conditions per place. [2021-03-26 00:13:24,274 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-26 00:13:24,337 INFO L154 LiptonReduction]: Checked pairs total: 339 [2021-03-26 00:13:24,337 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:24,337 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 74 [2021-03-26 00:13:24,338 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 110 flow [2021-03-26 00:13:24,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:24,339 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:24,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:13:24,339 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:24,339 INFO L82 PathProgramCache]: Analyzing trace with hash -328943123, now seen corresponding path program 1 times [2021-03-26 00:13:24,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:24,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079382776] [2021-03-26 00:13:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:24,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:24,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:24,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:24,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:13:24,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:24,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:24,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079382776] [2021-03-26 00:13:24,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:24,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:24,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64478780] [2021-03-26 00:13:24,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:24,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:24,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:24,447 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 202 [2021-03-26 00:13:24,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:24,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 202 [2021-03-26 00:13:24,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:24,541 INFO L129 PetriNetUnfolder]: 101/225 cut-off events. [2021-03-26 00:13:24,541 INFO L130 PetriNetUnfolder]: For 166/233 co-relation queries the response was YES. [2021-03-26 00:13:24,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 225 events. 101/225 cut-off events. For 166/233 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1039 event pairs, 60 based on Foata normal form. 13/221 useless extension candidates. Maximal degree in co-relation 546. Up to 143 conditions per place. [2021-03-26 00:13:24,543 INFO L132 encePairwiseOnDemand]: 196/202 looper letters, 10 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2021-03-26 00:13:24,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 168 flow [2021-03-26 00:13:24,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:24,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:24,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2021-03-26 00:13:24,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8044554455445545 [2021-03-26 00:13:24,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2021-03-26 00:13:24,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2021-03-26 00:13:24,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:24,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2021-03-26 00:13:24,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,549 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,549 INFO L185 Difference]: Start difference. First operand has 43 places, 33 transitions, 110 flow. Second operand 4 states and 650 transitions. [2021-03-26 00:13:24,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 168 flow [2021-03-26 00:13:24,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:24,551 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 162 flow [2021-03-26 00:13:24,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 00:13:24,551 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -12 predicate places. [2021-03-26 00:13:24,551 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:24,552 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 162 flow [2021-03-26 00:13:24,552 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 162 flow [2021-03-26 00:13:24,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 162 flow [2021-03-26 00:13:24,565 INFO L129 PetriNetUnfolder]: 26/92 cut-off events. [2021-03-26 00:13:24,565 INFO L130 PetriNetUnfolder]: For 152/170 co-relation queries the response was YES. [2021-03-26 00:13:24,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 92 events. 26/92 cut-off events. For 152/170 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 365 event pairs, 6 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 237. Up to 40 conditions per place. [2021-03-26 00:13:24,566 INFO L142 LiptonReduction]: Number of co-enabled transitions 574 [2021-03-26 00:13:24,642 INFO L154 LiptonReduction]: Checked pairs total: 459 [2021-03-26 00:13:24,642 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:24,643 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-03-26 00:13:24,644 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 162 flow [2021-03-26 00:13:24,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,645 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:24,645 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:24,645 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:13:24,645 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1525984110, now seen corresponding path program 1 times [2021-03-26 00:13:24,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:24,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126865850] [2021-03-26 00:13:24,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:24,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:24,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:24,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:24,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:24,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:13:24,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:24,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:13:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:24,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126865850] [2021-03-26 00:13:24,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:24,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:24,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138824867] [2021-03-26 00:13:24,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:24,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:24,724 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 202 [2021-03-26 00:13:24,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:24,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 202 [2021-03-26 00:13:24,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:24,812 INFO L129 PetriNetUnfolder]: 94/212 cut-off events. [2021-03-26 00:13:24,813 INFO L130 PetriNetUnfolder]: For 446/579 co-relation queries the response was YES. [2021-03-26 00:13:24,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 212 events. 94/212 cut-off events. For 446/579 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 947 event pairs, 30 based on Foata normal form. 18/214 useless extension candidates. Maximal degree in co-relation 635. Up to 124 conditions per place. [2021-03-26 00:13:24,814 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 13 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2021-03-26 00:13:24,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 234 flow [2021-03-26 00:13:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2021-03-26 00:13:24,829 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8341584158415841 [2021-03-26 00:13:24,829 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2021-03-26 00:13:24,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2021-03-26 00:13:24,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:24,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2021-03-26 00:13:24,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 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 00:13:24,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,832 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 162 flow. Second operand 4 states and 674 transitions. [2021-03-26 00:13:24,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 234 flow [2021-03-26 00:13:24,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 230 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-26 00:13:24,845 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 219 flow [2021-03-26 00:13:24,845 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2021-03-26 00:13:24,845 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2021-03-26 00:13:24,845 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:24,845 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 219 flow [2021-03-26 00:13:24,845 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 219 flow [2021-03-26 00:13:24,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 219 flow [2021-03-26 00:13:24,862 INFO L129 PetriNetUnfolder]: 73/181 cut-off events. [2021-03-26 00:13:24,862 INFO L130 PetriNetUnfolder]: For 640/687 co-relation queries the response was YES. [2021-03-26 00:13:24,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 181 events. 73/181 cut-off events. For 640/687 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 837 event pairs, 25 based on Foata normal form. 2/162 useless extension candidates. Maximal degree in co-relation 586. Up to 88 conditions per place. [2021-03-26 00:13:24,880 INFO L142 LiptonReduction]: Number of co-enabled transitions 630 [2021-03-26 00:13:24,948 INFO L154 LiptonReduction]: Checked pairs total: 407 [2021-03-26 00:13:24,948 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:24,948 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 103 [2021-03-26 00:13:24,949 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 219 flow [2021-03-26 00:13:24,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 164.8) internal successors, (824), 5 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:24,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:24,949 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:24,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:13:24,949 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:24,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1925293356, now seen corresponding path program 1 times [2021-03-26 00:13:24,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:24,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635892980] [2021-03-26 00:13:24,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:25,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:25,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:25,023 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 00:13:25,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 00:13:25,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:13:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:25,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635892980] [2021-03-26 00:13:25,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:25,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:25,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176824252] [2021-03-26 00:13:25,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:25,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:25,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:25,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:25,043 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2021-03-26 00:13:25,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:25,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2021-03-26 00:13:25,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:25,133 INFO L129 PetriNetUnfolder]: 110/255 cut-off events. [2021-03-26 00:13:25,134 INFO L130 PetriNetUnfolder]: For 744/971 co-relation queries the response was YES. [2021-03-26 00:13:25,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 255 events. 110/255 cut-off events. For 744/971 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1224 event pairs, 11 based on Foata normal form. 28/271 useless extension candidates. Maximal degree in co-relation 877. Up to 132 conditions per place. [2021-03-26 00:13:25,136 INFO L132 encePairwiseOnDemand]: 194/202 looper letters, 14 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2021-03-26 00:13:25,136 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 309 flow [2021-03-26 00:13:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:13:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:13:25,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2021-03-26 00:13:25,138 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8128712871287128 [2021-03-26 00:13:25,138 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2021-03-26 00:13:25,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2021-03-26 00:13:25,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:25,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2021-03-26 00:13:25,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,142 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,142 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 219 flow. Second operand 5 states and 821 transitions. [2021-03-26 00:13:25,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 309 flow [2021-03-26 00:13:25,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 49 transitions, 296 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:25,146 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 260 flow [2021-03-26 00:13:25,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-26 00:13:25,147 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2021-03-26 00:13:25,147 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:25,147 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 260 flow [2021-03-26 00:13:25,147 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 260 flow [2021-03-26 00:13:25,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 260 flow [2021-03-26 00:13:25,169 INFO L129 PetriNetUnfolder]: 92/208 cut-off events. [2021-03-26 00:13:25,169 INFO L130 PetriNetUnfolder]: For 1002/1066 co-relation queries the response was YES. [2021-03-26 00:13:25,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 208 events. 92/208 cut-off events. For 1002/1066 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 941 event pairs, 19 based on Foata normal form. 1/190 useless extension candidates. Maximal degree in co-relation 769. Up to 98 conditions per place. [2021-03-26 00:13:25,172 INFO L142 LiptonReduction]: Number of co-enabled transitions 692 [2021-03-26 00:13:25,177 INFO L154 LiptonReduction]: Checked pairs total: 480 [2021-03-26 00:13:25,177 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:25,178 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-26 00:13:25,179 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 260 flow [2021-03-26 00:13:25,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.0) internal successors, (805), 5 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:25,180 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:25,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:13:25,180 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:25,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash 571854806, now seen corresponding path program 2 times [2021-03-26 00:13:25,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:25,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392168382] [2021-03-26 00:13:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:25,250 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 00:13:25,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 00:13:25,269 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 00:13:25,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 00:13:25,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:13:25,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 00:13:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:25,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392168382] [2021-03-26 00:13:25,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:25,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:13:25,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223959646] [2021-03-26 00:13:25,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:13:25,318 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:13:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:13:25,319 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 202 [2021-03-26 00:13:25,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:25,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 202 [2021-03-26 00:13:25,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:25,408 INFO L129 PetriNetUnfolder]: 110/240 cut-off events. [2021-03-26 00:13:25,408 INFO L130 PetriNetUnfolder]: For 1177/1458 co-relation queries the response was YES. [2021-03-26 00:13:25,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 240 events. 110/240 cut-off events. For 1177/1458 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1085 event pairs, 21 based on Foata normal form. 37/259 useless extension candidates. Maximal degree in co-relation 975. Up to 137 conditions per place. [2021-03-26 00:13:25,411 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 15 selfloop transitions, 18 changer transitions 0/55 dead transitions. [2021-03-26 00:13:25,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 398 flow [2021-03-26 00:13:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:13:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:13:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 841 transitions. [2021-03-26 00:13:25,413 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8326732673267326 [2021-03-26 00:13:25,413 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 841 transitions. [2021-03-26 00:13:25,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 841 transitions. [2021-03-26 00:13:25,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:25,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 841 transitions. [2021-03-26 00:13:25,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.2) internal successors, (841), 5 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,416 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,416 INFO L185 Difference]: Start difference. First operand has 56 places, 45 transitions, 260 flow. Second operand 5 states and 841 transitions. [2021-03-26 00:13:25,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 398 flow [2021-03-26 00:13:25,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 366 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 00:13:25,420 INFO L241 Difference]: Finished difference. Result has 59 places, 51 transitions, 340 flow [2021-03-26 00:13:25,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=340, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2021-03-26 00:13:25,420 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2021-03-26 00:13:25,420 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:25,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 51 transitions, 340 flow [2021-03-26 00:13:25,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 51 transitions, 340 flow [2021-03-26 00:13:25,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 340 flow [2021-03-26 00:13:25,445 INFO L129 PetriNetUnfolder]: 91/208 cut-off events. [2021-03-26 00:13:25,445 INFO L130 PetriNetUnfolder]: For 1120/1237 co-relation queries the response was YES. [2021-03-26 00:13:25,446 INFO L84 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 208 events. 91/208 cut-off events. For 1120/1237 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 980 event pairs, 18 based on Foata normal form. 6/191 useless extension candidates. Maximal degree in co-relation 868. Up to 96 conditions per place. [2021-03-26 00:13:25,448 INFO L142 LiptonReduction]: Number of co-enabled transitions 768 [2021-03-26 00:13:25,499 INFO L154 LiptonReduction]: Checked pairs total: 718 [2021-03-26 00:13:25,499 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:25,499 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79 [2021-03-26 00:13:25,502 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 340 flow [2021-03-26 00:13:25,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 164.83333333333334) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:25,502 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:25,502 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:13:25,502 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:25,503 INFO L82 PathProgramCache]: Analyzing trace with hash 207421168, now seen corresponding path program 3 times [2021-03-26 00:13:25,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:25,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195049635] [2021-03-26 00:13:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:25,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:25,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:25,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:25,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:25,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195049635] [2021-03-26 00:13:25,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:25,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:25,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542409420] [2021-03-26 00:13:25,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:25,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:25,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:25,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:25,574 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 202 [2021-03-26 00:13:25,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:25,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 202 [2021-03-26 00:13:25,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:25,701 INFO L129 PetriNetUnfolder]: 128/277 cut-off events. [2021-03-26 00:13:25,701 INFO L130 PetriNetUnfolder]: For 1849/2232 co-relation queries the response was YES. [2021-03-26 00:13:25,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 277 events. 128/277 cut-off events. For 1849/2232 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1307 event pairs, 21 based on Foata normal form. 50/310 useless extension candidates. Maximal degree in co-relation 1298. Up to 156 conditions per place. [2021-03-26 00:13:25,704 INFO L132 encePairwiseOnDemand]: 194/202 looper letters, 19 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2021-03-26 00:13:25,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 507 flow [2021-03-26 00:13:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:13:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:13:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 987 transitions. [2021-03-26 00:13:25,706 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8143564356435643 [2021-03-26 00:13:25,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 987 transitions. [2021-03-26 00:13:25,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 987 transitions. [2021-03-26 00:13:25,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:25,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 987 transitions. [2021-03-26 00:13:25,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,710 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 202.0) internal successors, (1414), 7 states have internal predecessors, (1414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,710 INFO L185 Difference]: Start difference. First operand has 59 places, 51 transitions, 340 flow. Second operand 6 states and 987 transitions. [2021-03-26 00:13:25,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 507 flow [2021-03-26 00:13:25,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 476 flow, removed 9 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:25,713 INFO L241 Difference]: Finished difference. Result has 64 places, 58 transitions, 436 flow [2021-03-26 00:13:25,713 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=436, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2021-03-26 00:13:25,713 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2021-03-26 00:13:25,713 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:25,714 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 58 transitions, 436 flow [2021-03-26 00:13:25,714 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 58 transitions, 436 flow [2021-03-26 00:13:25,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 58 transitions, 436 flow [2021-03-26 00:13:25,739 INFO L129 PetriNetUnfolder]: 116/256 cut-off events. [2021-03-26 00:13:25,739 INFO L130 PetriNetUnfolder]: For 1637/1812 co-relation queries the response was YES. [2021-03-26 00:13:25,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 256 events. 116/256 cut-off events. For 1637/1812 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1229 event pairs, 19 based on Foata normal form. 26/264 useless extension candidates. Maximal degree in co-relation 1181. Up to 132 conditions per place. [2021-03-26 00:13:25,744 INFO L142 LiptonReduction]: Number of co-enabled transitions 888 [2021-03-26 00:13:25,795 INFO L154 LiptonReduction]: Checked pairs total: 1035 [2021-03-26 00:13:25,795 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:25,795 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 82 [2021-03-26 00:13:25,796 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 436 flow [2021-03-26 00:13:25,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,796 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:25,796 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:25,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:13:25,796 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash -701487242, now seen corresponding path program 4 times [2021-03-26 00:13:25,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:25,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307346158] [2021-03-26 00:13:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:25,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:13:25,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:13:25,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:13:25,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:25,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:13:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:25,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307346158] [2021-03-26 00:13:25,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:25,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:13:25,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618906989] [2021-03-26 00:13:25,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:13:25,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:13:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:13:25,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 202 [2021-03-26 00:13:25,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:25,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:25,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 202 [2021-03-26 00:13:25,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:26,009 INFO L129 PetriNetUnfolder]: 133/296 cut-off events. [2021-03-26 00:13:26,009 INFO L130 PetriNetUnfolder]: For 2609/3419 co-relation queries the response was YES. [2021-03-26 00:13:26,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1590 conditions, 296 events. 133/296 cut-off events. For 2609/3419 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1468 event pairs, 8 based on Foata normal form. 87/367 useless extension candidates. Maximal degree in co-relation 1564. Up to 154 conditions per place. [2021-03-26 00:13:26,012 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 12 selfloop transitions, 34 changer transitions 0/68 dead transitions. [2021-03-26 00:13:26,012 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 644 flow [2021-03-26 00:13:26,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:13:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:13:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1133 transitions. [2021-03-26 00:13:26,015 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8012729844413012 [2021-03-26 00:13:26,015 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1133 transitions. [2021-03-26 00:13:26,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1133 transitions. [2021-03-26 00:13:26,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:26,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1133 transitions. [2021-03-26 00:13:26,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.85714285714286) internal successors, (1133), 7 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,019 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,019 INFO L185 Difference]: Start difference. First operand has 64 places, 58 transitions, 436 flow. Second operand 7 states and 1133 transitions. [2021-03-26 00:13:26,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 644 flow [2021-03-26 00:13:26,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 68 transitions, 577 flow, removed 25 selfloop flow, removed 3 redundant places. [2021-03-26 00:13:26,023 INFO L241 Difference]: Finished difference. Result has 69 places, 64 transitions, 559 flow [2021-03-26 00:13:26,024 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=559, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2021-03-26 00:13:26,024 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 10 predicate places. [2021-03-26 00:13:26,024 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:26,024 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 64 transitions, 559 flow [2021-03-26 00:13:26,024 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 64 transitions, 559 flow [2021-03-26 00:13:26,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 64 transitions, 559 flow [2021-03-26 00:13:26,051 INFO L129 PetriNetUnfolder]: 121/272 cut-off events. [2021-03-26 00:13:26,051 INFO L130 PetriNetUnfolder]: For 1774/1940 co-relation queries the response was YES. [2021-03-26 00:13:26,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 272 events. 121/272 cut-off events. For 1774/1940 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1382 event pairs, 9 based on Foata normal form. 13/270 useless extension candidates. Maximal degree in co-relation 1353. Up to 142 conditions per place. [2021-03-26 00:13:26,055 INFO L142 LiptonReduction]: Number of co-enabled transitions 980 [2021-03-26 00:13:26,108 INFO L154 LiptonReduction]: Checked pairs total: 1279 [2021-03-26 00:13:26,109 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:26,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 85 [2021-03-26 00:13:26,111 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 559 flow [2021-03-26 00:13:26,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:26,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:26,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:13:26,112 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:26,112 INFO L82 PathProgramCache]: Analyzing trace with hash 40178958, now seen corresponding path program 1 times [2021-03-26 00:13:26,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:26,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680556919] [2021-03-26 00:13:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:26,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:26,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:26,160 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:26,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:26,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:26,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:26,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680556919] [2021-03-26 00:13:26,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:26,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:26,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606778506] [2021-03-26 00:13:26,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:26,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:26,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:26,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:26,167 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2021-03-26 00:13:26,168 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 559 flow. Second operand has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,168 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:26,168 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2021-03-26 00:13:26,168 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:26,312 INFO L129 PetriNetUnfolder]: 646/1167 cut-off events. [2021-03-26 00:13:26,312 INFO L130 PetriNetUnfolder]: For 4830/5507 co-relation queries the response was YES. [2021-03-26 00:13:26,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4499 conditions, 1167 events. 646/1167 cut-off events. For 4830/5507 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 7574 event pairs, 215 based on Foata normal form. 157/1130 useless extension candidates. Maximal degree in co-relation 4471. Up to 623 conditions per place. [2021-03-26 00:13:26,325 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 14 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2021-03-26 00:13:26,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 635 flow [2021-03-26 00:13:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:13:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:13:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 849 transitions. [2021-03-26 00:13:26,327 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8405940594059406 [2021-03-26 00:13:26,327 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 849 transitions. [2021-03-26 00:13:26,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 849 transitions. [2021-03-26 00:13:26,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:26,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 849 transitions. [2021-03-26 00:13:26,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,330 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 202.0) internal successors, (1212), 6 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,330 INFO L185 Difference]: Start difference. First operand has 69 places, 64 transitions, 559 flow. Second operand 5 states and 849 transitions. [2021-03-26 00:13:26,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 635 flow [2021-03-26 00:13:26,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 561 flow, removed 18 selfloop flow, removed 5 redundant places. [2021-03-26 00:13:26,340 INFO L241 Difference]: Finished difference. Result has 71 places, 73 transitions, 568 flow [2021-03-26 00:13:26,340 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2021-03-26 00:13:26,340 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2021-03-26 00:13:26,340 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:26,340 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 73 transitions, 568 flow [2021-03-26 00:13:26,340 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 73 transitions, 568 flow [2021-03-26 00:13:26,341 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 73 transitions, 568 flow [2021-03-26 00:13:26,432 INFO L129 PetriNetUnfolder]: 537/976 cut-off events. [2021-03-26 00:13:26,432 INFO L130 PetriNetUnfolder]: For 4193/4581 co-relation queries the response was YES. [2021-03-26 00:13:26,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 976 events. 537/976 cut-off events. For 4193/4581 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 6219 event pairs, 168 based on Foata normal form. 34/911 useless extension candidates. Maximal degree in co-relation 4272. Up to 483 conditions per place. [2021-03-26 00:13:26,448 INFO L142 LiptonReduction]: Number of co-enabled transitions 1312 [2021-03-26 00:13:26,466 INFO L154 LiptonReduction]: Checked pairs total: 736 [2021-03-26 00:13:26,466 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:26,466 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 126 [2021-03-26 00:13:26,467 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 568 flow [2021-03-26 00:13:26,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.75) internal successors, (663), 4 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,467 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:26,467 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:26,467 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:13:26,467 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:26,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:26,468 INFO L82 PathProgramCache]: Analyzing trace with hash 590074693, now seen corresponding path program 1 times [2021-03-26 00:13:26,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:26,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848137501] [2021-03-26 00:13:26,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:26,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:26,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:26,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:26,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:26,511 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:26,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:26,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:26,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:26,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848137501] [2021-03-26 00:13:26,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:26,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:13:26,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666154981] [2021-03-26 00:13:26,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:13:26,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:26,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:13:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:13:26,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2021-03-26 00:13:26,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 568 flow. Second operand has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:26,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2021-03-26 00:13:26,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:26,750 INFO L129 PetriNetUnfolder]: 433/855 cut-off events. [2021-03-26 00:13:26,751 INFO L130 PetriNetUnfolder]: For 3927/6484 co-relation queries the response was YES. [2021-03-26 00:13:26,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 855 events. 433/855 cut-off events. For 3927/6484 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 5348 event pairs, 44 based on Foata normal form. 308/1066 useless extension candidates. Maximal degree in co-relation 3836. Up to 481 conditions per place. [2021-03-26 00:13:26,783 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 15 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2021-03-26 00:13:26,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 85 transitions, 689 flow [2021-03-26 00:13:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:13:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:13:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1189 transitions. [2021-03-26 00:13:26,785 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8408769448373409 [2021-03-26 00:13:26,785 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1189 transitions. [2021-03-26 00:13:26,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1189 transitions. [2021-03-26 00:13:26,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:26,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1189 transitions. [2021-03-26 00:13:26,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.85714285714286) internal successors, (1189), 7 states have internal predecessors, (1189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,789 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,789 INFO L185 Difference]: Start difference. First operand has 71 places, 73 transitions, 568 flow. Second operand 7 states and 1189 transitions. [2021-03-26 00:13:26,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 85 transitions, 689 flow [2021-03-26 00:13:26,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 85 transitions, 684 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:26,793 INFO L241 Difference]: Finished difference. Result has 79 places, 79 transitions, 678 flow [2021-03-26 00:13:26,793 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=678, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2021-03-26 00:13:26,794 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 20 predicate places. [2021-03-26 00:13:26,794 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:26,794 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 79 transitions, 678 flow [2021-03-26 00:13:26,794 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 79 transitions, 678 flow [2021-03-26 00:13:26,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 678 flow [2021-03-26 00:13:26,929 INFO L129 PetriNetUnfolder]: 328/689 cut-off events. [2021-03-26 00:13:26,930 INFO L130 PetriNetUnfolder]: For 3980/4647 co-relation queries the response was YES. [2021-03-26 00:13:26,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 689 events. 328/689 cut-off events. For 3980/4647 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4578 event pairs, 42 based on Foata normal form. 54/689 useless extension candidates. Maximal degree in co-relation 3613. Up to 383 conditions per place. [2021-03-26 00:13:26,938 INFO L142 LiptonReduction]: Number of co-enabled transitions 1468 [2021-03-26 00:13:26,962 INFO L154 LiptonReduction]: Checked pairs total: 698 [2021-03-26 00:13:26,962 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:26,962 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 168 [2021-03-26 00:13:26,963 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 678 flow [2021-03-26 00:13:26,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:26,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:26,964 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:26,964 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:13:26,964 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:26,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:26,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1680154239, now seen corresponding path program 1 times [2021-03-26 00:13:26,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:26,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344010738] [2021-03-26 00:13:26,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:27,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:27,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:27,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:27,045 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:27,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:27,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:27,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:27,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344010738] [2021-03-26 00:13:27,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:27,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:13:27,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950551380] [2021-03-26 00:13:27,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:13:27,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:27,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:13:27,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:13:27,053 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2021-03-26 00:13:27,053 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 678 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,053 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:27,053 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2021-03-26 00:13:27,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:27,201 INFO L129 PetriNetUnfolder]: 309/652 cut-off events. [2021-03-26 00:13:27,201 INFO L130 PetriNetUnfolder]: For 3964/8314 co-relation queries the response was YES. [2021-03-26 00:13:27,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3449 conditions, 652 events. 309/652 cut-off events. For 3964/8314 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 4053 event pairs, 4 based on Foata normal form. 411/975 useless extension candidates. Maximal degree in co-relation 3415. Up to 454 conditions per place. [2021-03-26 00:13:27,208 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 11 selfloop transitions, 28 changer transitions 4/86 dead transitions. [2021-03-26 00:13:27,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 807 flow [2021-03-26 00:13:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 00:13:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 00:13:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1529 transitions. [2021-03-26 00:13:27,211 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.841034103410341 [2021-03-26 00:13:27,211 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1529 transitions. [2021-03-26 00:13:27,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1529 transitions. [2021-03-26 00:13:27,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:27,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1529 transitions. [2021-03-26 00:13:27,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.88888888888889) internal successors, (1529), 9 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,216 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 202.0) internal successors, (2020), 10 states have internal predecessors, (2020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,216 INFO L185 Difference]: Start difference. First operand has 79 places, 79 transitions, 678 flow. Second operand 9 states and 1529 transitions. [2021-03-26 00:13:27,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 807 flow [2021-03-26 00:13:27,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 86 transitions, 717 flow, removed 24 selfloop flow, removed 8 redundant places. [2021-03-26 00:13:27,226 INFO L241 Difference]: Finished difference. Result has 82 places, 79 transitions, 681 flow [2021-03-26 00:13:27,226 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=681, PETRI_PLACES=82, PETRI_TRANSITIONS=79} [2021-03-26 00:13:27,226 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 23 predicate places. [2021-03-26 00:13:27,226 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:27,227 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 79 transitions, 681 flow [2021-03-26 00:13:27,227 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 79 transitions, 681 flow [2021-03-26 00:13:27,227 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 681 flow [2021-03-26 00:13:27,263 INFO L129 PetriNetUnfolder]: 202/484 cut-off events. [2021-03-26 00:13:27,263 INFO L130 PetriNetUnfolder]: For 2921/3250 co-relation queries the response was YES. [2021-03-26 00:13:27,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 484 events. 202/484 cut-off events. For 2921/3250 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 3187 event pairs, 5 based on Foata normal form. 23/458 useless extension candidates. Maximal degree in co-relation 2393. Up to 234 conditions per place. [2021-03-26 00:13:27,270 INFO L142 LiptonReduction]: Number of co-enabled transitions 1546 [2021-03-26 00:13:27,315 INFO L154 LiptonReduction]: Checked pairs total: 690 [2021-03-26 00:13:27,315 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:27,316 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-26 00:13:27,316 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 79 transitions, 681 flow [2021-03-26 00:13:27,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,317 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:27,317 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:27,317 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:13:27,317 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:27,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:27,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1535670015, now seen corresponding path program 1 times [2021-03-26 00:13:27,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:27,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128896621] [2021-03-26 00:13:27,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:27,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:27,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:27,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:27,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:27,379 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:13:27,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:13:27,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:27,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:27,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128896621] [2021-03-26 00:13:27,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:27,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:13:27,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066222947] [2021-03-26 00:13:27,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:13:27,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:27,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:13:27,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:13:27,389 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 202 [2021-03-26 00:13:27,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 79 transitions, 681 flow. Second operand has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:27,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 202 [2021-03-26 00:13:27,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:27,545 INFO L129 PetriNetUnfolder]: 284/604 cut-off events. [2021-03-26 00:13:27,545 INFO L130 PetriNetUnfolder]: For 4048/6704 co-relation queries the response was YES. [2021-03-26 00:13:27,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 604 events. 284/604 cut-off events. For 4048/6704 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 3752 event pairs, 0 based on Foata normal form. 358/874 useless extension candidates. Maximal degree in co-relation 3125. Up to 301 conditions per place. [2021-03-26 00:13:27,552 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 6 selfloop transitions, 33 changer transitions 5/86 dead transitions. [2021-03-26 00:13:27,552 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 810 flow [2021-03-26 00:13:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 00:13:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 00:13:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1861 transitions. [2021-03-26 00:13:27,555 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8375337533753375 [2021-03-26 00:13:27,555 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1861 transitions. [2021-03-26 00:13:27,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1861 transitions. [2021-03-26 00:13:27,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:27,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1861 transitions. [2021-03-26 00:13:27,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 169.1818181818182) internal successors, (1861), 11 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,571 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 202.0) internal successors, (2424), 12 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:27,571 INFO L185 Difference]: Start difference. First operand has 82 places, 79 transitions, 681 flow. Second operand 11 states and 1861 transitions. [2021-03-26 00:13:27,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 810 flow [2021-03-26 00:13:27,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 86 transitions, 653 flow, removed 50 selfloop flow, removed 8 redundant places. [2021-03-26 00:13:27,584 INFO L241 Difference]: Finished difference. Result has 87 places, 78 transitions, 595 flow [2021-03-26 00:13:27,585 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=595, PETRI_PLACES=87, PETRI_TRANSITIONS=78} [2021-03-26 00:13:27,585 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 28 predicate places. [2021-03-26 00:13:27,585 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:27,585 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 78 transitions, 595 flow [2021-03-26 00:13:27,585 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 78 transitions, 595 flow [2021-03-26 00:13:27,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 78 transitions, 595 flow [2021-03-26 00:13:27,619 INFO L129 PetriNetUnfolder]: 182/442 cut-off events. [2021-03-26 00:13:27,619 INFO L130 PetriNetUnfolder]: For 1703/1996 co-relation queries the response was YES. [2021-03-26 00:13:27,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 442 events. 182/442 cut-off events. For 1703/1996 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 2954 event pairs, 0 based on Foata normal form. 16/407 useless extension candidates. Maximal degree in co-relation 1861. Up to 125 conditions per place. [2021-03-26 00:13:27,626 INFO L142 LiptonReduction]: Number of co-enabled transitions 1514 [2021-03-26 00:13:27,948 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:13:28,138 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 00:13:28,767 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 196 [2021-03-26 00:13:29,010 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 00:13:30,862 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 350 DAG size of output: 276 [2021-03-26 00:13:31,411 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 00:13:31,420 INFO L154 LiptonReduction]: Checked pairs total: 2515 [2021-03-26 00:13:31,420 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:13:31,420 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3835 [2021-03-26 00:13:31,420 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 555 flow [2021-03-26 00:13:31,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,421 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:31,421 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:31,421 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:13:31,421 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:31,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash -408182676, now seen corresponding path program 1 times [2021-03-26 00:13:31,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:31,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628705021] [2021-03-26 00:13:31,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:31,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:31,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:31,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:31,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628705021] [2021-03-26 00:13:31,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:31,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:31,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646622955] [2021-03-26 00:13:31,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:31,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:31,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:31,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:31,465 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 204 [2021-03-26 00:13:31,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 555 flow. Second operand has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:31,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 204 [2021-03-26 00:13:31,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:31,506 INFO L129 PetriNetUnfolder]: 152/352 cut-off events. [2021-03-26 00:13:31,506 INFO L130 PetriNetUnfolder]: For 4449/4673 co-relation queries the response was YES. [2021-03-26 00:13:31,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 352 events. 152/352 cut-off events. For 4449/4673 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1864 event pairs, 0 based on Foata normal form. 37/346 useless extension candidates. Maximal degree in co-relation 1342. Up to 108 conditions per place. [2021-03-26 00:13:31,509 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 3 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2021-03-26 00:13:31,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 61 transitions, 451 flow [2021-03-26 00:13:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 718 transitions. [2021-03-26 00:13:31,511 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8799019607843137 [2021-03-26 00:13:31,511 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 718 transitions. [2021-03-26 00:13:31,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 718 transitions. [2021-03-26 00:13:31,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:31,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 718 transitions. [2021-03-26 00:13:31,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,513 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,513 INFO L185 Difference]: Start difference. First operand has 84 places, 72 transitions, 555 flow. Second operand 4 states and 718 transitions. [2021-03-26 00:13:31,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 61 transitions, 451 flow [2021-03-26 00:13:31,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 364 flow, removed 28 selfloop flow, removed 13 redundant places. [2021-03-26 00:13:31,517 INFO L241 Difference]: Finished difference. Result has 66 places, 61 transitions, 365 flow [2021-03-26 00:13:31,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=365, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2021-03-26 00:13:31,517 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2021-03-26 00:13:31,517 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:31,517 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 61 transitions, 365 flow [2021-03-26 00:13:31,517 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 61 transitions, 365 flow [2021-03-26 00:13:31,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 61 transitions, 365 flow [2021-03-26 00:13:31,540 INFO L129 PetriNetUnfolder]: 152/342 cut-off events. [2021-03-26 00:13:31,541 INFO L130 PetriNetUnfolder]: For 1034/1171 co-relation queries the response was YES. [2021-03-26 00:13:31,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 342 events. 152/342 cut-off events. For 1034/1171 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1831 event pairs, 0 based on Foata normal form. 30/330 useless extension candidates. Maximal degree in co-relation 1090. Up to 100 conditions per place. [2021-03-26 00:13:31,544 INFO L142 LiptonReduction]: Number of co-enabled transitions 960 [2021-03-26 00:13:31,546 INFO L154 LiptonReduction]: Checked pairs total: 306 [2021-03-26 00:13:31,546 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:31,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-03-26 00:13:31,547 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 365 flow [2021-03-26 00:13:31,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:31,547 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:31,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:13:31,547 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:31,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:31,548 INFO L82 PathProgramCache]: Analyzing trace with hash 251544186, now seen corresponding path program 1 times [2021-03-26 00:13:31,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:31,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108884515] [2021-03-26 00:13:31,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:31,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:31,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:31,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:31,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108884515] [2021-03-26 00:13:31,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:31,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:13:31,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056220496] [2021-03-26 00:13:31,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:13:31,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:31,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:13:31,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:13:31,590 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 204 [2021-03-26 00:13:31,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 365 flow. Second operand 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 00:13:31,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:31,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 204 [2021-03-26 00:13:31,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:31,649 INFO L129 PetriNetUnfolder]: 297/670 cut-off events. [2021-03-26 00:13:31,649 INFO L130 PetriNetUnfolder]: For 3111/3489 co-relation queries the response was YES. [2021-03-26 00:13:31,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 670 events. 297/670 cut-off events. For 3111/3489 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4300 event pairs, 0 based on Foata normal form. 66/656 useless extension candidates. Maximal degree in co-relation 2142. Up to 202 conditions per place. [2021-03-26 00:13:31,653 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 3 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2021-03-26 00:13:31,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 62 transitions, 377 flow [2021-03-26 00:13:31,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:13:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:13:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 722 transitions. [2021-03-26 00:13:31,655 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8848039215686274 [2021-03-26 00:13:31,655 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 722 transitions. [2021-03-26 00:13:31,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 722 transitions. [2021-03-26 00:13:31,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:31,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 722 transitions. [2021-03-26 00:13:31,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,658 INFO L185 Difference]: Start difference. First operand has 66 places, 61 transitions, 365 flow. Second operand 4 states and 722 transitions. [2021-03-26 00:13:31,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 62 transitions, 377 flow [2021-03-26 00:13:31,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 376 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:31,665 INFO L241 Difference]: Finished difference. Result has 70 places, 62 transitions, 377 flow [2021-03-26 00:13:31,665 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=377, PETRI_PLACES=70, PETRI_TRANSITIONS=62} [2021-03-26 00:13:31,665 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 11 predicate places. [2021-03-26 00:13:31,665 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:31,665 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 62 transitions, 377 flow [2021-03-26 00:13:31,665 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 62 transitions, 377 flow [2021-03-26 00:13:31,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 62 transitions, 377 flow [2021-03-26 00:13:31,705 INFO L129 PetriNetUnfolder]: 273/593 cut-off events. [2021-03-26 00:13:31,705 INFO L130 PetriNetUnfolder]: For 1662/1882 co-relation queries the response was YES. [2021-03-26 00:13:31,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 593 events. 273/593 cut-off events. For 1662/1882 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 3740 event pairs, 0 based on Foata normal form. 32/540 useless extension candidates. Maximal degree in co-relation 1911. Up to 180 conditions per place. [2021-03-26 00:13:31,711 INFO L142 LiptonReduction]: Number of co-enabled transitions 1002 [2021-03-26 00:13:31,713 INFO L154 LiptonReduction]: Checked pairs total: 120 [2021-03-26 00:13:31,714 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:13:31,714 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 00:13:31,715 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 62 transitions, 377 flow [2021-03-26 00:13:31,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 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 00:13:31,715 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:31,715 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:31,715 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:13:31,715 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:31,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:31,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1358968872, now seen corresponding path program 2 times [2021-03-26 00:13:31,715 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:31,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491806863] [2021-03-26 00:13:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:13:31,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:13:31,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:13:31,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:13:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:13:31,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491806863] [2021-03-26 00:13:31,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:13:31,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:13:31,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087789773] [2021-03-26 00:13:31,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:13:31,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:13:31,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:13:31,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:13:31,750 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 204 [2021-03-26 00:13:31,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 62 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,751 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:13:31,751 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 204 [2021-03-26 00:13:31,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:13:31,820 INFO L129 PetriNetUnfolder]: 451/966 cut-off events. [2021-03-26 00:13:31,820 INFO L130 PetriNetUnfolder]: For 4915/5357 co-relation queries the response was YES. [2021-03-26 00:13:31,824 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 966 events. 451/966 cut-off events. For 4915/5357 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 6650 event pairs, 1 based on Foata normal form. 84/914 useless extension candidates. Maximal degree in co-relation 3137. Up to 300 conditions per place. [2021-03-26 00:13:31,825 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 3 selfloop transitions, 2 changer transitions 18/63 dead transitions. [2021-03-26 00:13:31,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 63 transitions, 395 flow [2021-03-26 00:13:31,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:13:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:13:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2021-03-26 00:13:31,827 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9003267973856209 [2021-03-26 00:13:31,827 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2021-03-26 00:13:31,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2021-03-26 00:13:31,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:13:31,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2021-03-26 00:13:31,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 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 00:13:31,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,829 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:31,829 INFO L185 Difference]: Start difference. First operand has 70 places, 62 transitions, 377 flow. Second operand 3 states and 551 transitions. [2021-03-26 00:13:31,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 63 transitions, 395 flow [2021-03-26 00:13:31,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 63 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:13:31,840 INFO L241 Difference]: Finished difference. Result has 72 places, 45 transitions, 270 flow [2021-03-26 00:13:31,840 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=72, PETRI_TRANSITIONS=45} [2021-03-26 00:13:31,840 INFO L343 CegarLoopForPetriNet]: 59 programPoint places, 13 predicate places. [2021-03-26 00:13:31,840 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:13:31,840 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 45 transitions, 270 flow [2021-03-26 00:13:31,840 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 45 transitions, 270 flow [2021-03-26 00:13:31,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 45 transitions, 270 flow [2021-03-26 00:13:31,855 INFO L129 PetriNetUnfolder]: 101/237 cut-off events. [2021-03-26 00:13:31,855 INFO L130 PetriNetUnfolder]: For 1160/1237 co-relation queries the response was YES. [2021-03-26 00:13:31,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 237 events. 101/237 cut-off events. For 1160/1237 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1093 event pairs, 2 based on Foata normal form. 18/223 useless extension candidates. Maximal degree in co-relation 749. Up to 82 conditions per place. [2021-03-26 00:13:31,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 556 [2021-03-26 00:13:32,163 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2021-03-26 00:13:32,452 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 88 [2021-03-26 00:13:32,555 INFO L154 LiptonReduction]: Checked pairs total: 233 [2021-03-26 00:13:32,555 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:13:32,555 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 715 [2021-03-26 00:13:32,556 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 41 transitions, 274 flow [2021-03-26 00:13:32,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:13:32,556 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:13:32,556 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:13:32,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 00:13:32,556 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:13:32,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:13:32,556 INFO L82 PathProgramCache]: Analyzing trace with hash -997502532, now seen corresponding path program 3 times [2021-03-26 00:13:32,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:13:32,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800126792] [2021-03-26 00:13:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:13:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:13:32,574 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:13:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:13:32,593 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:13:32,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:13:32,613 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:13:32,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 00:13:32,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:13:32 BasicIcfg [2021-03-26 00:13:32,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:13:32,713 INFO L168 Benchmark]: Toolchain (without parser) took 24426.23 ms. Allocated memory was 371.2 MB in the beginning and 916.5 MB in the end (delta: 545.3 MB). Free memory was 334.6 MB in the beginning and 795.5 MB in the end (delta: -460.9 MB). Peak memory consumption was 86.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:32,713 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 371.2 MB. Free memory was 352.7 MB in the beginning and 352.6 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:13:32,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.93 ms. Allocated memory is still 371.2 MB. Free memory was 334.4 MB in the beginning and 329.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:32,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.46 ms. Allocated memory is still 371.2 MB. Free memory was 329.7 MB in the beginning and 326.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:32,713 INFO L168 Benchmark]: Boogie Preprocessor took 46.19 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 324.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:32,713 INFO L168 Benchmark]: RCFGBuilder took 1443.33 ms. Allocated memory is still 371.2 MB. Free memory was 324.4 MB in the beginning and 285.4 MB in the end (delta: 39.1 MB). Peak memory consumption was 168.0 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:32,714 INFO L168 Benchmark]: TraceAbstraction took 22392.56 ms. Allocated memory was 371.2 MB in the beginning and 916.5 MB in the end (delta: 545.3 MB). Free memory was 284.3 MB in the beginning and 795.5 MB in the end (delta: -511.2 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:13:32,714 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 371.2 MB. Free memory was 352.7 MB in the beginning and 352.6 MB in the end (delta: 70.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 474.93 ms. Allocated memory is still 371.2 MB. Free memory was 334.4 MB in the beginning and 329.7 MB in the end (delta: 4.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 65.46 ms. Allocated memory is still 371.2 MB. Free memory was 329.7 MB in the beginning and 326.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 46.19 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 324.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1443.33 ms. Allocated memory is still 371.2 MB. Free memory was 324.4 MB in the beginning and 285.4 MB in the end (delta: 39.1 MB). Peak memory consumption was 168.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 22392.56 ms. Allocated memory was 371.2 MB in the beginning and 916.5 MB in the end (delta: 545.3 MB). Free memory was 284.3 MB in the beginning and 795.5 MB in the end (delta: -511.2 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7906.1ms, 123 PlacesBefore, 59 PlacesAfterwards, 112 TransitionsBefore, 47 TransitionsAfterwards, 2630 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 5205 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2430, positive: 2306, positive conditional: 2306, positive unconditional: 0, negative: 124, negative conditional: 124, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1765, positive: 1714, positive conditional: 0, positive unconditional: 1714, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1765, positive: 1714, positive conditional: 0, positive unconditional: 1714, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1765, positive: 1704, positive conditional: 0, positive unconditional: 1704, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 652, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 625, negative conditional: 0, negative unconditional: 625, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2430, positive: 592, positive conditional: 592, positive unconditional: 0, negative: 73, negative conditional: 73, negative unconditional: 0, unknown: 1765, unknown conditional: 1765, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 116, Positive conditional cache size: 116, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4916.5ms, 55 PlacesBefore, 39 PlacesAfterwards, 40 TransitionsBefore, 28 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 5 FixpointIterations, 11 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2544 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 732, positive: 593, positive conditional: 593, positive unconditional: 0, negative: 139, negative conditional: 139, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 63, positive conditional: 12, positive unconditional: 51, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, positive: 63, positive conditional: 12, positive unconditional: 51, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 197, negative conditional: 54, negative unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 732, positive: 530, positive conditional: 530, positive unconditional: 0, negative: 126, negative conditional: 126, negative unconditional: 0, unknown: 76, unknown conditional: 76, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 192, Positive cache size: 162, Positive conditional cache size: 162, Positive unconditional cache size: 0, Negative cache size: 30, Negative conditional cache size: 30, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.9ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 460 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 150, positive: 126, positive conditional: 126, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 41, positive conditional: 12, positive unconditional: 29, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 43, positive: 41, positive conditional: 12, positive unconditional: 29, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 43, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 150, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 43, unknown conditional: 43, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 203, Positive conditional cache size: 203, Positive unconditional cache size: 0, Negative cache size: 32, Negative conditional cache size: 32, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 81.2ms, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 443 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 128, positive: 105, positive conditional: 105, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 3, positive unconditional: 2, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 75, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 75, negative conditional: 2, negative unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, positive: 100, positive conditional: 100, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 208, Positive conditional cache size: 208, Positive unconditional cache size: 0, Negative cache size: 35, Negative conditional cache size: 35, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 339 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 28, positive conditional: 17, positive unconditional: 11, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 31, positive: 28, positive conditional: 17, positive unconditional: 11, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 1, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 60, negative conditional: 16, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 31, unknown conditional: 31, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 236, Positive conditional cache size: 236, Positive unconditional cache size: 0, Negative cache size: 38, Negative conditional cache size: 38, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.8ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 459 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 98, positive conditional: 98, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 19, positive conditional: 7, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, positive: 19, positive conditional: 7, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 255, Positive conditional cache size: 255, Positive unconditional cache size: 0, Negative cache size: 42, Negative conditional cache size: 42, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 102.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 407 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 101, positive conditional: 101, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 31, positive conditional: 12, positive unconditional: 19, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, positive: 31, positive conditional: 12, positive unconditional: 19, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 35, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 332, Positive cache size: 286, Positive conditional cache size: 286, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.5ms, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 480 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 193, positive: 176, positive conditional: 176, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 45, positive conditional: 38, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 45, positive: 45, positive conditional: 38, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 45, positive: 45, positive conditional: 0, positive unconditional: 45, 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: 193, positive: 131, positive conditional: 131, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 45, unknown conditional: 45, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 377, Positive cache size: 331, Positive conditional cache size: 331, Positive unconditional cache size: 0, Negative cache size: 46, Negative conditional cache size: 46, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 79.0ms, 59 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 768 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 718 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 229, positive: 205, positive conditional: 205, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 44, positive conditional: 41, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 46, positive: 44, positive conditional: 41, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 46, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, positive: 161, positive conditional: 161, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 46, unknown conditional: 46, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 375, Positive conditional cache size: 375, Positive unconditional cache size: 0, Negative cache size: 48, Negative conditional cache size: 48, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 81.3ms, 64 PlacesBefore, 64 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1035 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 305, positive: 273, positive conditional: 273, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 75, positive conditional: 61, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, positive: 75, positive conditional: 61, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 305, positive: 198, positive conditional: 198, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 77, unknown conditional: 77, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 500, Positive cache size: 450, Positive conditional cache size: 450, Positive unconditional cache size: 0, Negative cache size: 50, Negative conditional cache size: 50, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84.3ms, 69 PlacesBefore, 69 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 980 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1279 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 296, positive: 259, positive conditional: 259, positive unconditional: 0, negative: 37, negative conditional: 37, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 47, positive conditional: 37, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 49, positive: 47, positive conditional: 37, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 49, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 296, positive: 212, positive conditional: 212, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 49, unknown conditional: 49, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 549, Positive cache size: 497, Positive conditional cache size: 497, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 125.6ms, 71 PlacesBefore, 71 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1312 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 736 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 166, positive conditional: 166, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 34, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 34, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 182, positive: 127, positive conditional: 127, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 588, Positive cache size: 536, Positive conditional cache size: 536, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 168.4ms, 79 PlacesBefore, 79 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 698 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 209, positive: 194, positive conditional: 194, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 20, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 20, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 33, positive conditional: 0, positive unconditional: 33, 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: 209, positive: 161, positive conditional: 161, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 33, unknown conditional: 33, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 621, Positive cache size: 569, Positive conditional cache size: 569, Positive unconditional cache size: 0, Negative cache size: 52, Negative conditional cache size: 52, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.8ms, 82 PlacesBefore, 82 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1546 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 690 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 270, positive: 256, positive conditional: 256, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, positive: 93, positive conditional: 87, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 95, positive: 93, positive conditional: 87, positive unconditional: 6, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 95, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 36, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 270, positive: 163, positive conditional: 163, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 95, unknown conditional: 95, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 716, Positive cache size: 662, Positive conditional cache size: 662, Positive unconditional cache size: 0, Negative cache size: 54, Negative conditional cache size: 54, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3834.8ms, 87 PlacesBefore, 84 PlacesAfterwards, 78 TransitionsBefore, 72 TransitionsAfterwards, 1514 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 2515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1263, positive: 1212, positive conditional: 1212, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, positive: 193, positive conditional: 188, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 193, positive: 193, positive conditional: 188, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 193, positive: 193, positive conditional: 0, positive unconditional: 193, 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: 1263, positive: 1019, positive conditional: 1019, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 193, unknown conditional: 193, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 691, Positive cache size: 663, Positive conditional cache size: 663, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.8ms, 66 PlacesBefore, 66 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 98, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 20, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 20, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 98, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 21, unknown conditional: 21, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 684, Positive conditional cache size: 684, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.4ms, 70 PlacesBefore, 70 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 684, Positive conditional cache size: 684, Positive unconditional cache size: 0, Negative cache size: 28, Negative conditional cache size: 28, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 714.8ms, 72 PlacesBefore, 65 PlacesAfterwards, 45 TransitionsBefore, 41 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 233 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 175, positive: 170, positive conditional: 170, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 105, positive: 103, positive conditional: 84, positive unconditional: 19, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 105, positive: 103, positive conditional: 84, positive unconditional: 19, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 105, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 6, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 105, unknown conditional: 105, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 88, Positive conditional cache size: 88, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t789; [L847] FCALL, FORK 0 pthread_create(&t789, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t790; [L849] FCALL, FORK 0 pthread_create(&t790, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t791; [L851] FCALL, FORK 0 pthread_create(&t791, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t792; [L853] FCALL, FORK 0 pthread_create(&t792, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [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 [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] 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) [L859] 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) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 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 [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 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) [L870] 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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] 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)) [L873] 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)) [L873] 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)) [L874] 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)) [L874] 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)) [L875] 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)) [L875] 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)) [L876] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 22216.2ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2017.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7962.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 72 SDtfs, 55 SDslu, 28 SDs, 0 SdLazy, 428 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 406.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 378.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=681occurred in iteration=13, InterpolantAutomatonStates: 86, 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: 53.8ms SsaConstructionTime, 401.4ms SatisfiabilityAnalysisTime, 937.0ms InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 1718 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...