/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:14:32,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:14:32,926 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:14:32,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:14:32,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:14:32,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:14:32,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:14:32,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:14:32,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:14:32,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:14:32,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:14:32,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:14:32,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:14:32,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:14:32,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:14:32,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:14:32,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:14:32,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:14:32,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:14:32,979 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:14:32,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:14:32,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:14:32,982 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:14:32,983 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:14:32,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:14:32,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:14:32,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:14:32,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:14:32,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:14:32,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:14:32,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:14:32,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:14:32,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:14:32,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:14:32,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:14:32,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:14:32,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:14:32,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:14:32,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:14:32,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:14:32,993 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:14:32,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:14:33,021 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:14:33,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:14:33,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:14:33,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:14:33,023 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:14:33,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:14:33,023 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:14:33,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:14:33,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:14:33,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:14:33,024 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:14:33,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:14:33,024 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:14:33,025 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:14:33,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:14:33,025 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:14:33,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:14:33,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:14:33,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:14:33,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:14:33,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:33,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:14:33,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:14:33,027 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:14:33,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:14:33,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:14:33,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:14:33,285 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:14:33,285 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:14:33,286 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2021-03-26 10:14:33,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88965e0b6/fdd0f661aadf4705b52fbdac15c3c77f/FLAG3d5843a0d [2021-03-26 10:14:33,716 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:14:33,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i [2021-03-26 10:14:33,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88965e0b6/fdd0f661aadf4705b52fbdac15c3c77f/FLAG3d5843a0d [2021-03-26 10:14:34,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88965e0b6/fdd0f661aadf4705b52fbdac15c3c77f [2021-03-26 10:14:34,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:14:34,070 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:14:34,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:34,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:14:34,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:14:34,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e3f57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34, skipping insertion in model container [2021-03-26 10:14:34,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:14:34,121 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:14:34,221 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/mix055_rmo.opt.i[948,961] [2021-03-26 10:14:34,336 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:34,341 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:14:34,358 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/mix055_rmo.opt.i[948,961] [2021-03-26 10:14:34,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:14:34,478 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:14:34,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34 WrapperNode [2021-03-26 10:14:34,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:14:34,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:34,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:14:34,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:14:34,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:14:34,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:14:34,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:14:34,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:14:34,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... [2021-03-26 10:14:34,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:14:34,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:14:34,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:14:34,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:14:34,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:14:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:14:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:14:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:14:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:14:34,633 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:14:34,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:14:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:14:34,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:14:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:14:34,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:14:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:14:34,634 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:14:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:14:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:14:34,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:14:34,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:14:34,635 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:14:35,945 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:14:35,945 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:14:35,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:35 BoogieIcfgContainer [2021-03-26 10:14:35,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:14:35,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:14:35,948 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:14:35,949 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:14:35,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:14:34" (1/3) ... [2021-03-26 10:14:35,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397a35fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:35, skipping insertion in model container [2021-03-26 10:14:35,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:14:34" (2/3) ... [2021-03-26 10:14:35,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397a35fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:14:35, skipping insertion in model container [2021-03-26 10:14:35,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:14:35" (3/3) ... [2021-03-26 10:14:35,951 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i [2021-03-26 10:14:35,955 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:14:35,960 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:14:35,961 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:14:35,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,990 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,990 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,991 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,992 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,994 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,996 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,997 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,998 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:35,999 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,002 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,002 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,002 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,003 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,003 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,004 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,004 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,005 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,007 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,008 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,008 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,008 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,012 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,013 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,013 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,013 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:14:36,014 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:14:36,026 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:14:36,048 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:14:36,049 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:14:36,049 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:14:36,049 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:14:36,049 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:14:36,049 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:14:36,049 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:14:36,049 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:14:36,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 10:14:36,097 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 10:14:36,098 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:36,108 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:14:36,108 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 113 transitions, 246 flow [2021-03-26 10:14:36,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:36,112 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:36,121 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:36,123 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:36,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 109 transitions, 230 flow [2021-03-26 10:14:36,150 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-03-26 10:14:36,151 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:36,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:14:36,154 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-26 10:14:37,448 WARN L205 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:14:37,712 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:14:38,927 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:14:39,450 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:14:39,923 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:14:40,278 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:14:41,687 WARN L205 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-26 10:14:41,964 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:14:42,517 WARN L205 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:14:43,097 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:14:43,535 INFO L154 LiptonReduction]: Checked pairs total: 4266 [2021-03-26 10:14:43,536 INFO L156 LiptonReduction]: Total number of compositions: 72 [2021-03-26 10:14:43,538 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7426 [2021-03-26 10:14:43,548 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:14:43,549 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:43,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:43,549 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:43,549 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:43,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1508011334, now seen corresponding path program 1 times [2021-03-26 10:14:43,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:43,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732270301] [2021-03-26 10:14:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:43,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:43,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:43,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:43,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:43,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:43,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732270301] [2021-03-26 10:14:43,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:43,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:43,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616915512] [2021-03-26 10:14:43,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:14:43,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:43,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:14:43,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:14:43,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2021-03-26 10:14:43,847 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:43,847 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:43,847 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2021-03-26 10:14:43,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:43,908 INFO L129 PetriNetUnfolder]: 23/110 cut-off events. [2021-03-26 10:14:43,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:43,909 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 110 events. 23/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 371 event pairs, 9 based on Foata normal form. 6/109 useless extension candidates. Maximal degree in co-relation 150. Up to 37 conditions per place. [2021-03-26 10:14:43,910 INFO L132 encePairwiseOnDemand]: 181/185 looper letters, 7 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2021-03-26 10:14:43,910 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 126 flow [2021-03-26 10:14:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-26 10:14:43,948 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2021-03-26 10:14:43,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-26 10:14:43,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-26 10:14:43,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:43,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-26 10:14:43,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:43,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:43,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:43,959 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 506 transitions. [2021-03-26 10:14:43,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 126 flow [2021-03-26 10:14:43,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:14:43,962 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:43,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-26 10:14:43,963 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-26 10:14:43,963 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:43,963 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:43,964 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-26 10:14:43,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 86 flow [2021-03-26 10:14:43,981 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-26 10:14:43,981 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:43,982 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:14:43,982 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 10:14:44,239 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:14:44,352 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:14:44,797 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:14:45,081 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:14:45,649 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:14:46,260 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:14:46,968 INFO L154 LiptonReduction]: Checked pairs total: 1530 [2021-03-26 10:14:46,969 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-26 10:14:46,969 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3006 [2021-03-26 10:14:46,969 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-26 10:14:46,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:46,970 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:46,970 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 10:14:46,970 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:14:46,970 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:46,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:46,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1703571502, now seen corresponding path program 1 times [2021-03-26 10:14:46,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:46,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599298825] [2021-03-26 10:14:46,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:47,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:47,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:47,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:47,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:14:47,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:47,142 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599298825] [2021-03-26 10:14:47,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:47,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:47,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898709122] [2021-03-26 10:14:47,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:47,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:47,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:47,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:47,146 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 195 [2021-03-26 10:14:47,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:47,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 195 [2021-03-26 10:14:47,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:47,165 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:14:47,165 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:47,166 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 10:14:47,166 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:14:47,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-26 10:14:47,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:47,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2021-03-26 10:14:47,169 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2021-03-26 10:14:47,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2021-03-26 10:14:47,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2021-03-26 10:14:47,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:47,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2021-03-26 10:14:47,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:47,173 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 520 transitions. [2021-03-26 10:14:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-26 10:14:47,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:47,174 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:47,174 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 10:14:47,175 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-26 10:14:47,175 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:47,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:47,175 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:47,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-26 10:14:47,180 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:14:47,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:14:47,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 1 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:14:47,181 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 10:14:47,899 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:14:48,058 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:14:48,365 WARN L205 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-03-26 10:14:48,510 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-03-26 10:14:48,513 INFO L154 LiptonReduction]: Checked pairs total: 1020 [2021-03-26 10:14:48,514 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:14:48,514 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1339 [2021-03-26 10:14:48,515 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-26 10:14:48,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,515 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:48,515 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:48,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:14:48,515 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:48,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash 582134895, now seen corresponding path program 1 times [2021-03-26 10:14:48,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:48,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099124675] [2021-03-26 10:14:48,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:48,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:48,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:48,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:14:48,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:48,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 10:14:48,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099124675] [2021-03-26 10:14:48,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:48,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:48,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225656995] [2021-03-26 10:14:48,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:48,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:48,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:48,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:48,589 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 197 [2021-03-26 10:14:48,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:48,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 197 [2021-03-26 10:14:48,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:48,624 INFO L129 PetriNetUnfolder]: 47/130 cut-off events. [2021-03-26 10:14:48,625 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 10:14:48,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 130 events. 47/130 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 489 event pairs, 30 based on Foata normal form. 2/116 useless extension candidates. Maximal degree in co-relation 245. Up to 67 conditions per place. [2021-03-26 10:14:48,626 INFO L132 encePairwiseOnDemand]: 192/197 looper letters, 8 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2021-03-26 10:14:48,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 115 flow [2021-03-26 10:14:48,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:48,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 623 transitions. [2021-03-26 10:14:48,628 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7906091370558376 [2021-03-26 10:14:48,628 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 623 transitions. [2021-03-26 10:14:48,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 623 transitions. [2021-03-26 10:14:48,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:48,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 623 transitions. [2021-03-26 10:14:48,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,631 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,631 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 4 states and 623 transitions. [2021-03-26 10:14:48,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 115 flow [2021-03-26 10:14:48,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:48,632 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:48,632 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-26 10:14:48,632 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-26 10:14:48,632 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:48,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:48,633 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:48,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:48,638 INFO L129 PetriNetUnfolder]: 11/59 cut-off events. [2021-03-26 10:14:48,638 INFO L130 PetriNetUnfolder]: For 34/37 co-relation queries the response was YES. [2021-03-26 10:14:48,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 59 events. 11/59 cut-off events. For 34/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 179 event pairs, 3 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 115. Up to 20 conditions per place. [2021-03-26 10:14:48,639 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 10:14:48,675 INFO L154 LiptonReduction]: Checked pairs total: 310 [2021-03-26 10:14:48,675 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:48,675 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 43 [2021-03-26 10:14:48,676 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 108 flow [2021-03-26 10:14:48,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:48,677 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:48,677 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:14:48,677 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:48,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash 438995751, now seen corresponding path program 1 times [2021-03-26 10:14:48,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:48,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396063492] [2021-03-26 10:14:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:48,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:48,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:48,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:14:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:48,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396063492] [2021-03-26 10:14:48,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:48,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:48,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021994508] [2021-03-26 10:14:48,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:48,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:48,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:48,770 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 197 [2021-03-26 10:14:48,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:48,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 197 [2021-03-26 10:14:48,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:48,845 INFO L129 PetriNetUnfolder]: 38/110 cut-off events. [2021-03-26 10:14:48,845 INFO L130 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2021-03-26 10:14:48,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 110 events. 38/110 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 371 event pairs, 20 based on Foata normal form. 3/103 useless extension candidates. Maximal degree in co-relation 266. Up to 53 conditions per place. [2021-03-26 10:14:48,848 INFO L132 encePairwiseOnDemand]: 191/197 looper letters, 9 selfloop transitions, 7 changer transitions 0/36 dead transitions. [2021-03-26 10:14:48,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 36 transitions, 152 flow [2021-03-26 10:14:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2021-03-26 10:14:48,854 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8058375634517766 [2021-03-26 10:14:48,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 635 transitions. [2021-03-26 10:14:48,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 635 transitions. [2021-03-26 10:14:48,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:48,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 635 transitions. [2021-03-26 10:14:48,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,860 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,860 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 108 flow. Second operand 4 states and 635 transitions. [2021-03-26 10:14:48,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 36 transitions, 152 flow [2021-03-26 10:14:48,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:14:48,862 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 148 flow [2021-03-26 10:14:48,862 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-26 10:14:48,862 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -11 predicate places. [2021-03-26 10:14:48,862 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:48,862 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 148 flow [2021-03-26 10:14:48,863 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 148 flow [2021-03-26 10:14:48,863 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 148 flow [2021-03-26 10:14:48,879 INFO L129 PetriNetUnfolder]: 25/88 cut-off events. [2021-03-26 10:14:48,879 INFO L130 PetriNetUnfolder]: For 164/171 co-relation queries the response was YES. [2021-03-26 10:14:48,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 88 events. 25/88 cut-off events. For 164/171 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 319 event pairs, 15 based on Foata normal form. 2/78 useless extension candidates. Maximal degree in co-relation 231. Up to 32 conditions per place. [2021-03-26 10:14:48,881 INFO L142 LiptonReduction]: Number of co-enabled transitions 474 [2021-03-26 10:14:48,892 INFO L154 LiptonReduction]: Checked pairs total: 267 [2021-03-26 10:14:48,892 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:48,892 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 10:14:48,893 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 148 flow [2021-03-26 10:14:48,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:48,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:48,894 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:48,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:14:48,894 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -183385002, now seen corresponding path program 1 times [2021-03-26 10:14:48,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:48,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245304211] [2021-03-26 10:14:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:48,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:14:48,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:48,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:49,001 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:14:49,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:14:49,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:49,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:14:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:49,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245304211] [2021-03-26 10:14:49,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:49,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:49,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420749967] [2021-03-26 10:14:49,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:49,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:49,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:49,057 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2021-03-26 10:14:49,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:49,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:49,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2021-03-26 10:14:49,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:49,120 INFO L129 PetriNetUnfolder]: 41/120 cut-off events. [2021-03-26 10:14:49,120 INFO L130 PetriNetUnfolder]: For 184/186 co-relation queries the response was YES. [2021-03-26 10:14:49,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 120 events. 41/120 cut-off events. For 184/186 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 431 event pairs, 8 based on Foata normal form. 3/113 useless extension candidates. Maximal degree in co-relation 357. Up to 55 conditions per place. [2021-03-26 10:14:49,121 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 10 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2021-03-26 10:14:49,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 206 flow [2021-03-26 10:14:49,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:49,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 807 transitions. [2021-03-26 10:14:49,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8192893401015229 [2021-03-26 10:14:49,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 807 transitions. [2021-03-26 10:14:49,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 807 transitions. [2021-03-26 10:14:49,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:49,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 807 transitions. [2021-03-26 10:14:49,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 161.4) internal successors, (807), 5 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:49,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:49,127 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:49,127 INFO L185 Difference]: Start difference. First operand has 46 places, 34 transitions, 148 flow. Second operand 5 states and 807 transitions. [2021-03-26 10:14:49,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 206 flow [2021-03-26 10:14:49,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 200 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:49,130 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 177 flow [2021-03-26 10:14:49,130 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-03-26 10:14:49,130 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2021-03-26 10:14:49,130 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:49,130 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 177 flow [2021-03-26 10:14:49,131 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 177 flow [2021-03-26 10:14:49,131 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 177 flow [2021-03-26 10:14:49,146 INFO L129 PetriNetUnfolder]: 40/107 cut-off events. [2021-03-26 10:14:49,147 INFO L130 PetriNetUnfolder]: For 311/326 co-relation queries the response was YES. [2021-03-26 10:14:49,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 107 events. 40/107 cut-off events. For 311/326 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 378 event pairs, 11 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 346. Up to 47 conditions per place. [2021-03-26 10:14:49,148 INFO L142 LiptonReduction]: Number of co-enabled transitions 512 [2021-03-26 10:14:49,394 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:14:49,751 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:14:49,861 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 10:14:49,893 INFO L154 LiptonReduction]: Checked pairs total: 617 [2021-03-26 10:14:49,893 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:14:49,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 764 [2021-03-26 10:14:49,894 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 180 flow [2021-03-26 10:14:49,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:49,897 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:49,897 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:49,897 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:14:49,897 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:49,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:49,897 INFO L82 PathProgramCache]: Analyzing trace with hash -68804016, now seen corresponding path program 2 times [2021-03-26 10:14:49,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:49,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758909141] [2021-03-26 10:14:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:49,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:49,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:14:49,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:49,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:14:49,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:49,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:14:49,996 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 10:14:49,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:14:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:50,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758909141] [2021-03-26 10:14:50,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:50,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:50,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626156903] [2021-03-26 10:14:50,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:50,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:50,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:50,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:50,017 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 198 [2021-03-26 10:14:50,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:50,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 198 [2021-03-26 10:14:50,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:50,130 INFO L129 PetriNetUnfolder]: 36/114 cut-off events. [2021-03-26 10:14:50,130 INFO L130 PetriNetUnfolder]: For 271/277 co-relation queries the response was YES. [2021-03-26 10:14:50,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 114 events. 36/114 cut-off events. For 271/277 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 408 event pairs, 4 based on Foata normal form. 3/107 useless extension candidates. Maximal degree in co-relation 371. Up to 41 conditions per place. [2021-03-26 10:14:50,131 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2021-03-26 10:14:50,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 42 transitions, 254 flow [2021-03-26 10:14:50,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 783 transitions. [2021-03-26 10:14:50,133 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7909090909090909 [2021-03-26 10:14:50,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 783 transitions. [2021-03-26 10:14:50,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 783 transitions. [2021-03-26 10:14:50,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:50,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 783 transitions. [2021-03-26 10:14:50,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 156.6) internal successors, (783), 5 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,136 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,136 INFO L185 Difference]: Start difference. First operand has 50 places, 36 transitions, 180 flow. Second operand 5 states and 783 transitions. [2021-03-26 10:14:50,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 42 transitions, 254 flow [2021-03-26 10:14:50,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 233 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:50,139 INFO L241 Difference]: Finished difference. Result has 52 places, 38 transitions, 207 flow [2021-03-26 10:14:50,139 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2021-03-26 10:14:50,139 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2021-03-26 10:14:50,139 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:50,139 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 38 transitions, 207 flow [2021-03-26 10:14:50,139 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 38 transitions, 207 flow [2021-03-26 10:14:50,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 38 transitions, 207 flow [2021-03-26 10:14:50,149 INFO L129 PetriNetUnfolder]: 29/96 cut-off events. [2021-03-26 10:14:50,149 INFO L130 PetriNetUnfolder]: For 183/188 co-relation queries the response was YES. [2021-03-26 10:14:50,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 96 events. 29/96 cut-off events. For 183/188 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 330 event pairs, 7 based on Foata normal form. 1/86 useless extension candidates. Maximal degree in co-relation 309. Up to 36 conditions per place. [2021-03-26 10:14:50,150 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-26 10:14:50,153 INFO L154 LiptonReduction]: Checked pairs total: 371 [2021-03-26 10:14:50,153 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:50,153 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 10:14:50,154 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 207 flow [2021-03-26 10:14:50,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,154 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:50,154 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:50,154 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:14:50,154 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:50,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:50,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898248, now seen corresponding path program 1 times [2021-03-26 10:14:50,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:50,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814623177] [2021-03-26 10:14:50,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:50,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:50,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814623177] [2021-03-26 10:14:50,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:50,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:50,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114796092] [2021-03-26 10:14:50,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:50,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:50,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:50,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:50,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:50,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 207 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 10:14:50,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:50,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:50,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:50,266 INFO L129 PetriNetUnfolder]: 293/570 cut-off events. [2021-03-26 10:14:50,266 INFO L130 PetriNetUnfolder]: For 650/722 co-relation queries the response was YES. [2021-03-26 10:14:50,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 570 events. 293/570 cut-off events. For 650/722 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 3584 event pairs, 129 based on Foata normal form. 51/518 useless extension candidates. Maximal degree in co-relation 1577. Up to 311 conditions per place. [2021-03-26 10:14:50,270 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2021-03-26 10:14:50,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 275 flow [2021-03-26 10:14:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:14:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:14:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 847 transitions. [2021-03-26 10:14:50,272 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8555555555555555 [2021-03-26 10:14:50,272 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 847 transitions. [2021-03-26 10:14:50,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 847 transitions. [2021-03-26 10:14:50,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:50,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 847 transitions. [2021-03-26 10:14:50,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.4) internal successors, (847), 5 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,276 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,276 INFO L185 Difference]: Start difference. First operand has 52 places, 38 transitions, 207 flow. Second operand 5 states and 847 transitions. [2021-03-26 10:14:50,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 275 flow [2021-03-26 10:14:50,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 249 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:50,278 INFO L241 Difference]: Finished difference. Result has 56 places, 47 transitions, 260 flow [2021-03-26 10:14:50,279 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2021-03-26 10:14:50,279 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2021-03-26 10:14:50,279 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:50,279 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 47 transitions, 260 flow [2021-03-26 10:14:50,279 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 47 transitions, 260 flow [2021-03-26 10:14:50,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 260 flow [2021-03-26 10:14:50,319 INFO L129 PetriNetUnfolder]: 290/546 cut-off events. [2021-03-26 10:14:50,319 INFO L130 PetriNetUnfolder]: For 679/834 co-relation queries the response was YES. [2021-03-26 10:14:50,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 546 events. 290/546 cut-off events. For 679/834 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3312 event pairs, 120 based on Foata normal form. 4/461 useless extension candidates. Maximal degree in co-relation 1726. Up to 297 conditions per place. [2021-03-26 10:14:50,325 INFO L142 LiptonReduction]: Number of co-enabled transitions 798 [2021-03-26 10:14:50,337 INFO L154 LiptonReduction]: Checked pairs total: 322 [2021-03-26 10:14:50,337 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:50,337 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-03-26 10:14:50,338 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 260 flow [2021-03-26 10:14:50,338 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 10:14:50,338 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:50,338 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:50,338 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:14:50,338 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:50,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:50,339 INFO L82 PathProgramCache]: Analyzing trace with hash -819099530, now seen corresponding path program 1 times [2021-03-26 10:14:50,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:50,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448291726] [2021-03-26 10:14:50,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:50,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:50,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448291726] [2021-03-26 10:14:50,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:50,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:14:50,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251279278] [2021-03-26 10:14:50,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:14:50,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:50,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:14:50,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:14:50,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:50,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 260 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 10:14:50,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:50,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:50,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:50,514 INFO L129 PetriNetUnfolder]: 208/447 cut-off events. [2021-03-26 10:14:50,514 INFO L130 PetriNetUnfolder]: For 778/1382 co-relation queries the response was YES. [2021-03-26 10:14:50,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 447 events. 208/447 cut-off events. For 778/1382 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 2677 event pairs, 34 based on Foata normal form. 92/467 useless extension candidates. Maximal degree in co-relation 1682. Up to 295 conditions per place. [2021-03-26 10:14:50,518 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 11 selfloop transitions, 19 changer transitions 0/60 dead transitions. [2021-03-26 10:14:50,518 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 60 transitions, 396 flow [2021-03-26 10:14:50,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:14:50,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:14:50,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1186 transitions. [2021-03-26 10:14:50,521 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8556998556998557 [2021-03-26 10:14:50,521 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1186 transitions. [2021-03-26 10:14:50,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1186 transitions. [2021-03-26 10:14:50,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:50,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1186 transitions. [2021-03-26 10:14:50,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.42857142857142) internal successors, (1186), 7 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,526 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,526 INFO L185 Difference]: Start difference. First operand has 56 places, 47 transitions, 260 flow. Second operand 7 states and 1186 transitions. [2021-03-26 10:14:50,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 60 transitions, 396 flow [2021-03-26 10:14:50,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:50,530 INFO L241 Difference]: Finished difference. Result has 64 places, 56 transitions, 393 flow [2021-03-26 10:14:50,530 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=393, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2021-03-26 10:14:50,530 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 10:14:50,531 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:50,531 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 56 transitions, 393 flow [2021-03-26 10:14:50,531 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 56 transitions, 393 flow [2021-03-26 10:14:50,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 393 flow [2021-03-26 10:14:50,565 INFO L129 PetriNetUnfolder]: 212/443 cut-off events. [2021-03-26 10:14:50,565 INFO L130 PetriNetUnfolder]: For 1275/1954 co-relation queries the response was YES. [2021-03-26 10:14:50,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 443 events. 212/443 cut-off events. For 1275/1954 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 2678 event pairs, 32 based on Foata normal form. 6/373 useless extension candidates. Maximal degree in co-relation 1971. Up to 294 conditions per place. [2021-03-26 10:14:50,570 INFO L142 LiptonReduction]: Number of co-enabled transitions 1022 [2021-03-26 10:14:50,577 INFO L154 LiptonReduction]: Checked pairs total: 394 [2021-03-26 10:14:50,577 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:50,577 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-03-26 10:14:50,578 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 393 flow [2021-03-26 10:14:50,578 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 10:14:50,578 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:50,579 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:50,579 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:14:50,579 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:50,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash -382337619, now seen corresponding path program 1 times [2021-03-26 10:14:50,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:50,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988239527] [2021-03-26 10:14:50,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:50,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:50,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:50,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988239527] [2021-03-26 10:14:50,614 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:50,614 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:14:50,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584005506] [2021-03-26 10:14:50,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:14:50,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:14:50,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:14:50,615 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 198 [2021-03-26 10:14:50,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:50,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 198 [2021-03-26 10:14:50,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:50,674 INFO L129 PetriNetUnfolder]: 309/624 cut-off events. [2021-03-26 10:14:50,675 INFO L130 PetriNetUnfolder]: For 2093/3202 co-relation queries the response was YES. [2021-03-26 10:14:50,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2913 conditions, 624 events. 309/624 cut-off events. For 2093/3202 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 3867 event pairs, 49 based on Foata normal form. 31/539 useless extension candidates. Maximal degree in co-relation 2887. Up to 457 conditions per place. [2021-03-26 10:14:50,679 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 3 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2021-03-26 10:14:50,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 405 flow [2021-03-26 10:14:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:14:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:14:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2021-03-26 10:14:50,681 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.898989898989899 [2021-03-26 10:14:50,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2021-03-26 10:14:50,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2021-03-26 10:14:50,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:50,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2021-03-26 10:14:50,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,683 INFO L185 Difference]: Start difference. First operand has 64 places, 56 transitions, 393 flow. Second operand 3 states and 534 transitions. [2021-03-26 10:14:50,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 405 flow [2021-03-26 10:14:50,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 355 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-26 10:14:50,689 INFO L241 Difference]: Finished difference. Result has 64 places, 56 transitions, 354 flow [2021-03-26 10:14:50,689 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2021-03-26 10:14:50,689 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 10:14:50,689 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:50,689 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 56 transitions, 354 flow [2021-03-26 10:14:50,689 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 56 transitions, 354 flow [2021-03-26 10:14:50,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 354 flow [2021-03-26 10:14:50,730 INFO L129 PetriNetUnfolder]: 312/630 cut-off events. [2021-03-26 10:14:50,731 INFO L130 PetriNetUnfolder]: For 2166/2369 co-relation queries the response was YES. [2021-03-26 10:14:50,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 630 events. 312/630 cut-off events. For 2166/2369 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 4160 event pairs, 47 based on Foata normal form. 9/522 useless extension candidates. Maximal degree in co-relation 2582. Up to 400 conditions per place. [2021-03-26 10:14:50,737 INFO L142 LiptonReduction]: Number of co-enabled transitions 1022 [2021-03-26 10:14:50,753 INFO L154 LiptonReduction]: Checked pairs total: 438 [2021-03-26 10:14:50,753 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:50,753 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-26 10:14:50,753 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 354 flow [2021-03-26 10:14:50,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,754 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:50,754 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:50,754 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:14:50,754 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:50,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1068196340, now seen corresponding path program 1 times [2021-03-26 10:14:50,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:50,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089637495] [2021-03-26 10:14:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:50,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:50,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:50,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:50,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089637495] [2021-03-26 10:14:50,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:50,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:14:50,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97549073] [2021-03-26 10:14:50,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:14:50,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:50,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:14:50,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:14:50,823 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:50,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 354 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 10:14:50,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:50,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:50,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:50,922 INFO L129 PetriNetUnfolder]: 230/486 cut-off events. [2021-03-26 10:14:50,922 INFO L130 PetriNetUnfolder]: For 2239/3537 co-relation queries the response was YES. [2021-03-26 10:14:50,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2375 conditions, 486 events. 230/486 cut-off events. For 2239/3537 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 2913 event pairs, 4 based on Foata normal form. 134/515 useless extension candidates. Maximal degree in co-relation 2349. Up to 326 conditions per place. [2021-03-26 10:14:50,926 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 6 selfloop transitions, 28 changer transitions 4/68 dead transitions. [2021-03-26 10:14:50,926 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 542 flow [2021-03-26 10:14:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:14:50,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:14:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1525 transitions. [2021-03-26 10:14:50,929 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8557800224466892 [2021-03-26 10:14:50,929 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1525 transitions. [2021-03-26 10:14:50,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1525 transitions. [2021-03-26 10:14:50,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:50,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1525 transitions. [2021-03-26 10:14:50,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 169.44444444444446) internal successors, (1525), 9 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,934 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:50,935 INFO L185 Difference]: Start difference. First operand has 64 places, 56 transitions, 354 flow. Second operand 9 states and 1525 transitions. [2021-03-26 10:14:50,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 542 flow [2021-03-26 10:14:50,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 533 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-26 10:14:50,938 INFO L241 Difference]: Finished difference. Result has 74 places, 64 transitions, 509 flow [2021-03-26 10:14:50,939 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=509, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2021-03-26 10:14:50,939 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2021-03-26 10:14:50,939 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:50,939 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 64 transitions, 509 flow [2021-03-26 10:14:50,939 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 64 transitions, 509 flow [2021-03-26 10:14:50,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 64 transitions, 509 flow [2021-03-26 10:14:50,968 INFO L129 PetriNetUnfolder]: 212/461 cut-off events. [2021-03-26 10:14:50,969 INFO L130 PetriNetUnfolder]: For 2430/2748 co-relation queries the response was YES. [2021-03-26 10:14:50,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2430 conditions, 461 events. 212/461 cut-off events. For 2430/2748 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 2988 event pairs, 4 based on Foata normal form. 4/359 useless extension candidates. Maximal degree in co-relation 2402. Up to 302 conditions per place. [2021-03-26 10:14:50,974 INFO L142 LiptonReduction]: Number of co-enabled transitions 1098 [2021-03-26 10:14:50,989 INFO L154 LiptonReduction]: Checked pairs total: 1312 [2021-03-26 10:14:50,990 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:14:50,990 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-26 10:14:50,991 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 61 transitions, 483 flow [2021-03-26 10:14:50,991 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 10:14:50,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:50,992 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:50,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:14:50,992 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash 971537896, now seen corresponding path program 1 times [2021-03-26 10:14:50,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:50,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118936219] [2021-03-26 10:14:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:51,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:51,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:51,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118936219] [2021-03-26 10:14:51,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:51,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:51,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092523993] [2021-03-26 10:14:51,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:51,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:51,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:51,033 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 198 [2021-03-26 10:14:51,034 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 61 transitions, 483 flow. Second operand has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,034 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:51,034 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 198 [2021-03-26 10:14:51,034 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:51,103 INFO L129 PetriNetUnfolder]: 164/395 cut-off events. [2021-03-26 10:14:51,103 INFO L130 PetriNetUnfolder]: For 1951/2172 co-relation queries the response was YES. [2021-03-26 10:14:51,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 395 events. 164/395 cut-off events. For 1951/2172 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2249 event pairs, 8 based on Foata normal form. 12/357 useless extension candidates. Maximal degree in co-relation 1892. Up to 263 conditions per place. [2021-03-26 10:14:51,106 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 4 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2021-03-26 10:14:51,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 51 transitions, 377 flow [2021-03-26 10:14:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2021-03-26 10:14:51,109 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8876262626262627 [2021-03-26 10:14:51,109 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 703 transitions. [2021-03-26 10:14:51,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 703 transitions. [2021-03-26 10:14:51,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:51,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 703 transitions. [2021-03-26 10:14:51,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,112 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,112 INFO L185 Difference]: Start difference. First operand has 74 places, 61 transitions, 483 flow. Second operand 4 states and 703 transitions. [2021-03-26 10:14:51,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 51 transitions, 377 flow [2021-03-26 10:14:51,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 51 transitions, 314 flow, removed 25 selfloop flow, removed 7 redundant places. [2021-03-26 10:14:51,117 INFO L241 Difference]: Finished difference. Result has 64 places, 50 transitions, 301 flow [2021-03-26 10:14:51,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=301, PETRI_PLACES=64, PETRI_TRANSITIONS=50} [2021-03-26 10:14:51,118 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2021-03-26 10:14:51,118 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:51,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 50 transitions, 301 flow [2021-03-26 10:14:51,118 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 50 transitions, 301 flow [2021-03-26 10:14:51,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 50 transitions, 301 flow [2021-03-26 10:14:51,142 INFO L129 PetriNetUnfolder]: 163/393 cut-off events. [2021-03-26 10:14:51,142 INFO L130 PetriNetUnfolder]: For 663/686 co-relation queries the response was YES. [2021-03-26 10:14:51,143 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 393 events. 163/393 cut-off events. For 663/686 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2309 event pairs, 8 based on Foata normal form. 3/345 useless extension candidates. Maximal degree in co-relation 1320. Up to 179 conditions per place. [2021-03-26 10:14:51,146 INFO L142 LiptonReduction]: Number of co-enabled transitions 696 [2021-03-26 10:14:51,150 INFO L154 LiptonReduction]: Checked pairs total: 177 [2021-03-26 10:14:51,150 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:14:51,150 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 32 [2021-03-26 10:14:51,152 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 50 transitions, 301 flow [2021-03-26 10:14:51,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:51,152 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:51,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:14:51,152 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:51,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2101773162, now seen corresponding path program 2 times [2021-03-26 10:14:51,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:51,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646574907] [2021-03-26 10:14:51,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:51,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:51,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:51,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:51,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646574907] [2021-03-26 10:14:51,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:51,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:14:51,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92987711] [2021-03-26 10:14:51,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:14:51,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:51,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:14:51,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:14:51,220 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 198 [2021-03-26 10:14:51,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 50 transitions, 301 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 10:14:51,221 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:51,221 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 198 [2021-03-26 10:14:51,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:51,289 INFO L129 PetriNetUnfolder]: 137/329 cut-off events. [2021-03-26 10:14:51,289 INFO L130 PetriNetUnfolder]: For 600/1007 co-relation queries the response was YES. [2021-03-26 10:14:51,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 329 events. 137/329 cut-off events. For 600/1007 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1822 event pairs, 0 based on Foata normal form. 97/376 useless extension candidates. Maximal degree in co-relation 1327. Up to 161 conditions per place. [2021-03-26 10:14:51,292 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 2 selfloop transitions, 18 changer transitions 4/55 dead transitions. [2021-03-26 10:14:51,292 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 55 transitions, 397 flow [2021-03-26 10:14:51,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:14:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:14:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1346 transitions. [2021-03-26 10:14:51,295 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8497474747474747 [2021-03-26 10:14:51,295 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1346 transitions. [2021-03-26 10:14:51,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1346 transitions. [2021-03-26 10:14:51,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:51,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1346 transitions. [2021-03-26 10:14:51,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 168.25) internal successors, (1346), 8 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,299 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:51,299 INFO L185 Difference]: Start difference. First operand has 64 places, 50 transitions, 301 flow. Second operand 8 states and 1346 transitions. [2021-03-26 10:14:51,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 55 transitions, 397 flow [2021-03-26 10:14:51,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 55 transitions, 366 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-26 10:14:51,302 INFO L241 Difference]: Finished difference. Result has 72 places, 51 transitions, 338 flow [2021-03-26 10:14:51,302 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=338, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2021-03-26 10:14:51,302 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2021-03-26 10:14:51,302 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:51,302 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 51 transitions, 338 flow [2021-03-26 10:14:51,302 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 51 transitions, 338 flow [2021-03-26 10:14:51,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 51 transitions, 338 flow [2021-03-26 10:14:51,320 INFO L129 PetriNetUnfolder]: 125/313 cut-off events. [2021-03-26 10:14:51,320 INFO L130 PetriNetUnfolder]: For 666/816 co-relation queries the response was YES. [2021-03-26 10:14:51,321 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1283 conditions, 313 events. 125/313 cut-off events. For 666/816 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 1794 event pairs, 0 based on Foata normal form. 2/265 useless extension candidates. Maximal degree in co-relation 1255. Up to 145 conditions per place. [2021-03-26 10:14:51,323 INFO L142 LiptonReduction]: Number of co-enabled transitions 660 [2021-03-26 10:14:51,906 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 10:14:52,103 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:14:53,957 WARN L205 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 339 DAG size of output: 264 [2021-03-26 10:14:54,452 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:14:54,677 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:14:54,884 WARN L205 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:14:55,395 WARN L205 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:14:55,870 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:14:55,907 INFO L154 LiptonReduction]: Checked pairs total: 696 [2021-03-26 10:14:55,907 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:14:55,907 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4605 [2021-03-26 10:14:55,908 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 48 transitions, 322 flow [2021-03-26 10:14:55,908 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 10:14:55,908 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:55,908 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:14:55,908 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:14:55,908 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:55,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:55,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2123318849, now seen corresponding path program 1 times [2021-03-26 10:14:55,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:55,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822791024] [2021-03-26 10:14:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:14:55,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:55,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:14:55,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:55,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:55,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:14:55,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:14:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:14:55,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822791024] [2021-03-26 10:14:55,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:14:55,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:14:55,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745057178] [2021-03-26 10:14:55,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:14:55,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:14:55,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:14:55,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:14:55,981 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 200 [2021-03-26 10:14:55,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:55,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:14:55,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 200 [2021-03-26 10:14:55,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:14:56,027 INFO L129 PetriNetUnfolder]: 249/530 cut-off events. [2021-03-26 10:14:56,027 INFO L130 PetriNetUnfolder]: For 2211/2553 co-relation queries the response was YES. [2021-03-26 10:14:56,029 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2073 conditions, 530 events. 249/530 cut-off events. For 2211/2553 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 3320 event pairs, 0 based on Foata normal form. 23/463 useless extension candidates. Maximal degree in co-relation 2043. Up to 214 conditions per place. [2021-03-26 10:14:56,030 INFO L132 encePairwiseOnDemand]: 197/200 looper letters, 3 selfloop transitions, 2 changer transitions 9/49 dead transitions. [2021-03-26 10:14:56,030 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 49 transitions, 334 flow [2021-03-26 10:14:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:14:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:14:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 698 transitions. [2021-03-26 10:14:56,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8725 [2021-03-26 10:14:56,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 698 transitions. [2021-03-26 10:14:56,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 698 transitions. [2021-03-26 10:14:56,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:14:56,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 698 transitions. [2021-03-26 10:14:56,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.5) internal successors, (698), 4 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,035 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 200.0) internal successors, (1000), 5 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,035 INFO L185 Difference]: Start difference. First operand has 68 places, 48 transitions, 322 flow. Second operand 4 states and 698 transitions. [2021-03-26 10:14:56,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 49 transitions, 334 flow [2021-03-26 10:14:56,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 49 transitions, 273 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-26 10:14:56,041 INFO L241 Difference]: Finished difference. Result has 65 places, 40 transitions, 218 flow [2021-03-26 10:14:56,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2021-03-26 10:14:56,041 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2021-03-26 10:14:56,041 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:14:56,042 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 40 transitions, 218 flow [2021-03-26 10:14:56,042 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 40 transitions, 218 flow [2021-03-26 10:14:56,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 40 transitions, 218 flow [2021-03-26 10:14:56,050 INFO L129 PetriNetUnfolder]: 55/137 cut-off events. [2021-03-26 10:14:56,050 INFO L130 PetriNetUnfolder]: For 324/355 co-relation queries the response was YES. [2021-03-26 10:14:56,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 137 events. 55/137 cut-off events. For 324/355 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 574 event pairs, 0 based on Foata normal form. 4/127 useless extension candidates. Maximal degree in co-relation 386. Up to 44 conditions per place. [2021-03-26 10:14:56,051 INFO L142 LiptonReduction]: Number of co-enabled transitions 342 [2021-03-26 10:14:56,120 INFO L154 LiptonReduction]: Checked pairs total: 80 [2021-03-26 10:14:56,121 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:14:56,121 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 80 [2021-03-26 10:14:56,121 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 216 flow [2021-03-26 10:14:56,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:14:56,121 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:14:56,121 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 10:14:56,122 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:14:56,122 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:14:56,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:14:56,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1795934929, now seen corresponding path program 1 times [2021-03-26 10:14:56,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:14:56,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174838068] [2021-03-26 10:14:56,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:14:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:56,142 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:14:56,159 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:14:56,193 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:14:56,193 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:14:56,193 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:14:56,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:14:56 BasicIcfg [2021-03-26 10:14:56,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:14:56,271 INFO L168 Benchmark]: Toolchain (without parser) took 22200.12 ms. Allocated memory was 339.7 MB in the beginning and 715.1 MB in the end (delta: 375.4 MB). Free memory was 303.0 MB in the beginning and 399.3 MB in the end (delta: -96.3 MB). Peak memory consumption was 282.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:56,271 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 339.7 MB. Free memory was 321.0 MB in the beginning and 320.9 MB in the end (delta: 78.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:14:56,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.20 ms. Allocated memory is still 339.7 MB. Free memory was 302.9 MB in the beginning and 299.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:56,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.77 ms. Allocated memory is still 339.7 MB. Free memory was 299.8 MB in the beginning and 297.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:56,275 INFO L168 Benchmark]: Boogie Preprocessor took 48.33 ms. Allocated memory is still 339.7 MB. Free memory was 297.7 MB in the beginning and 294.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:56,278 INFO L168 Benchmark]: RCFGBuilder took 1376.41 ms. Allocated memory is still 339.7 MB. Free memory was 294.6 MB in the beginning and 265.0 MB in the end (delta: 29.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:56,280 INFO L168 Benchmark]: TraceAbstraction took 20322.75 ms. Allocated memory was 339.7 MB in the beginning and 715.1 MB in the end (delta: 375.4 MB). Free memory was 265.0 MB in the beginning and 399.3 MB in the end (delta: -134.3 MB). Peak memory consumption was 241.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:14:56,281 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.37 ms. Allocated memory is still 339.7 MB. Free memory was 321.0 MB in the beginning and 320.9 MB in the end (delta: 78.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 407.20 ms. Allocated memory is still 339.7 MB. Free memory was 302.9 MB in the beginning and 299.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 41.77 ms. Allocated memory is still 339.7 MB. Free memory was 299.8 MB in the beginning and 297.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 48.33 ms. Allocated memory is still 339.7 MB. Free memory was 297.7 MB in the beginning and 294.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1376.41 ms. Allocated memory is still 339.7 MB. Free memory was 294.6 MB in the beginning and 265.0 MB in the end (delta: 29.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20322.75 ms. Allocated memory was 339.7 MB in the beginning and 715.1 MB in the end (delta: 375.4 MB). Free memory was 265.0 MB in the beginning and 399.3 MB in the end (delta: -134.3 MB). Peak memory consumption was 241.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: 7412.2ms, 120 PlacesBefore, 57 PlacesAfterwards, 109 TransitionsBefore, 45 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 72 TotalNumberOfCompositions, 4266 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 2237, positive unconditional: 0, negative: 99, negative conditional: 99, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 0, positive unconditional: 2237, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2336, positive: 2237, positive conditional: 0, positive unconditional: 2237, negative: 99, negative conditional: 0, negative unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1657, positive: 1612, positive conditional: 0, positive unconditional: 1612, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1657, positive: 1594, positive conditional: 0, positive unconditional: 1594, negative: 63, negative conditional: 0, negative unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 607, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 569, negative conditional: 0, negative unconditional: 569, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2336, positive: 625, positive conditional: 0, positive unconditional: 625, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 1657, unknown conditional: 0, unknown unconditional: 1657] , Statistics on independence cache: Total cache size (in pairs): 1657, Positive cache size: 1612, Positive conditional cache size: 0, Positive unconditional cache size: 1612, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3005.0ms, 53 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 1530 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 430, positive: 337, positive conditional: 337, positive unconditional: 0, negative: 93, negative conditional: 93, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 430, positive: 337, positive conditional: 47, positive unconditional: 290, negative: 93, negative conditional: 22, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 430, positive: 337, positive conditional: 47, positive unconditional: 290, negative: 93, negative conditional: 22, negative unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, positive: 56, positive conditional: 7, positive unconditional: 49, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 20, negative conditional: 7, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 300, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 287, negative conditional: 137, negative unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 430, positive: 281, positive conditional: 40, positive unconditional: 241, negative: 73, negative conditional: 15, negative unconditional: 58, unknown: 76, unknown conditional: 14, unknown unconditional: 62] , Statistics on independence cache: Total cache size (in pairs): 1733, Positive cache size: 1668, Positive conditional cache size: 7, Positive unconditional cache size: 1661, Negative cache size: 65, Negative conditional cache size: 7, Negative unconditional cache size: 58, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1338.2ms, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1020 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 241, positive: 181, positive conditional: 181, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 241, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 241, positive: 181, positive conditional: 0, positive unconditional: 181, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 98, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 98, negative conditional: 0, negative unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 241, positive: 170, positive conditional: 0, positive unconditional: 170, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1746, Positive cache size: 1679, Positive conditional cache size: 7, Positive unconditional cache size: 1672, Negative cache size: 67, Negative conditional cache size: 7, Negative unconditional cache size: 60, Eliminated conditions: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 42.4ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 310 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 80, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, positive: 63, positive conditional: 12, positive unconditional: 51, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 63, positive conditional: 12, positive unconditional: 51, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, positive: 34, positive conditional: 34, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 57, positive conditional: 7, positive unconditional: 50, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1752, Positive cache size: 1685, Positive conditional cache size: 12, Positive unconditional cache size: 1673, Negative cache size: 67, Negative conditional cache size: 7, Negative unconditional cache size: 60, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.3ms, 46 PlacesBefore, 46 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 474 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 267 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 104, positive: 91, positive conditional: 91, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, positive: 91, positive conditional: 23, positive unconditional: 68, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 104, positive: 91, positive conditional: 23, positive unconditional: 68, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 6, positive unconditional: 9, 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: 15, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 104, positive: 76, positive conditional: 17, positive unconditional: 59, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 15, unknown conditional: 6, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1767, Positive cache size: 1700, Positive conditional cache size: 18, Positive unconditional cache size: 1682, Negative cache size: 67, Negative conditional cache size: 7, Negative unconditional cache size: 60, Eliminated conditions: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 762.8ms, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 617 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, positive: 167, positive conditional: 167, positive unconditional: 0, negative: 30, negative conditional: 30, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 197, positive: 167, positive conditional: 43, positive unconditional: 124, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 197, positive: 167, positive conditional: 43, positive unconditional: 124, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 3, positive unconditional: 8, 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: 13, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 197, positive: 156, positive conditional: 40, positive unconditional: 116, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 13, unknown conditional: 3, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 1780, Positive cache size: 1711, Positive conditional cache size: 21, Positive unconditional cache size: 1690, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.7ms, 52 PlacesBefore, 52 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 371 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, positive: 78, positive conditional: 78, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, positive: 78, positive conditional: 32, positive unconditional: 46, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 78, positive conditional: 32, positive unconditional: 46, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 67, positive conditional: 22, positive unconditional: 45, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1791, Positive cache size: 1722, Positive conditional cache size: 31, Positive unconditional cache size: 1691, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.9ms, 56 PlacesBefore, 56 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 798 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 322 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, positive: 116, positive conditional: 116, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 127, positive: 116, positive conditional: 54, positive unconditional: 62, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 127, positive: 116, positive conditional: 54, positive unconditional: 62, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 8, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 127, positive: 100, positive conditional: 46, positive unconditional: 54, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 16, unknown conditional: 8, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1807, Positive cache size: 1738, Positive conditional cache size: 39, Positive unconditional cache size: 1699, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.5ms, 64 PlacesBefore, 64 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 1022 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 394 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, positive: 149, positive conditional: 149, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, positive: 149, positive conditional: 87, positive unconditional: 62, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 149, positive conditional: 87, positive unconditional: 62, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 160, positive: 137, positive conditional: 75, positive unconditional: 62, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 12, unknown conditional: 12, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1819, Positive cache size: 1750, Positive conditional cache size: 51, Positive unconditional cache size: 1699, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.5ms, 64 PlacesBefore, 64 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 1022 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 438 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 74, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 74, positive: 62, positive conditional: 36, positive unconditional: 26, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 62, positive conditional: 36, positive unconditional: 26, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 56, positive conditional: 30, positive unconditional: 26, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1825, Positive cache size: 1756, Positive conditional cache size: 57, Positive unconditional cache size: 1699, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.5ms, 74 PlacesBefore, 74 PlacesAfterwards, 64 TransitionsBefore, 61 TransitionsAfterwards, 1098 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1312 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, positive: 267, positive conditional: 267, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 299, positive: 267, positive conditional: 194, positive unconditional: 73, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 299, positive: 267, positive conditional: 194, positive unconditional: 73, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 10, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 299, positive: 257, positive conditional: 184, positive unconditional: 73, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1835, Positive cache size: 1766, Positive conditional cache size: 67, Positive unconditional cache size: 1699, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.8ms, 64 PlacesBefore, 64 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 696 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 177 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 87, positive conditional: 87, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, positive: 87, positive conditional: 57, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 87, positive conditional: 57, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 81, positive conditional: 51, positive unconditional: 30, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1841, Positive cache size: 1772, Positive conditional cache size: 73, Positive unconditional cache size: 1699, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4605.2ms, 72 PlacesBefore, 68 PlacesAfterwards, 51 TransitionsBefore, 48 TransitionsAfterwards, 660 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 696 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 348, positive: 324, positive conditional: 324, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 348, positive: 324, positive conditional: 206, positive unconditional: 118, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 348, positive: 324, positive conditional: 206, positive unconditional: 118, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 348, positive: 321, positive conditional: 203, positive unconditional: 118, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1844, Positive cache size: 1775, Positive conditional cache size: 76, Positive unconditional cache size: 1699, Negative cache size: 69, Negative conditional cache size: 7, Negative unconditional cache size: 62, Eliminated conditions: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.9ms, 65 PlacesBefore, 59 PlacesAfterwards, 40 TransitionsBefore, 38 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, positive: 64, positive conditional: 64, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, positive: 64, positive conditional: 9, positive unconditional: 55, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 64, positive conditional: 9, positive unconditional: 55, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 4, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, positive: 53, positive conditional: 5, positive unconditional: 48, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1856, Positive cache size: 1786, Positive conditional cache size: 80, Positive unconditional cache size: 1706, Negative cache size: 70, Negative conditional cache size: 7, Negative unconditional cache size: 63, Eliminated conditions: 46 - 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1477; [L837] FCALL, FORK 0 pthread_create(&t1477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1478; [L839] FCALL, FORK 0 pthread_create(&t1478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1479; [L841] FCALL, FORK 0 pthread_create(&t1479, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1480; [L843] FCALL, FORK 0 pthread_create(&t1480, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$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_p1_EAX=0, __unbuffered_p3_EAX=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=51, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 112 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20148.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1098.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7494.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 45 SDtfs, 26 SDslu, 24 SDs, 0 SdLazy, 292 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 244.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 266.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=509occurred in iteration=10, InterpolantAutomatonStates: 64, 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: 75.9ms SsaConstructionTime, 366.3ms SatisfiabilityAnalysisTime, 757.4ms InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...