/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 00:42:05,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 00:42:05,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 00:42:05,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 00:42:05,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 00:42:05,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 00:42:05,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 00:42:05,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 00:42:05,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 00:42:05,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 00:42:05,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 00:42:05,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 00:42:05,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 00:42:05,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 00:42:05,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 00:42:05,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 00:42:05,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 00:42:05,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 00:42:05,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 00:42:05,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 00:42:05,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 00:42:05,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 00:42:05,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 00:42:05,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 00:42:05,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 00:42:05,922 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 00:42:05,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 00:42:05,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 00:42:05,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 00:42:05,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 00:42:05,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 00:42:05,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 00:42:05,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 00:42:05,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 00:42:05,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 00:42:05,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 00:42:05,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 00:42:05,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 00:42:05,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 00:42:05,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 00:42:05,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 00:42:05,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 00:42:05,964 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 00:42:05,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 00:42:05,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 00:42:05,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 00:42:05,966 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 00:42:05,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 00:42:05,967 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 00:42:05,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 00:42:05,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 00:42:05,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 00:42:05,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 00:42:05,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 00:42:05,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 00:42:05,968 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 00:42:05,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 00:42:05,969 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 00:42:05,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 00:42:05,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 00:42:05,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 00:42:05,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 00:42:05,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 00:42:05,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:42:05,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 00:42:05,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 00:42:05,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 00:42:05,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 00:42:05,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 00:42:05,971 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 00:42:05,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 00:42:05,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 00:42:05,972 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-04-29 00:42:06,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 00:42:06,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 00:42:06,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 00:42:06,391 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-29 00:42:06,392 INFO L275 PluginConnector]: CDTParser initialized [2021-04-29 00:42:06,393 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc.i [2021-04-29 00:42:06,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8605cbffc/5e1c3111f13545f48614e1d7560d637a/FLAG21bb894ff [2021-04-29 00:42:07,274 INFO L306 CDTParser]: Found 1 translation units. [2021-04-29 00:42:07,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc.i [2021-04-29 00:42:07,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8605cbffc/5e1c3111f13545f48614e1d7560d637a/FLAG21bb894ff [2021-04-29 00:42:07,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8605cbffc/5e1c3111f13545f48614e1d7560d637a [2021-04-29 00:42:07,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 00:42:07,627 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-29 00:42:07,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-29 00:42:07,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-29 00:42:07,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-29 00:42:07,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:42:07" (1/1) ... [2021-04-29 00:42:07,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c44804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:07, skipping insertion in model container [2021-04-29 00:42:07,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:42:07" (1/1) ... [2021-04-29 00:42:07,644 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-29 00:42:07,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-29 00:42:07,895 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/safe032_power.oepc.i[995,1008] [2021-04-29 00:42:08,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:42:08,200 INFO L203 MainTranslator]: Completed pre-run [2021-04-29 00:42:08,214 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/safe032_power.oepc.i[995,1008] [2021-04-29 00:42:08,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:42:08,434 INFO L208 MainTranslator]: Completed translation [2021-04-29 00:42:08,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08 WrapperNode [2021-04-29 00:42:08,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-29 00:42:08,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 00:42:08,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 00:42:08,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 00:42:08,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 00:42:08,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 00:42:08,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 00:42:08,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 00:42:08,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... [2021-04-29 00:42:08,612 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 00:42:08,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 00:42:08,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 00:42:08,613 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 00:42:08,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:42:08,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-29 00:42:08,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-29 00:42:08,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-29 00:42:08,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-29 00:42:08,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-29 00:42:08,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-29 00:42:08,735 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-29 00:42:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-29 00:42:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-29 00:42:08,736 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-29 00:42:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-29 00:42:08,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-29 00:42:08,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 00:42:08,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 00:42:08,740 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 00:42:12,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 00:42:12,538 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-29 00:42:12,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:42:12 BoogieIcfgContainer [2021-04-29 00:42:12,540 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 00:42:12,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 00:42:12,542 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 00:42:12,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 00:42:12,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 12:42:07" (1/3) ... [2021-04-29 00:42:12,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e3ac05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:42:12, skipping insertion in model container [2021-04-29 00:42:12,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:42:08" (2/3) ... [2021-04-29 00:42:12,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e3ac05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:42:12, skipping insertion in model container [2021-04-29 00:42:12,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:42:12" (3/3) ... [2021-04-29 00:42:12,550 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc.i [2021-04-29 00:42:12,557 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 00:42:12,570 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 00:42:12,571 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 00:42:12,625 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,626 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,626 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,627 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,627 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,627 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,628 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,645 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,648 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,649 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,650 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,654 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,656 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,668 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,669 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,669 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,669 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,669 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,670 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,670 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,670 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,671 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,678 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,688 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,690 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:42:12,697 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 00:42:12,721 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-29 00:42:12,751 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 00:42:12,751 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 00:42:12,751 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 00:42:12,751 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 00:42:12,752 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 00:42:12,752 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 00:42:12,752 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 00:42:12,752 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 00:42:12,766 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-04-29 00:42:12,814 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-04-29 00:42:12,814 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:42:12,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-29 00:42:12,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-04-29 00:42:12,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:12,828 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:42:12,846 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:12,850 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:12,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-04-29 00:42:12,881 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-04-29 00:42:12,881 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:42:12,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-04-29 00:42:12,886 INFO L146 LiptonReduction]: Number of co-enabled transitions 1668 [2021-04-29 00:42:15,953 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-29 00:42:16,074 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:42:16,654 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-29 00:42:16,872 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:42:18,218 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:42:18,785 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-04-29 00:42:21,116 WARN L205 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-04-29 00:42:22,178 WARN L205 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 264 [2021-04-29 00:42:23,365 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:42:23,912 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-04-29 00:42:26,299 WARN L205 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-04-29 00:42:27,386 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:42:30,540 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-04-29 00:42:31,137 WARN L205 SmtUtils]: Spent 594.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:42:32,398 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:42:33,687 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:42:34,337 WARN L205 SmtUtils]: Spent 641.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:42:34,909 WARN L205 SmtUtils]: Spent 569.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:42:36,184 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:42:37,487 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:42:38,777 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 189 DAG size of output: 188 [2021-04-29 00:42:39,422 WARN L205 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:42:40,690 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:42:41,956 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:42:43,222 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-04-29 00:42:43,845 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:42:45,164 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:42:46,464 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:42:47,767 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 190 DAG size of output: 189 [2021-04-29 00:42:48,465 WARN L205 SmtUtils]: Spent 693.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:42:49,741 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 269 [2021-04-29 00:42:51,067 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 269 [2021-04-29 00:42:55,122 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-04-29 00:42:55,811 WARN L205 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:42:58,803 WARN L205 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 267 DAG size of output: 266 [2021-04-29 00:43:00,223 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 266 [2021-04-29 00:43:00,996 WARN L205 SmtUtils]: Spent 768.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:43:01,766 WARN L205 SmtUtils]: Spent 768.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:43:04,691 WARN L205 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-04-29 00:43:06,243 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:43:09,919 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:43:14,394 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:14,499 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:14,602 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:14,707 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:43:17,061 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:43:17,395 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:17,535 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:17,677 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:17,819 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:43:18,006 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:18,192 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:18,385 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:18,570 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:43:18,778 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:43:18,882 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:43:18,985 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:43:19,132 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:19,284 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:19,432 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:19,580 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:43:19,695 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:19,824 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:19,942 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:20,060 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:43:20,234 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:20,406 WARN L205 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:20,582 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:20,741 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:20,859 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:20,976 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:21,099 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:21,239 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:43:21,413 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:21,607 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:21,782 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:21,956 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:43:22,064 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:22,168 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:22,278 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:22,385 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:43:22,922 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:23,071 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:23,226 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:23,373 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:23,521 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:23,666 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:23,822 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:23,972 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:24,137 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:24,300 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:24,469 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:24,643 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:43:24,782 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:24,925 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:25,058 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:25,192 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:43:25,329 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:25,470 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:25,593 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:25,714 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:25,908 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:43:26,066 WARN L205 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:43:26,223 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:43:26,376 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2021-04-29 00:43:28,618 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:43:29,186 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:43:29,350 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:43:29,513 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:43:29,677 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2021-04-29 00:43:30,252 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:30,474 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:30,690 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:30,904 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:31,028 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:31,148 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:31,280 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:31,420 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:31,573 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:31,725 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:31,878 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:32,031 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:43:32,197 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:32,391 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:32,560 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:32,726 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:43:32,950 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:43:33,171 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:43:33,408 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:43:33,641 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:43:33,840 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:43:34,061 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:43:34,266 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:43:34,476 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:43:34,682 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:43:34,885 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:43:35,113 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:43:35,342 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:43:35,484 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:35,604 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:35,741 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:35,883 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:43:36,132 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:36,394 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:36,646 WARN L205 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:36,891 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:37,151 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:37,398 WARN L205 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:37,641 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:37,891 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:38,567 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2021-04-29 00:43:38,897 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-04-29 00:43:39,564 WARN L205 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 107 [2021-04-29 00:43:39,883 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-04-29 00:43:40,145 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:40,407 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:40,671 WARN L205 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:40,932 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:41,201 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:41,470 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:41,724 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:41,977 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:42,217 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:43:42,454 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:43:42,700 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:43:42,939 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:43:43,158 WARN L205 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:43,380 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:43,601 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:43,827 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:43:44,081 WARN L205 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:43:44,315 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:43:44,557 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:43:44,789 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:43:45,044 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:45,293 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:45,543 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:45,783 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:43:46,491 WARN L205 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-04-29 00:43:46,819 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-04-29 00:43:47,496 WARN L205 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-04-29 00:43:47,841 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-04-29 00:43:47,891 INFO L158 LiptonReduction]: Checked pairs total: 15353 [2021-04-29 00:43:47,892 INFO L160 LiptonReduction]: Total number of compositions: 228 [2021-04-29 00:43:47,897 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95071 [2021-04-29 00:43:47,942 INFO L129 PetriNetUnfolder]: 1/80 cut-off events. [2021-04-29 00:43:47,943 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:43:47,947 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:47,948 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:47,948 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:47,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:47,956 INFO L82 PathProgramCache]: Analyzing trace with hash 911075325, now seen corresponding path program 1 times [2021-04-29 00:43:47,967 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:47,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587960105] [2021-04-29 00:43:47,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:48,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:48,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:43:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:43:48,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587960105] [2021-04-29 00:43:48,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:43:48,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:43:48,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547427897] [2021-04-29 00:43:48,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:43:48,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:43:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:43:48,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:43:48,325 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 325 [2021-04-29 00:43:48,331 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 118 transitions, 245 flow. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:48,331 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:43:48,331 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 325 [2021-04-29 00:43:48,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:43:49,143 INFO L129 PetriNetUnfolder]: 575/1231 cut-off events. [2021-04-29 00:43:49,143 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:43:49,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2141 conditions, 1231 events. 575/1231 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 8496 event pairs, 219 based on Foata normal form. 23/723 useless extension candidates. Maximal degree in co-relation 2068. Up to 661 conditions per place. [2021-04-29 00:43:49,156 INFO L132 encePairwiseOnDemand]: 306/325 looper letters, 13 selfloop transitions, 2 changer transitions 82/129 dead transitions. [2021-04-29 00:43:49,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 361 flow [2021-04-29 00:43:49,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:43:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:43:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2021-04-29 00:43:49,184 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7907692307692308 [2021-04-29 00:43:49,187 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 771 transitions. [2021-04-29 00:43:49,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 771 transitions. [2021-04-29 00:43:49,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:43:49,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 771 transitions. [2021-04-29 00:43:49,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,244 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,250 INFO L185 Difference]: Start difference. First operand has 126 places, 118 transitions, 245 flow. Second operand 3 states and 771 transitions. [2021-04-29 00:43:49,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 361 flow [2021-04-29 00:43:49,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 129 transitions, 358 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 00:43:49,260 INFO L241 Difference]: Finished difference. Result has 122 places, 41 transitions, 92 flow [2021-04-29 00:43:49,264 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=122, PETRI_TRANSITIONS=41} [2021-04-29 00:43:49,265 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -4 predicate places. [2021-04-29 00:43:49,265 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:43:49,266 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 41 transitions, 92 flow [2021-04-29 00:43:49,268 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 41 transitions, 92 flow [2021-04-29 00:43:49,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 92 flow [2021-04-29 00:43:49,276 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-04-29 00:43:49,276 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:43:49,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 127 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 00:43:49,278 INFO L146 LiptonReduction]: Number of co-enabled transitions 932 [2021-04-29 00:43:49,475 INFO L158 LiptonReduction]: Checked pairs total: 904 [2021-04-29 00:43:49,475 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:43:49,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 211 [2021-04-29 00:43:49,477 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2021-04-29 00:43:49,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,479 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:49,479 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:49,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 00:43:49,479 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:49,480 INFO L82 PathProgramCache]: Analyzing trace with hash -629871503, now seen corresponding path program 1 times [2021-04-29 00:43:49,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:49,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605157898] [2021-04-29 00:43:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:49,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:49,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:43:49,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:43:49,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605157898] [2021-04-29 00:43:49,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:43:49,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:43:49,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981290851] [2021-04-29 00:43:49,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:43:49,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:43:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:43:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:43:49,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 325 [2021-04-29 00:43:49,675 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:43:49,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 325 [2021-04-29 00:43:49,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:43:49,705 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-04-29 00:43:49,705 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:43:49,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 136 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 00:43:49,707 INFO L132 encePairwiseOnDemand]: 322/325 looper letters, 1 selfloop transitions, 2 changer transitions 12/41 dead transitions. [2021-04-29 00:43:49,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 41 transitions, 98 flow [2021-04-29 00:43:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:43:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:43:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2021-04-29 00:43:49,712 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6964102564102564 [2021-04-29 00:43:49,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 679 transitions. [2021-04-29 00:43:49,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 679 transitions. [2021-04-29 00:43:49,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:43:49,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 679 transitions. [2021-04-29 00:43:49,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:49,723 INFO L185 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 679 transitions. [2021-04-29 00:43:49,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 41 transitions, 98 flow [2021-04-29 00:43:49,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 41 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:43:49,725 INFO L241 Difference]: Finished difference. Result has 51 places, 29 transitions, 72 flow [2021-04-29 00:43:49,726 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2021-04-29 00:43:49,726 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -75 predicate places. [2021-04-29 00:43:49,726 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:43:49,727 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 29 transitions, 72 flow [2021-04-29 00:43:49,728 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 29 transitions, 72 flow [2021-04-29 00:43:49,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 72 flow [2021-04-29 00:43:49,739 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-04-29 00:43:49,739 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:43:49,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 00:43:49,742 INFO L146 LiptonReduction]: Number of co-enabled transitions 456 [2021-04-29 00:43:50,263 INFO L158 LiptonReduction]: Checked pairs total: 564 [2021-04-29 00:43:50,263 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:43:50,263 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 537 [2021-04-29 00:43:50,264 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 72 flow [2021-04-29 00:43:50,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:50,265 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:50,266 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:50,266 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 00:43:50,266 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:50,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:50,267 INFO L82 PathProgramCache]: Analyzing trace with hash -671828733, now seen corresponding path program 1 times [2021-04-29 00:43:50,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:50,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738372357] [2021-04-29 00:43:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:50,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:50,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:43:50,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:43:50,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738372357] [2021-04-29 00:43:50,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:43:50,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:43:50,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739083631] [2021-04-29 00:43:50,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:43:50,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:43:50,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:43:50,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:43:50,450 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 325 [2021-04-29 00:43:50,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:50,452 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:43:50,452 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 325 [2021-04-29 00:43:50,452 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:43:50,509 INFO L129 PetriNetUnfolder]: 3/43 cut-off events. [2021-04-29 00:43:50,509 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-04-29 00:43:50,509 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 43 events. 3/43 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 114 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 59. Up to 10 conditions per place. [2021-04-29 00:43:50,510 INFO L132 encePairwiseOnDemand]: 321/325 looper letters, 3 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-04-29 00:43:50,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 88 flow [2021-04-29 00:43:50,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:43:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:43:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2021-04-29 00:43:50,515 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8102564102564103 [2021-04-29 00:43:50,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 790 transitions. [2021-04-29 00:43:50,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 790 transitions. [2021-04-29 00:43:50,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:43:50,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 790 transitions. [2021-04-29 00:43:50,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:50,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:50,524 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:50,524 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 72 flow. Second operand 3 states and 790 transitions. [2021-04-29 00:43:50,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 88 flow [2021-04-29 00:43:50,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:43:50,526 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 87 flow [2021-04-29 00:43:50,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-04-29 00:43:50,526 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -86 predicate places. [2021-04-29 00:43:50,526 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:43:50,527 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 87 flow [2021-04-29 00:43:50,527 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 87 flow [2021-04-29 00:43:50,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 87 flow [2021-04-29 00:43:50,537 INFO L129 PetriNetUnfolder]: 3/43 cut-off events. [2021-04-29 00:43:50,537 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-04-29 00:43:50,538 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 43 events. 3/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 110 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 60. Up to 10 conditions per place. [2021-04-29 00:43:50,538 INFO L146 LiptonReduction]: Number of co-enabled transitions 486 [2021-04-29 00:43:50,618 INFO L158 LiptonReduction]: Checked pairs total: 516 [2021-04-29 00:43:50,618 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:43:50,618 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 92 [2021-04-29 00:43:50,619 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 87 flow [2021-04-29 00:43:50,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 261.6666666666667) internal successors, (785), 3 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:50,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:50,621 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:50,621 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 00:43:50,621 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:50,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:50,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2105878562, now seen corresponding path program 1 times [2021-04-29 00:43:50,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:50,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596229850] [2021-04-29 00:43:50,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:50,875 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-04-29 00:43:50,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:43:50,899 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-04-29 00:43:50,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-04-29 00:43:50,964 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-04-29 00:43:50,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-04-29 00:43:51,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:51,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:43:51,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:51,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:43:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:43:51,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596229850] [2021-04-29 00:43:51,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:43:51,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:43:51,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280917021] [2021-04-29 00:43:51,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:43:51,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:43:51,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:43:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:43:51,116 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 325 [2021-04-29 00:43:51,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 87 flow. Second operand has 7 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:51,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:43:51,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 325 [2021-04-29 00:43:51,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:43:51,598 INFO L129 PetriNetUnfolder]: 173/438 cut-off events. [2021-04-29 00:43:51,598 INFO L130 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2021-04-29 00:43:51,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 438 events. 173/438 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2697 event pairs, 17 based on Foata normal form. 10/336 useless extension candidates. Maximal degree in co-relation 790. Up to 190 conditions per place. [2021-04-29 00:43:51,604 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 17 selfloop transitions, 13 changer transitions 0/51 dead transitions. [2021-04-29 00:43:51,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 189 flow [2021-04-29 00:43:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:43:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:43:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1059 transitions. [2021-04-29 00:43:51,612 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5430769230769231 [2021-04-29 00:43:51,612 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1059 transitions. [2021-04-29 00:43:51,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1059 transitions. [2021-04-29 00:43:51,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:43:51,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1059 transitions. [2021-04-29 00:43:51,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.5) internal successors, (1059), 6 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:51,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:51,625 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:51,625 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 87 flow. Second operand 6 states and 1059 transitions. [2021-04-29 00:43:51,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 189 flow [2021-04-29 00:43:51,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:43:51,628 INFO L241 Difference]: Finished difference. Result has 47 places, 42 transitions, 170 flow [2021-04-29 00:43:51,628 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2021-04-29 00:43:51,628 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -79 predicate places. [2021-04-29 00:43:51,629 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:43:51,629 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 42 transitions, 170 flow [2021-04-29 00:43:51,629 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 170 flow [2021-04-29 00:43:51,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 170 flow [2021-04-29 00:43:51,677 INFO L129 PetriNetUnfolder]: 57/222 cut-off events. [2021-04-29 00:43:51,678 INFO L130 PetriNetUnfolder]: For 151/164 co-relation queries the response was YES. [2021-04-29 00:43:51,679 INFO L84 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 222 events. 57/222 cut-off events. For 151/164 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1326 event pairs, 17 based on Foata normal form. 3/162 useless extension candidates. Maximal degree in co-relation 490. Up to 71 conditions per place. [2021-04-29 00:43:51,682 INFO L146 LiptonReduction]: Number of co-enabled transitions 640 [2021-04-29 00:43:51,942 INFO L158 LiptonReduction]: Checked pairs total: 99 [2021-04-29 00:43:51,942 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:43:51,942 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 314 [2021-04-29 00:43:51,944 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 170 flow [2021-04-29 00:43:51,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 171.85714285714286) internal successors, (1203), 7 states have internal predecessors, (1203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:51,946 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:51,946 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:51,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 00:43:51,946 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash 348110229, now seen corresponding path program 1 times [2021-04-29 00:43:51,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:51,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423147866] [2021-04-29 00:43:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:52,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:52,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:43:52,126 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-04-29 00:43:52,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:43:52,146 INFO L142 QuantifierPusher]: treesize reduction 10, result has 58.3 percent of original size [2021-04-29 00:43:52,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:43:52,150 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-04-29 00:43:52,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:43:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:43:52,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423147866] [2021-04-29 00:43:52,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:43:52,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:43:52,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326253205] [2021-04-29 00:43:52,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:43:52,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:43:52,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:43:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:43:52,180 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 325 [2021-04-29 00:43:52,182 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 170 flow. Second operand has 5 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-04-29 00:43:52,182 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:43:52,182 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 325 [2021-04-29 00:43:52,182 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:43:52,619 INFO L129 PetriNetUnfolder]: 188/479 cut-off events. [2021-04-29 00:43:52,619 INFO L130 PetriNetUnfolder]: For 369/384 co-relation queries the response was YES. [2021-04-29 00:43:52,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 479 events. 188/479 cut-off events. For 369/384 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3079 event pairs, 14 based on Foata normal form. 10/387 useless extension candidates. Maximal degree in co-relation 1273. Up to 214 conditions per place. [2021-04-29 00:43:52,626 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 20 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2021-04-29 00:43:52,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 339 flow [2021-04-29 00:43:52,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:43:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:43:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1036 transitions. [2021-04-29 00:43:52,633 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5312820512820513 [2021-04-29 00:43:52,633 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1036 transitions. [2021-04-29 00:43:52,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1036 transitions. [2021-04-29 00:43:52,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:43:52,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1036 transitions. [2021-04-29 00:43:52,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 172.66666666666666) internal successors, (1036), 6 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:52,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:52,645 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:52,645 INFO L185 Difference]: Start difference. First operand has 47 places, 42 transitions, 170 flow. Second operand 6 states and 1036 transitions. [2021-04-29 00:43:52,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 339 flow [2021-04-29 00:43:52,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 61 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-29 00:43:52,652 INFO L241 Difference]: Finished difference. Result has 55 places, 55 transitions, 335 flow [2021-04-29 00:43:52,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2021-04-29 00:43:52,652 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -71 predicate places. [2021-04-29 00:43:52,652 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:43:52,653 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 55 transitions, 335 flow [2021-04-29 00:43:52,653 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 55 transitions, 335 flow [2021-04-29 00:43:52,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 55 transitions, 335 flow [2021-04-29 00:43:52,719 INFO L129 PetriNetUnfolder]: 76/251 cut-off events. [2021-04-29 00:43:52,719 INFO L130 PetriNetUnfolder]: For 401/437 co-relation queries the response was YES. [2021-04-29 00:43:52,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 251 events. 76/251 cut-off events. For 401/437 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1472 event pairs, 10 based on Foata normal form. 11/201 useless extension candidates. Maximal degree in co-relation 734. Up to 101 conditions per place. [2021-04-29 00:43:52,725 INFO L146 LiptonReduction]: Number of co-enabled transitions 780 [2021-04-29 00:43:52,843 INFO L158 LiptonReduction]: Checked pairs total: 138 [2021-04-29 00:43:52,843 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:43:52,844 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 192 [2021-04-29 00:43:52,845 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 335 flow [2021-04-29 00:43:52,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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-04-29 00:43:52,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:52,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:52,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 00:43:52,847 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:52,847 INFO L82 PathProgramCache]: Analyzing trace with hash 378070453, now seen corresponding path program 1 times [2021-04-29 00:43:52,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:52,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955309177] [2021-04-29 00:43:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:52,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:52,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:43:52,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:52,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:43:52,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:52,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:43:53,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:53,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:43:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:43:53,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955309177] [2021-04-29 00:43:53,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:43:53,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:43:53,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526918389] [2021-04-29 00:43:53,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:43:53,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:43:53,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:43:53,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:43:53,031 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 325 [2021-04-29 00:43:53,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 335 flow. Second operand has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:53,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:43:53,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 325 [2021-04-29 00:43:53,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:43:53,516 INFO L129 PetriNetUnfolder]: 193/554 cut-off events. [2021-04-29 00:43:53,516 INFO L130 PetriNetUnfolder]: For 711/786 co-relation queries the response was YES. [2021-04-29 00:43:53,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 554 events. 193/554 cut-off events. For 711/786 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3882 event pairs, 9 based on Foata normal form. 26/449 useless extension candidates. Maximal degree in co-relation 1751. Up to 207 conditions per place. [2021-04-29 00:43:53,524 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 27 selfloop transitions, 20 changer transitions 0/68 dead transitions. [2021-04-29 00:43:53,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 513 flow [2021-04-29 00:43:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:43:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:43:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1001 transitions. [2021-04-29 00:43:53,532 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5133333333333333 [2021-04-29 00:43:53,532 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1001 transitions. [2021-04-29 00:43:53,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1001 transitions. [2021-04-29 00:43:53,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:43:53,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1001 transitions. [2021-04-29 00:43:53,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:53,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:53,542 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:53,543 INFO L185 Difference]: Start difference. First operand has 55 places, 55 transitions, 335 flow. Second operand 6 states and 1001 transitions. [2021-04-29 00:43:53,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 513 flow [2021-04-29 00:43:53,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 68 transitions, 508 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-04-29 00:43:53,550 INFO L241 Difference]: Finished difference. Result has 61 places, 63 transitions, 483 flow [2021-04-29 00:43:53,551 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=483, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2021-04-29 00:43:53,551 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -65 predicate places. [2021-04-29 00:43:53,551 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:43:53,551 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 63 transitions, 483 flow [2021-04-29 00:43:53,551 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 63 transitions, 483 flow [2021-04-29 00:43:53,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 63 transitions, 483 flow [2021-04-29 00:43:53,619 INFO L129 PetriNetUnfolder]: 72/270 cut-off events. [2021-04-29 00:43:53,620 INFO L130 PetriNetUnfolder]: For 567/586 co-relation queries the response was YES. [2021-04-29 00:43:53,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 270 events. 72/270 cut-off events. For 567/586 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1702 event pairs, 7 based on Foata normal form. 12/213 useless extension candidates. Maximal degree in co-relation 904. Up to 102 conditions per place. [2021-04-29 00:43:53,626 INFO L146 LiptonReduction]: Number of co-enabled transitions 894 [2021-04-29 00:43:54,857 INFO L158 LiptonReduction]: Checked pairs total: 162 [2021-04-29 00:43:54,857 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:43:54,858 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1307 [2021-04-29 00:43:54,865 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 483 flow [2021-04-29 00:43:54,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.6) internal successors, (818), 5 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:54,867 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:54,868 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:54,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 00:43:54,868 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1950000287, now seen corresponding path program 1 times [2021-04-29 00:43:54,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:54,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760300640] [2021-04-29 00:43:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:55,191 INFO L142 QuantifierPusher]: treesize reduction 40, result has 38.5 percent of original size [2021-04-29 00:43:55,192 INFO L147 QuantifierPusher]: treesize reduction 5, result has 80.0 percent of original size 20 [2021-04-29 00:43:55,256 INFO L142 QuantifierPusher]: treesize reduction 45, result has 33.8 percent of original size [2021-04-29 00:43:55,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-29 00:43:55,298 INFO L142 QuantifierPusher]: treesize reduction 40, result has 61.5 percent of original size [2021-04-29 00:43:55,304 INFO L147 QuantifierPusher]: treesize reduction 5, result has 92.2 percent of original size 59 [2021-04-29 00:43:55,329 INFO L142 QuantifierPusher]: treesize reduction 45, result has 55.4 percent of original size [2021-04-29 00:43:55,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-04-29 00:43:55,448 INFO L142 QuantifierPusher]: treesize reduction 26, result has 67.1 percent of original size [2021-04-29 00:43:55,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-04-29 00:43:55,546 INFO L142 QuantifierPusher]: treesize reduction 26, result has 68.3 percent of original size [2021-04-29 00:43:55,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-04-29 00:43:55,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:43:55,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:43:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:43:55,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760300640] [2021-04-29 00:43:55,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:43:55,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:43:55,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28953613] [2021-04-29 00:43:55,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:43:55,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:43:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:43:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:43:55,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 325 [2021-04-29 00:43:55,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 63 transitions, 483 flow. Second operand has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:55,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:43:55,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 325 [2021-04-29 00:43:55,724 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:43:56,832 INFO L129 PetriNetUnfolder]: 226/660 cut-off events. [2021-04-29 00:43:56,832 INFO L130 PetriNetUnfolder]: For 1474/1562 co-relation queries the response was YES. [2021-04-29 00:43:56,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2370 conditions, 660 events. 226/660 cut-off events. For 1474/1562 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4956 event pairs, 2 based on Foata normal form. 65/566 useless extension candidates. Maximal degree in co-relation 2347. Up to 260 conditions per place. [2021-04-29 00:43:56,844 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 40 selfloop transitions, 32 changer transitions 0/93 dead transitions. [2021-04-29 00:43:56,845 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 93 transitions, 862 flow [2021-04-29 00:43:56,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:43:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:43:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1488 transitions. [2021-04-29 00:43:56,888 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5087179487179487 [2021-04-29 00:43:56,888 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1488 transitions. [2021-04-29 00:43:56,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1488 transitions. [2021-04-29 00:43:56,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:43:56,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1488 transitions. [2021-04-29 00:43:56,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 165.33333333333334) internal successors, (1488), 9 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:56,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:56,905 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:56,906 INFO L185 Difference]: Start difference. First operand has 61 places, 63 transitions, 483 flow. Second operand 9 states and 1488 transitions. [2021-04-29 00:43:56,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 93 transitions, 862 flow [2021-04-29 00:43:56,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 822 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-04-29 00:43:56,920 INFO L241 Difference]: Finished difference. Result has 68 places, 79 transitions, 701 flow [2021-04-29 00:43:56,920 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=701, PETRI_PLACES=68, PETRI_TRANSITIONS=79} [2021-04-29 00:43:56,921 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -58 predicate places. [2021-04-29 00:43:56,921 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:43:56,921 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 79 transitions, 701 flow [2021-04-29 00:43:56,921 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 79 transitions, 701 flow [2021-04-29 00:43:56,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 79 transitions, 701 flow [2021-04-29 00:43:57,010 INFO L129 PetriNetUnfolder]: 82/317 cut-off events. [2021-04-29 00:43:57,011 INFO L130 PetriNetUnfolder]: For 845/863 co-relation queries the response was YES. [2021-04-29 00:43:57,013 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 317 events. 82/317 cut-off events. For 845/863 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2172 event pairs, 3 based on Foata normal form. 11/241 useless extension candidates. Maximal degree in co-relation 1115. Up to 114 conditions per place. [2021-04-29 00:43:57,021 INFO L146 LiptonReduction]: Number of co-enabled transitions 1090 [2021-04-29 00:43:59,371 INFO L158 LiptonReduction]: Checked pairs total: 210 [2021-04-29 00:43:59,371 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:43:59,371 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2450 [2021-04-29 00:43:59,372 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 79 transitions, 701 flow [2021-04-29 00:43:59,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 161.0) internal successors, (1288), 8 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:43:59,373 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:43:59,373 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:43:59,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 00:43:59,374 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:43:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:43:59,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1141866869, now seen corresponding path program 2 times [2021-04-29 00:43:59,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:43:59,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869524642] [2021-04-29 00:43:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:43:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:43:59,602 INFO L142 QuantifierPusher]: treesize reduction 11, result has 82.3 percent of original size [2021-04-29 00:43:59,604 INFO L147 QuantifierPusher]: treesize reduction 34, result has 33.3 percent of original size 17 [2021-04-29 00:43:59,679 INFO L142 QuantifierPusher]: treesize reduction 11, result has 82.3 percent of original size [2021-04-29 00:43:59,681 INFO L147 QuantifierPusher]: treesize reduction 34, result has 33.3 percent of original size 17 [2021-04-29 00:43:59,685 INFO L142 QuantifierPusher]: treesize reduction 11, result has 83.1 percent of original size [2021-04-29 00:43:59,687 INFO L147 QuantifierPusher]: treesize reduction 34, result has 37.0 percent of original size 20 [2021-04-29 00:43:59,775 INFO L142 QuantifierPusher]: treesize reduction 69, result has 39.5 percent of original size [2021-04-29 00:43:59,777 INFO L147 QuantifierPusher]: treesize reduction 5, result has 88.9 percent of original size 40 [2021-04-29 00:43:59,864 INFO L142 QuantifierPusher]: treesize reduction 66, result has 35.9 percent of original size [2021-04-29 00:43:59,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-04-29 00:43:59,923 INFO L142 QuantifierPusher]: treesize reduction 29, result has 63.3 percent of original size [2021-04-29 00:43:59,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-04-29 00:44:00,017 INFO L142 QuantifierPusher]: treesize reduction 3, result has 86.4 percent of original size [2021-04-29 00:44:00,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:44:00,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:00,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869524642] [2021-04-29 00:44:00,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:00,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:00,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931772362] [2021-04-29 00:44:00,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:00,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:00,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:00,081 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 325 [2021-04-29 00:44:00,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 79 transitions, 701 flow. Second operand has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:00,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:00,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 325 [2021-04-29 00:44:00,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:00,797 INFO L129 PetriNetUnfolder]: 228/673 cut-off events. [2021-04-29 00:44:00,797 INFO L130 PetriNetUnfolder]: For 1576/1642 co-relation queries the response was YES. [2021-04-29 00:44:00,802 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2553 conditions, 673 events. 228/673 cut-off events. For 1576/1642 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5141 event pairs, 16 based on Foata normal form. 29/537 useless extension candidates. Maximal degree in co-relation 2528. Up to 233 conditions per place. [2021-04-29 00:44:00,808 INFO L132 encePairwiseOnDemand]: 318/325 looper letters, 42 selfloop transitions, 28 changer transitions 0/91 dead transitions. [2021-04-29 00:44:00,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 91 transitions, 943 flow [2021-04-29 00:44:00,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:44:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:44:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 858 transitions. [2021-04-29 00:44:00,816 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.528 [2021-04-29 00:44:00,816 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 858 transitions. [2021-04-29 00:44:00,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 858 transitions. [2021-04-29 00:44:00,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:00,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 858 transitions. [2021-04-29 00:44:00,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.6) internal successors, (858), 5 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:00,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:00,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:00,826 INFO L185 Difference]: Start difference. First operand has 68 places, 79 transitions, 701 flow. Second operand 5 states and 858 transitions. [2021-04-29 00:44:00,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 91 transitions, 943 flow [2021-04-29 00:44:00,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 91 transitions, 922 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-04-29 00:44:00,840 INFO L241 Difference]: Finished difference. Result has 73 places, 84 transitions, 830 flow [2021-04-29 00:44:00,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=830, PETRI_PLACES=73, PETRI_TRANSITIONS=84} [2021-04-29 00:44:00,841 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -53 predicate places. [2021-04-29 00:44:00,841 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:00,841 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 84 transitions, 830 flow [2021-04-29 00:44:00,842 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 84 transitions, 830 flow [2021-04-29 00:44:00,843 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 84 transitions, 830 flow [2021-04-29 00:44:00,916 INFO L129 PetriNetUnfolder]: 80/313 cut-off events. [2021-04-29 00:44:00,917 INFO L130 PetriNetUnfolder]: For 1135/1161 co-relation queries the response was YES. [2021-04-29 00:44:00,919 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 313 events. 80/313 cut-off events. For 1135/1161 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2107 event pairs, 2 based on Foata normal form. 22/254 useless extension candidates. Maximal degree in co-relation 1189. Up to 111 conditions per place. [2021-04-29 00:44:00,926 INFO L146 LiptonReduction]: Number of co-enabled transitions 1146 [2021-04-29 00:44:02,286 INFO L158 LiptonReduction]: Checked pairs total: 225 [2021-04-29 00:44:02,287 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:02,287 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1446 [2021-04-29 00:44:02,288 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 84 transitions, 830 flow [2021-04-29 00:44:02,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 167.0) internal successors, (1336), 8 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:02,289 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:02,289 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:02,290 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 00:44:02,290 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:02,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1098974153, now seen corresponding path program 1 times [2021-04-29 00:44:02,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:02,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590936888] [2021-04-29 00:44:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:02,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:02,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:44:02,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:02,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:02,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590936888] [2021-04-29 00:44:02,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:02,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:44:02,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38300305] [2021-04-29 00:44:02,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:44:02,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:02,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:44:02,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:44:02,400 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 325 [2021-04-29 00:44:02,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 84 transitions, 830 flow. Second operand has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:02,403 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:02,403 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 325 [2021-04-29 00:44:02,403 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:02,540 INFO L129 PetriNetUnfolder]: 93/403 cut-off events. [2021-04-29 00:44:02,540 INFO L130 PetriNetUnfolder]: For 1587/1654 co-relation queries the response was YES. [2021-04-29 00:44:02,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1551 conditions, 403 events. 93/403 cut-off events. For 1587/1654 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2953 event pairs, 7 based on Foata normal form. 34/321 useless extension candidates. Maximal degree in co-relation 1523. Up to 145 conditions per place. [2021-04-29 00:44:02,546 INFO L132 encePairwiseOnDemand]: 322/325 looper letters, 3 selfloop transitions, 3 changer transitions 20/84 dead transitions. [2021-04-29 00:44:02,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 84 transitions, 842 flow [2021-04-29 00:44:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:44:02,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:44:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2021-04-29 00:44:02,552 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8092307692307692 [2021-04-29 00:44:02,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 789 transitions. [2021-04-29 00:44:02,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 789 transitions. [2021-04-29 00:44:02,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:02,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 789 transitions. [2021-04-29 00:44:02,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:02,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:02,565 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:02,565 INFO L185 Difference]: Start difference. First operand has 73 places, 84 transitions, 830 flow. Second operand 3 states and 789 transitions. [2021-04-29 00:44:02,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 84 transitions, 842 flow [2021-04-29 00:44:02,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 84 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:44:02,580 INFO L241 Difference]: Finished difference. Result has 74 places, 64 transitions, 586 flow [2021-04-29 00:44:02,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2021-04-29 00:44:02,580 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -52 predicate places. [2021-04-29 00:44:02,580 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:02,581 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 64 transitions, 586 flow [2021-04-29 00:44:02,581 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 64 transitions, 586 flow [2021-04-29 00:44:02,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 64 transitions, 586 flow [2021-04-29 00:44:02,661 INFO L129 PetriNetUnfolder]: 68/317 cut-off events. [2021-04-29 00:44:02,662 INFO L130 PetriNetUnfolder]: For 997/1047 co-relation queries the response was YES. [2021-04-29 00:44:02,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 317 events. 68/317 cut-off events. For 997/1047 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2285 event pairs, 1 based on Foata normal form. 26/243 useless extension candidates. Maximal degree in co-relation 1111. Up to 118 conditions per place. [2021-04-29 00:44:02,669 INFO L146 LiptonReduction]: Number of co-enabled transitions 772 [2021-04-29 00:44:03,108 INFO L158 LiptonReduction]: Checked pairs total: 165 [2021-04-29 00:44:03,108 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:03,108 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 528 [2021-04-29 00:44:03,109 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 586 flow [2021-04-29 00:44:03,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:03,110 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:03,110 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:03,110 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-29 00:44:03,110 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:03,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:03,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1459524687, now seen corresponding path program 1 times [2021-04-29 00:44:03,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:03,110 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162732750] [2021-04-29 00:44:03,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:03,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:03,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:03,229 INFO L142 QuantifierPusher]: treesize reduction 15, result has 50.0 percent of original size [2021-04-29 00:44:03,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:03,260 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-04-29 00:44:03,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:03,306 INFO L142 QuantifierPusher]: treesize reduction 19, result has 60.4 percent of original size [2021-04-29 00:44:03,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-04-29 00:44:03,390 INFO L142 QuantifierPusher]: treesize reduction 11, result has 52.2 percent of original size [2021-04-29 00:44:03,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-29 00:44:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:03,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162732750] [2021-04-29 00:44:03,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:03,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:03,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426288144] [2021-04-29 00:44:03,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:44:03,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:44:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:44:03,424 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 325 [2021-04-29 00:44:03,425 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 586 flow. Second operand has 7 states, 7 states have (on average 162.28571428571428) internal successors, (1136), 7 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:03,426 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:03,426 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 325 [2021-04-29 00:44:03,426 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:03,615 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 28 [2021-04-29 00:44:04,259 INFO L129 PetriNetUnfolder]: 255/878 cut-off events. [2021-04-29 00:44:04,260 INFO L130 PetriNetUnfolder]: For 2879/3074 co-relation queries the response was YES. [2021-04-29 00:44:04,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 878 events. 255/878 cut-off events. For 2879/3074 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7623 event pairs, 2 based on Foata normal form. 116/731 useless extension candidates. Maximal degree in co-relation 3282. Up to 294 conditions per place. [2021-04-29 00:44:04,271 INFO L132 encePairwiseOnDemand]: 316/325 looper letters, 53 selfloop transitions, 31 changer transitions 4/108 dead transitions. [2021-04-29 00:44:04,271 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 1209 flow [2021-04-29 00:44:04,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-29 00:44:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-04-29 00:44:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1327 transitions. [2021-04-29 00:44:04,281 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5103846153846154 [2021-04-29 00:44:04,281 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1327 transitions. [2021-04-29 00:44:04,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1327 transitions. [2021-04-29 00:44:04,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:04,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1327 transitions. [2021-04-29 00:44:04,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 165.875) internal successors, (1327), 8 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:04,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 325.0) internal successors, (2925), 9 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:04,296 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 325.0) internal successors, (2925), 9 states have internal predecessors, (2925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:04,296 INFO L185 Difference]: Start difference. First operand has 70 places, 64 transitions, 586 flow. Second operand 8 states and 1327 transitions. [2021-04-29 00:44:04,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 1209 flow [2021-04-29 00:44:04,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 108 transitions, 1129 flow, removed 14 selfloop flow, removed 9 redundant places. [2021-04-29 00:44:04,314 INFO L241 Difference]: Finished difference. Result has 72 places, 87 transitions, 912 flow [2021-04-29 00:44:04,315 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=912, PETRI_PLACES=72, PETRI_TRANSITIONS=87} [2021-04-29 00:44:04,316 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -54 predicate places. [2021-04-29 00:44:04,316 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:04,316 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 87 transitions, 912 flow [2021-04-29 00:44:04,316 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 87 transitions, 912 flow [2021-04-29 00:44:04,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 87 transitions, 912 flow [2021-04-29 00:44:04,502 INFO L129 PetriNetUnfolder]: 193/734 cut-off events. [2021-04-29 00:44:04,503 INFO L130 PetriNetUnfolder]: For 3088/3336 co-relation queries the response was YES. [2021-04-29 00:44:04,508 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2930 conditions, 734 events. 193/734 cut-off events. For 3088/3336 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 6407 event pairs, 18 based on Foata normal form. 92/609 useless extension candidates. Maximal degree in co-relation 2904. Up to 254 conditions per place. [2021-04-29 00:44:04,521 INFO L146 LiptonReduction]: Number of co-enabled transitions 926 [2021-04-29 00:44:04,535 INFO L158 LiptonReduction]: Checked pairs total: 268 [2021-04-29 00:44:04,535 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:04,535 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 219 [2021-04-29 00:44:04,536 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 87 transitions, 912 flow [2021-04-29 00:44:04,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.28571428571428) internal successors, (1136), 7 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:04,537 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:04,537 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:04,537 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-29 00:44:04,538 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:04,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1270471307, now seen corresponding path program 2 times [2021-04-29 00:44:04,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:04,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861963733] [2021-04-29 00:44:04,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:04,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:04,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:04,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:04,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:04,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:44:04,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:04,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:04,826 INFO L142 QuantifierPusher]: treesize reduction 7, result has 79.4 percent of original size [2021-04-29 00:44:04,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-29 00:44:04,907 INFO L142 QuantifierPusher]: treesize reduction 3, result has 80.0 percent of original size [2021-04-29 00:44:04,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-29 00:44:04,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:04,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861963733] [2021-04-29 00:44:04,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:04,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:04,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591321471] [2021-04-29 00:44:04,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:44:04,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:04,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:44:04,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:44:04,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 325 [2021-04-29 00:44:04,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 87 transitions, 912 flow. Second operand has 7 states, 7 states have (on average 158.28571428571428) internal successors, (1108), 7 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:04,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:04,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 325 [2021-04-29 00:44:04,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:05,880 INFO L129 PetriNetUnfolder]: 243/837 cut-off events. [2021-04-29 00:44:05,880 INFO L130 PetriNetUnfolder]: For 3744/4046 co-relation queries the response was YES. [2021-04-29 00:44:05,885 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3730 conditions, 837 events. 243/837 cut-off events. For 3744/4046 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 7158 event pairs, 3 based on Foata normal form. 171/761 useless extension candidates. Maximal degree in co-relation 3702. Up to 264 conditions per place. [2021-04-29 00:44:05,891 INFO L132 encePairwiseOnDemand]: 317/325 looper letters, 51 selfloop transitions, 37 changer transitions 3/111 dead transitions. [2021-04-29 00:44:05,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 111 transitions, 1369 flow [2021-04-29 00:44:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:44:05,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:44:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1452 transitions. [2021-04-29 00:44:05,899 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.49641025641025643 [2021-04-29 00:44:05,899 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1452 transitions. [2021-04-29 00:44:05,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1452 transitions. [2021-04-29 00:44:05,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:05,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1452 transitions. [2021-04-29 00:44:05,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 161.33333333333334) internal successors, (1452), 9 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:05,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:05,913 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:05,913 INFO L185 Difference]: Start difference. First operand has 72 places, 87 transitions, 912 flow. Second operand 9 states and 1452 transitions. [2021-04-29 00:44:05,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 111 transitions, 1369 flow [2021-04-29 00:44:05,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 1357 flow, removed 6 selfloop flow, removed 0 redundant places. [2021-04-29 00:44:05,927 INFO L241 Difference]: Finished difference. Result has 84 places, 97 transitions, 1183 flow [2021-04-29 00:44:05,928 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1183, PETRI_PLACES=84, PETRI_TRANSITIONS=97} [2021-04-29 00:44:05,928 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -42 predicate places. [2021-04-29 00:44:05,928 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:05,928 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 97 transitions, 1183 flow [2021-04-29 00:44:05,929 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 97 transitions, 1183 flow [2021-04-29 00:44:05,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 97 transitions, 1183 flow [2021-04-29 00:44:06,097 INFO L129 PetriNetUnfolder]: 199/738 cut-off events. [2021-04-29 00:44:06,098 INFO L130 PetriNetUnfolder]: For 4072/4158 co-relation queries the response was YES. [2021-04-29 00:44:06,103 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3303 conditions, 738 events. 199/738 cut-off events. For 4072/4158 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 6408 event pairs, 26 based on Foata normal form. 48/553 useless extension candidates. Maximal degree in co-relation 3271. Up to 248 conditions per place. [2021-04-29 00:44:06,116 INFO L146 LiptonReduction]: Number of co-enabled transitions 994 [2021-04-29 00:44:08,666 WARN L205 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 269 DAG size of output: 160 [2021-04-29 00:44:09,342 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2021-04-29 00:44:15,705 WARN L205 SmtUtils]: Spent 6.36 s on a formula simplification. DAG size of input: 377 DAG size of output: 240 [2021-04-29 00:44:17,246 WARN L205 SmtUtils]: Spent 1.54 s on a formula simplification that was a NOOP. DAG size: 220 [2021-04-29 00:44:17,264 INFO L158 LiptonReduction]: Checked pairs total: 570 [2021-04-29 00:44:17,264 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:44:17,264 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11336 [2021-04-29 00:44:17,266 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 98 transitions, 1193 flow [2021-04-29 00:44:17,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 158.28571428571428) internal successors, (1108), 7 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:17,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:17,268 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:17,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-29 00:44:17,268 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:17,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:17,268 INFO L82 PathProgramCache]: Analyzing trace with hash 165150713, now seen corresponding path program 3 times [2021-04-29 00:44:17,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:17,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832608574] [2021-04-29 00:44:17,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:17,419 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-04-29 00:44:17,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:17,445 INFO L142 QuantifierPusher]: treesize reduction 30, result has 38.8 percent of original size [2021-04-29 00:44:17,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:44:17,487 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-04-29 00:44:17,490 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-04-29 00:44:17,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:17,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:17,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:17,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:17,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:17,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:17,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:17,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:44:17,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:17,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832608574] [2021-04-29 00:44:17,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:17,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-29 00:44:17,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422880499] [2021-04-29 00:44:17,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-29 00:44:17,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:17,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-29 00:44:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-04-29 00:44:17,705 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 326 [2021-04-29 00:44:17,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 98 transitions, 1193 flow. Second operand has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:17,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:17,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 326 [2021-04-29 00:44:17,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:18,770 INFO L129 PetriNetUnfolder]: 269/939 cut-off events. [2021-04-29 00:44:18,771 INFO L130 PetriNetUnfolder]: For 5491/5728 co-relation queries the response was YES. [2021-04-29 00:44:18,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 939 events. 269/939 cut-off events. For 5491/5728 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 8432 event pairs, 0 based on Foata normal form. 201/855 useless extension candidates. Maximal degree in co-relation 4434. Up to 293 conditions per place. [2021-04-29 00:44:18,782 INFO L132 encePairwiseOnDemand]: 315/326 looper letters, 61 selfloop transitions, 47 changer transitions 10/138 dead transitions. [2021-04-29 00:44:18,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 138 transitions, 1919 flow [2021-04-29 00:44:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-29 00:44:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-04-29 00:44:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1575 transitions. [2021-04-29 00:44:18,793 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4831288343558282 [2021-04-29 00:44:18,793 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1575 transitions. [2021-04-29 00:44:18,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1575 transitions. [2021-04-29 00:44:18,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:18,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1575 transitions. [2021-04-29 00:44:18,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 157.5) internal successors, (1575), 10 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:18,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:18,807 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:18,807 INFO L185 Difference]: Start difference. First operand has 85 places, 98 transitions, 1193 flow. Second operand 10 states and 1575 transitions. [2021-04-29 00:44:18,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 138 transitions, 1919 flow [2021-04-29 00:44:18,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 138 transitions, 1869 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-04-29 00:44:18,829 INFO L241 Difference]: Finished difference. Result has 95 places, 111 transitions, 1494 flow [2021-04-29 00:44:18,829 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=95, PETRI_TRANSITIONS=111} [2021-04-29 00:44:18,829 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -31 predicate places. [2021-04-29 00:44:18,829 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:18,829 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 111 transitions, 1494 flow [2021-04-29 00:44:18,830 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 111 transitions, 1494 flow [2021-04-29 00:44:18,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 111 transitions, 1494 flow [2021-04-29 00:44:18,979 INFO L129 PetriNetUnfolder]: 217/787 cut-off events. [2021-04-29 00:44:18,980 INFO L130 PetriNetUnfolder]: For 5497/5563 co-relation queries the response was YES. [2021-04-29 00:44:18,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3906 conditions, 787 events. 217/787 cut-off events. For 5497/5563 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 6942 event pairs, 22 based on Foata normal form. 52/597 useless extension candidates. Maximal degree in co-relation 3870. Up to 254 conditions per place. [2021-04-29 00:44:18,996 INFO L146 LiptonReduction]: Number of co-enabled transitions 1110 [2021-04-29 00:44:19,006 INFO L158 LiptonReduction]: Checked pairs total: 511 [2021-04-29 00:44:19,006 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:19,006 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 177 [2021-04-29 00:44:19,007 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 111 transitions, 1494 flow [2021-04-29 00:44:19,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:19,008 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:19,008 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:19,009 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-29 00:44:19,009 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -347792259, now seen corresponding path program 1 times [2021-04-29 00:44:19,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:19,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304029278] [2021-04-29 00:44:19,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:19,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:19,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:19,099 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:44:19,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:19,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:19,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:44:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:19,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304029278] [2021-04-29 00:44:19,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:19,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:44:19,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919177932] [2021-04-29 00:44:19,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:44:19,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:19,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:44:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:44:19,132 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 326 [2021-04-29 00:44:19,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 111 transitions, 1494 flow. Second operand has 4 states, 4 states have (on average 238.75) internal successors, (955), 4 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:19,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:19,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 326 [2021-04-29 00:44:19,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:20,550 INFO L129 PetriNetUnfolder]: 3578/6382 cut-off events. [2021-04-29 00:44:20,550 INFO L130 PetriNetUnfolder]: For 53536/55054 co-relation queries the response was YES. [2021-04-29 00:44:20,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22341 conditions, 6382 events. 3578/6382 cut-off events. For 53536/55054 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 54909 event pairs, 1389 based on Foata normal form. 922/4140 useless extension candidates. Maximal degree in co-relation 22303. Up to 4510 conditions per place. [2021-04-29 00:44:20,613 INFO L132 encePairwiseOnDemand]: 314/326 looper letters, 24 selfloop transitions, 20 changer transitions 0/121 dead transitions. [2021-04-29 00:44:20,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 121 transitions, 1379 flow [2021-04-29 00:44:20,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:44:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:44:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1232 transitions. [2021-04-29 00:44:20,620 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7558282208588957 [2021-04-29 00:44:20,620 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1232 transitions. [2021-04-29 00:44:20,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1232 transitions. [2021-04-29 00:44:20,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:20,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1232 transitions. [2021-04-29 00:44:20,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 246.4) internal successors, (1232), 5 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,628 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:20,629 INFO L185 Difference]: Start difference. First operand has 94 places, 111 transitions, 1494 flow. Second operand 5 states and 1232 transitions. [2021-04-29 00:44:20,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 121 transitions, 1379 flow [2021-04-29 00:44:20,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 1214 flow, removed 27 selfloop flow, removed 13 redundant places. [2021-04-29 00:44:20,706 INFO L241 Difference]: Finished difference. Result has 88 places, 112 transitions, 1236 flow [2021-04-29 00:44:20,707 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1236, PETRI_PLACES=88, PETRI_TRANSITIONS=112} [2021-04-29 00:44:20,707 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -38 predicate places. [2021-04-29 00:44:20,707 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:20,707 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 112 transitions, 1236 flow [2021-04-29 00:44:20,708 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 112 transitions, 1236 flow [2021-04-29 00:44:20,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 112 transitions, 1236 flow [2021-04-29 00:44:21,459 INFO L129 PetriNetUnfolder]: 3413/6032 cut-off events. [2021-04-29 00:44:21,460 INFO L130 PetriNetUnfolder]: For 30981/32469 co-relation queries the response was YES. [2021-04-29 00:44:21,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25157 conditions, 6032 events. 3413/6032 cut-off events. For 30981/32469 co-relation queries the response was YES. Maximal size of possible extension queue 1117. Compared 51240 event pairs, 1356 based on Foata normal form. 156/3125 useless extension candidates. Maximal degree in co-relation 25122. Up to 4609 conditions per place. [2021-04-29 00:44:21,556 INFO L146 LiptonReduction]: Number of co-enabled transitions 1444 [2021-04-29 00:44:21,631 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:21,632 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:21,632 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 925 [2021-04-29 00:44:21,633 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 112 transitions, 1236 flow [2021-04-29 00:44:21,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 238.75) internal successors, (955), 4 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,634 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:21,634 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:21,634 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-29 00:44:21,634 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash -269037183, now seen corresponding path program 1 times [2021-04-29 00:44:21,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:21,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673103168] [2021-04-29 00:44:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:21,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:21,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:21,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:21,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:21,742 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:44:21,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:21,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:21,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:44:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:21,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673103168] [2021-04-29 00:44:21,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:21,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:44:21,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877204350] [2021-04-29 00:44:21,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:44:21,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:44:21,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:44:21,776 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 326 [2021-04-29 00:44:21,777 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 112 transitions, 1236 flow. Second operand has 5 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:21,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:21,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 326 [2021-04-29 00:44:21,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:22,712 INFO L129 PetriNetUnfolder]: 2438/5251 cut-off events. [2021-04-29 00:44:22,712 INFO L130 PetriNetUnfolder]: For 41127/45727 co-relation queries the response was YES. [2021-04-29 00:44:22,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24607 conditions, 5251 events. 2438/5251 cut-off events. For 41127/45727 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 52238 event pairs, 252 based on Foata normal form. 1126/3626 useless extension candidates. Maximal degree in co-relation 24570. Up to 4232 conditions per place. [2021-04-29 00:44:22,754 INFO L132 encePairwiseOnDemand]: 314/326 looper letters, 11 selfloop transitions, 39 changer transitions 9/129 dead transitions. [2021-04-29 00:44:22,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 129 transitions, 1365 flow [2021-04-29 00:44:22,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:44:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:44:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1727 transitions. [2021-04-29 00:44:22,762 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7567922874671341 [2021-04-29 00:44:22,762 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1727 transitions. [2021-04-29 00:44:22,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1727 transitions. [2021-04-29 00:44:22,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:22,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1727 transitions. [2021-04-29 00:44:22,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 246.71428571428572) internal successors, (1727), 7 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,772 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:22,772 INFO L185 Difference]: Start difference. First operand has 88 places, 112 transitions, 1236 flow. Second operand 7 states and 1727 transitions. [2021-04-29 00:44:22,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 129 transitions, 1365 flow [2021-04-29 00:44:22,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 129 transitions, 1345 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-04-29 00:44:22,823 INFO L241 Difference]: Finished difference. Result has 96 places, 120 transitions, 1322 flow [2021-04-29 00:44:22,823 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1322, PETRI_PLACES=96, PETRI_TRANSITIONS=120} [2021-04-29 00:44:22,823 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -30 predicate places. [2021-04-29 00:44:22,823 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:22,824 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 120 transitions, 1322 flow [2021-04-29 00:44:22,824 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 120 transitions, 1322 flow [2021-04-29 00:44:22,825 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 120 transitions, 1322 flow [2021-04-29 00:44:23,341 INFO L129 PetriNetUnfolder]: 1916/4347 cut-off events. [2021-04-29 00:44:23,341 INFO L130 PetriNetUnfolder]: For 30085/32812 co-relation queries the response was YES. [2021-04-29 00:44:23,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23224 conditions, 4347 events. 1916/4347 cut-off events. For 30085/32812 co-relation queries the response was YES. Maximal size of possible extension queue 910. Compared 44170 event pairs, 288 based on Foata normal form. 86/2266 useless extension candidates. Maximal degree in co-relation 23185. Up to 3296 conditions per place. [2021-04-29 00:44:23,407 INFO L146 LiptonReduction]: Number of co-enabled transitions 1648 [2021-04-29 00:44:23,419 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:23,419 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:23,419 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 596 [2021-04-29 00:44:23,421 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 120 transitions, 1322 flow [2021-04-29 00:44:23,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:23,421 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:23,422 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:23,422 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-29 00:44:23,422 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:23,422 INFO L82 PathProgramCache]: Analyzing trace with hash -680466317, now seen corresponding path program 1 times [2021-04-29 00:44:23,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:23,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674284056] [2021-04-29 00:44:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:23,532 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-04-29 00:44:23,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-04-29 00:44:23,598 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-04-29 00:44:23,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-04-29 00:44:23,681 INFO L142 QuantifierPusher]: treesize reduction 10, result has 44.4 percent of original size [2021-04-29 00:44:23,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-04-29 00:44:23,702 INFO L142 QuantifierPusher]: treesize reduction 10, result has 65.5 percent of original size [2021-04-29 00:44:23,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:44:23,749 INFO L142 QuantifierPusher]: treesize reduction 4, result has 50.0 percent of original size [2021-04-29 00:44:23,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-29 00:44:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:23,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674284056] [2021-04-29 00:44:23,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:23,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:23,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170092416] [2021-04-29 00:44:23,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:44:23,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:23,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:44:23,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:44:23,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 326 [2021-04-29 00:44:23,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 120 transitions, 1322 flow. Second operand has 7 states, 7 states have (on average 154.28571428571428) internal successors, (1080), 7 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:23,775 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:23,775 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 326 [2021-04-29 00:44:23,775 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:25,238 INFO L129 PetriNetUnfolder]: 3004/6520 cut-off events. [2021-04-29 00:44:25,238 INFO L130 PetriNetUnfolder]: For 57437/61073 co-relation queries the response was YES. [2021-04-29 00:44:25,280 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36122 conditions, 6520 events. 3004/6520 cut-off events. For 57437/61073 co-relation queries the response was YES. Maximal size of possible extension queue 1363. Compared 66825 event pairs, 450 based on Foata normal form. 215/3468 useless extension candidates. Maximal degree in co-relation 36081. Up to 4952 conditions per place. [2021-04-29 00:44:25,300 INFO L132 encePairwiseOnDemand]: 317/326 looper letters, 44 selfloop transitions, 14 changer transitions 16/132 dead transitions. [2021-04-29 00:44:25,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 132 transitions, 1657 flow [2021-04-29 00:44:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:44:25,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:44:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1100 transitions. [2021-04-29 00:44:25,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4820333041191937 [2021-04-29 00:44:25,310 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1100 transitions. [2021-04-29 00:44:25,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1100 transitions. [2021-04-29 00:44:25,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:25,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1100 transitions. [2021-04-29 00:44:25,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.14285714285714) internal successors, (1100), 7 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:25,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:25,320 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:25,320 INFO L185 Difference]: Start difference. First operand has 96 places, 120 transitions, 1322 flow. Second operand 7 states and 1100 transitions. [2021-04-29 00:44:25,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 132 transitions, 1657 flow [2021-04-29 00:44:26,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 132 transitions, 1562 flow, removed 37 selfloop flow, removed 2 redundant places. [2021-04-29 00:44:26,223 INFO L241 Difference]: Finished difference. Result has 103 places, 116 transitions, 1235 flow [2021-04-29 00:44:26,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1235, PETRI_PLACES=103, PETRI_TRANSITIONS=116} [2021-04-29 00:44:26,224 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -23 predicate places. [2021-04-29 00:44:26,224 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:26,224 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 116 transitions, 1235 flow [2021-04-29 00:44:26,224 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 116 transitions, 1235 flow [2021-04-29 00:44:26,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 116 transitions, 1235 flow [2021-04-29 00:44:26,720 INFO L129 PetriNetUnfolder]: 1858/4147 cut-off events. [2021-04-29 00:44:26,721 INFO L130 PetriNetUnfolder]: For 28683/29156 co-relation queries the response was YES. [2021-04-29 00:44:26,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19082 conditions, 4147 events. 1858/4147 cut-off events. For 28683/29156 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 41020 event pairs, 288 based on Foata normal form. 86/2170 useless extension candidates. Maximal degree in co-relation 19039. Up to 1582 conditions per place. [2021-04-29 00:44:26,795 INFO L146 LiptonReduction]: Number of co-enabled transitions 1538 [2021-04-29 00:44:26,816 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:26,816 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:26,817 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 593 [2021-04-29 00:44:26,818 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 116 transitions, 1235 flow [2021-04-29 00:44:26,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 154.28571428571428) internal successors, (1080), 7 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:26,818 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:26,818 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:26,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-29 00:44:26,819 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:26,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:26,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1205777203, now seen corresponding path program 2 times [2021-04-29 00:44:26,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:26,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80297229] [2021-04-29 00:44:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:26,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:26,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:44:26,938 INFO L142 QuantifierPusher]: treesize reduction 31, result has 48.3 percent of original size [2021-04-29 00:44:26,941 INFO L147 QuantifierPusher]: treesize reduction 5, result has 82.8 percent of original size 24 [2021-04-29 00:44:27,035 INFO L142 QuantifierPusher]: treesize reduction 3, result has 83.3 percent of original size [2021-04-29 00:44:27,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:27,078 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-04-29 00:44:27,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:27,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80297229] [2021-04-29 00:44:27,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:27,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:44:27,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152427899] [2021-04-29 00:44:27,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:44:27,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:27,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:44:27,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:44:27,123 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 326 [2021-04-29 00:44:27,126 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 116 transitions, 1235 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:27,126 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:27,126 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 326 [2021-04-29 00:44:27,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:28,548 INFO L129 PetriNetUnfolder]: 2956/6412 cut-off events. [2021-04-29 00:44:28,549 INFO L130 PetriNetUnfolder]: For 58614/59414 co-relation queries the response was YES. [2021-04-29 00:44:28,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31132 conditions, 6412 events. 2956/6412 cut-off events. For 58614/59414 co-relation queries the response was YES. Maximal size of possible extension queue 1293. Compared 66120 event pairs, 432 based on Foata normal form. 206/3467 useless extension candidates. Maximal degree in co-relation 31087. Up to 2404 conditions per place. [2021-04-29 00:44:28,603 INFO L132 encePairwiseOnDemand]: 315/326 looper letters, 33 selfloop transitions, 36 changer transitions 5/132 dead transitions. [2021-04-29 00:44:28,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 132 transitions, 1601 flow [2021-04-29 00:44:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-29 00:44:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-04-29 00:44:28,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1327 transitions. [2021-04-29 00:44:28,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.508819018404908 [2021-04-29 00:44:28,613 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1327 transitions. [2021-04-29 00:44:28,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1327 transitions. [2021-04-29 00:44:28,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:28,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1327 transitions. [2021-04-29 00:44:28,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 165.875) internal successors, (1327), 8 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 326.0) internal successors, (2934), 9 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,626 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 326.0) internal successors, (2934), 9 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:28,626 INFO L185 Difference]: Start difference. First operand has 101 places, 116 transitions, 1235 flow. Second operand 8 states and 1327 transitions. [2021-04-29 00:44:28,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 132 transitions, 1601 flow [2021-04-29 00:44:29,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 132 transitions, 1557 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-04-29 00:44:29,227 INFO L241 Difference]: Finished difference. Result has 103 places, 122 transitions, 1397 flow [2021-04-29 00:44:29,227 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1397, PETRI_PLACES=103, PETRI_TRANSITIONS=122} [2021-04-29 00:44:29,227 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -23 predicate places. [2021-04-29 00:44:29,227 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:29,228 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 122 transitions, 1397 flow [2021-04-29 00:44:29,228 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 122 transitions, 1397 flow [2021-04-29 00:44:29,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 122 transitions, 1397 flow [2021-04-29 00:44:29,968 INFO L129 PetriNetUnfolder]: 2124/4817 cut-off events. [2021-04-29 00:44:29,968 INFO L130 PetriNetUnfolder]: For 36363/36871 co-relation queries the response was YES. [2021-04-29 00:44:29,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23038 conditions, 4817 events. 2124/4817 cut-off events. For 36363/36871 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 49707 event pairs, 252 based on Foata normal form. 50/2552 useless extension candidates. Maximal degree in co-relation 22996. Up to 1747 conditions per place. [2021-04-29 00:44:30,029 INFO L146 LiptonReduction]: Number of co-enabled transitions 1654 [2021-04-29 00:44:30,036 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:30,037 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:30,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 810 [2021-04-29 00:44:30,038 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 122 transitions, 1397 flow [2021-04-29 00:44:30,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:30,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:30,038 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:30,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-29 00:44:30,039 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1059308720, now seen corresponding path program 1 times [2021-04-29 00:44:30,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:30,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838298127] [2021-04-29 00:44:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:30,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:30,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:30,154 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-04-29 00:44:30,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:30,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:30,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:44:30,217 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-04-29 00:44:30,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:30,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838298127] [2021-04-29 00:44:30,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:30,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:44:30,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694877597] [2021-04-29 00:44:30,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:44:30,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:30,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:44:30,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:44:30,250 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 326 [2021-04-29 00:44:30,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 122 transitions, 1397 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:30,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:30,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 326 [2021-04-29 00:44:30,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:31,741 INFO L129 PetriNetUnfolder]: 2988/6588 cut-off events. [2021-04-29 00:44:31,741 INFO L130 PetriNetUnfolder]: For 61930/63211 co-relation queries the response was YES. [2021-04-29 00:44:31,781 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32178 conditions, 6588 events. 2988/6588 cut-off events. For 61930/63211 co-relation queries the response was YES. Maximal size of possible extension queue 1432. Compared 68998 event pairs, 324 based on Foata normal form. 231/3612 useless extension candidates. Maximal degree in co-relation 32134. Up to 2458 conditions per place. [2021-04-29 00:44:31,796 INFO L132 encePairwiseOnDemand]: 315/326 looper letters, 49 selfloop transitions, 28 changer transitions 3/138 dead transitions. [2021-04-29 00:44:31,796 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 138 transitions, 1799 flow [2021-04-29 00:44:31,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:44:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:44:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1163 transitions. [2021-04-29 00:44:31,805 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5096406660823839 [2021-04-29 00:44:31,805 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1163 transitions. [2021-04-29 00:44:31,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1163 transitions. [2021-04-29 00:44:31,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:31,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1163 transitions. [2021-04-29 00:44:31,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 166.14285714285714) internal successors, (1163), 7 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:31,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:31,816 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:31,816 INFO L185 Difference]: Start difference. First operand has 103 places, 122 transitions, 1397 flow. Second operand 7 states and 1163 transitions. [2021-04-29 00:44:31,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 138 transitions, 1799 flow [2021-04-29 00:44:32,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 138 transitions, 1723 flow, removed 23 selfloop flow, removed 5 redundant places. [2021-04-29 00:44:32,389 INFO L241 Difference]: Finished difference. Result has 106 places, 129 transitions, 1554 flow [2021-04-29 00:44:32,389 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1554, PETRI_PLACES=106, PETRI_TRANSITIONS=129} [2021-04-29 00:44:32,390 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -20 predicate places. [2021-04-29 00:44:32,390 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:32,390 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 129 transitions, 1554 flow [2021-04-29 00:44:32,391 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 129 transitions, 1554 flow [2021-04-29 00:44:32,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 129 transitions, 1554 flow [2021-04-29 00:44:33,162 INFO L129 PetriNetUnfolder]: 2808/6219 cut-off events. [2021-04-29 00:44:33,162 INFO L130 PetriNetUnfolder]: For 47132/47970 co-relation queries the response was YES. [2021-04-29 00:44:33,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29607 conditions, 6219 events. 2808/6219 cut-off events. For 47132/47970 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 64978 event pairs, 342 based on Foata normal form. 93/3325 useless extension candidates. Maximal degree in co-relation 29565. Up to 2422 conditions per place. [2021-04-29 00:44:33,279 INFO L146 LiptonReduction]: Number of co-enabled transitions 1670 [2021-04-29 00:44:33,297 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:33,297 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:33,297 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 907 [2021-04-29 00:44:33,298 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 129 transitions, 1554 flow [2021-04-29 00:44:33,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:33,299 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:33,299 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:33,299 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-29 00:44:33,299 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:33,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash -14113924, now seen corresponding path program 2 times [2021-04-29 00:44:33,300 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:33,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048482869] [2021-04-29 00:44:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:33,479 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-04-29 00:44:33,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:33,501 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-04-29 00:44:33,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:33,528 INFO L142 QuantifierPusher]: treesize reduction 78, result has 14.3 percent of original size [2021-04-29 00:44:33,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:33,535 INFO L142 QuantifierPusher]: treesize reduction 78, result has 17.0 percent of original size [2021-04-29 00:44:33,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:33,570 INFO L142 QuantifierPusher]: treesize reduction 79, result has 33.1 percent of original size [2021-04-29 00:44:33,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-04-29 00:44:33,675 INFO L142 QuantifierPusher]: treesize reduction 163, result has 36.6 percent of original size [2021-04-29 00:44:33,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-04-29 00:44:33,912 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2021-04-29 00:44:33,917 INFO L142 QuantifierPusher]: treesize reduction 17, result has 54.1 percent of original size [2021-04-29 00:44:33,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-04-29 00:44:33,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:33,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-04-29 00:44:33,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:33,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048482869] [2021-04-29 00:44:33,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:33,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:33,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270323025] [2021-04-29 00:44:33,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:33,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:33,983 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 326 [2021-04-29 00:44:33,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 129 transitions, 1554 flow. Second operand has 8 states, 8 states have (on average 169.125) internal successors, (1353), 8 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:33,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:33,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 326 [2021-04-29 00:44:33,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:34,168 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2021-04-29 00:44:34,492 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2021-04-29 00:44:35,197 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2021-04-29 00:44:37,059 INFO L129 PetriNetUnfolder]: 6128/12600 cut-off events. [2021-04-29 00:44:37,060 INFO L130 PetriNetUnfolder]: For 112746/116120 co-relation queries the response was YES. [2021-04-29 00:44:37,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61179 conditions, 12600 events. 6128/12600 cut-off events. For 112746/116120 co-relation queries the response was YES. Maximal size of possible extension queue 2550. Compared 137288 event pairs, 864 based on Foata normal form. 700/6913 useless extension candidates. Maximal degree in co-relation 61135. Up to 5779 conditions per place. [2021-04-29 00:44:37,149 INFO L132 encePairwiseOnDemand]: 315/326 looper letters, 20 selfloop transitions, 40 changer transitions 40/158 dead transitions. [2021-04-29 00:44:37,149 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 158 transitions, 2273 flow [2021-04-29 00:44:37,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-29 00:44:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-04-29 00:44:37,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2063 transitions. [2021-04-29 00:44:37,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5273517382413088 [2021-04-29 00:44:37,158 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2063 transitions. [2021-04-29 00:44:37,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2063 transitions. [2021-04-29 00:44:37,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:37,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2063 transitions. [2021-04-29 00:44:37,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 171.91666666666666) internal successors, (2063), 12 states have internal predecessors, (2063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:37,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 326.0) internal successors, (4238), 13 states have internal predecessors, (4238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:37,172 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 326.0) internal successors, (4238), 13 states have internal predecessors, (4238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:37,172 INFO L185 Difference]: Start difference. First operand has 106 places, 129 transitions, 1554 flow. Second operand 12 states and 2063 transitions. [2021-04-29 00:44:37,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 158 transitions, 2273 flow [2021-04-29 00:44:38,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 158 transitions, 2212 flow, removed 26 selfloop flow, removed 3 redundant places. [2021-04-29 00:44:38,351 INFO L241 Difference]: Finished difference. Result has 116 places, 108 transitions, 1244 flow [2021-04-29 00:44:38,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1509, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1244, PETRI_PLACES=116, PETRI_TRANSITIONS=108} [2021-04-29 00:44:38,351 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -10 predicate places. [2021-04-29 00:44:38,351 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:38,351 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 1244 flow [2021-04-29 00:44:38,352 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 1244 flow [2021-04-29 00:44:38,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 1244 flow [2021-04-29 00:44:39,090 INFO L129 PetriNetUnfolder]: 2842/5957 cut-off events. [2021-04-29 00:44:39,091 INFO L130 PetriNetUnfolder]: For 36787/37398 co-relation queries the response was YES. [2021-04-29 00:44:39,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26995 conditions, 5957 events. 2842/5957 cut-off events. For 36787/37398 co-relation queries the response was YES. Maximal size of possible extension queue 1247. Compared 59292 event pairs, 459 based on Foata normal form. 47/2891 useless extension candidates. Maximal degree in co-relation 26951. Up to 2845 conditions per place. [2021-04-29 00:44:39,202 INFO L146 LiptonReduction]: Number of co-enabled transitions 1086 [2021-04-29 00:44:39,215 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:39,216 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:39,216 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 865 [2021-04-29 00:44:39,217 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 108 transitions, 1244 flow [2021-04-29 00:44:39,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 169.125) internal successors, (1353), 8 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:39,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:39,218 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:39,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-29 00:44:39,218 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:39,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:39,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1753749643, now seen corresponding path program 1 times [2021-04-29 00:44:39,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:39,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117432196] [2021-04-29 00:44:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:39,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:39,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:39,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:44:39,350 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:44:39,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:39,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:39,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:44:39,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:39,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117432196] [2021-04-29 00:44:39,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:39,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:44:39,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658586213] [2021-04-29 00:44:39,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:44:39,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:39,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:44:39,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:44:39,394 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 326 [2021-04-29 00:44:39,396 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 108 transitions, 1244 flow. Second operand has 6 states, 6 states have (on average 238.83333333333334) internal successors, (1433), 6 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:39,397 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:39,397 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 326 [2021-04-29 00:44:39,397 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:40,683 INFO L129 PetriNetUnfolder]: 1861/4541 cut-off events. [2021-04-29 00:44:40,683 INFO L130 PetriNetUnfolder]: For 39348/45669 co-relation queries the response was YES. [2021-04-29 00:44:40,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22087 conditions, 4541 events. 1861/4541 cut-off events. For 39348/45669 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 49274 event pairs, 0 based on Foata normal form. 1091/3090 useless extension candidates. Maximal degree in co-relation 22041. Up to 1964 conditions per place. [2021-04-29 00:44:40,702 INFO L132 encePairwiseOnDemand]: 314/326 looper letters, 2 selfloop transitions, 49 changer transitions 20/116 dead transitions. [2021-04-29 00:44:40,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 116 transitions, 1412 flow [2021-04-29 00:44:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:44:40,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:44:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2204 transitions. [2021-04-29 00:44:40,708 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7511929107021131 [2021-04-29 00:44:40,709 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2204 transitions. [2021-04-29 00:44:40,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2204 transitions. [2021-04-29 00:44:40,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:40,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2204 transitions. [2021-04-29 00:44:40,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.88888888888889) internal successors, (2204), 9 states have internal predecessors, (2204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:40,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:40,719 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:40,719 INFO L185 Difference]: Start difference. First operand has 116 places, 108 transitions, 1244 flow. Second operand 9 states and 2204 transitions. [2021-04-29 00:44:40,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 116 transitions, 1412 flow [2021-04-29 00:44:40,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 1222 flow, removed 39 selfloop flow, removed 14 redundant places. [2021-04-29 00:44:40,869 INFO L241 Difference]: Finished difference. Result has 113 places, 96 transitions, 1017 flow [2021-04-29 00:44:40,870 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1017, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2021-04-29 00:44:40,870 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -13 predicate places. [2021-04-29 00:44:40,870 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:40,870 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 96 transitions, 1017 flow [2021-04-29 00:44:40,870 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 96 transitions, 1017 flow [2021-04-29 00:44:40,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 96 transitions, 1017 flow [2021-04-29 00:44:41,169 INFO L129 PetriNetUnfolder]: 1365/3593 cut-off events. [2021-04-29 00:44:41,169 INFO L130 PetriNetUnfolder]: For 11743/12808 co-relation queries the response was YES. [2021-04-29 00:44:41,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17117 conditions, 3593 events. 1365/3593 cut-off events. For 11743/12808 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 39699 event pairs, 0 based on Foata normal form. 27/1649 useless extension candidates. Maximal degree in co-relation 17077. Up to 1530 conditions per place. [2021-04-29 00:44:41,212 INFO L146 LiptonReduction]: Number of co-enabled transitions 836 [2021-04-29 00:44:41,909 WARN L205 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 151 [2021-04-29 00:44:42,564 WARN L205 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2021-04-29 00:44:44,044 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 228 [2021-04-29 00:44:45,448 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 226 [2021-04-29 00:44:46,057 WARN L205 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-04-29 00:44:46,330 WARN L205 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:44:48,000 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2021-04-29 00:44:48,664 WARN L205 SmtUtils]: Spent 662.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:44:48,685 INFO L158 LiptonReduction]: Checked pairs total: 10 [2021-04-29 00:44:48,686 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-29 00:44:48,686 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7816 [2021-04-29 00:44:48,687 INFO L480 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 1021 flow [2021-04-29 00:44:48,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 238.83333333333334) internal successors, (1433), 6 states have internal predecessors, (1433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:48,688 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:48,688 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:48,688 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-29 00:44:48,688 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:48,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:48,689 INFO L82 PathProgramCache]: Analyzing trace with hash 948886721, now seen corresponding path program 1 times [2021-04-29 00:44:48,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:48,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203990053] [2021-04-29 00:44:48,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:48,830 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-04-29 00:44:48,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-04-29 00:44:48,940 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-04-29 00:44:48,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-04-29 00:44:49,067 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2021-04-29 00:44:49,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:49,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:49,109 INFO L142 QuantifierPusher]: treesize reduction 17, result has 74.2 percent of original size [2021-04-29 00:44:49,112 INFO L147 QuantifierPusher]: treesize reduction 9, result has 81.6 percent of original size 40 [2021-04-29 00:44:49,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:49,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:44:49,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:49,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:49,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203990053] [2021-04-29 00:44:49,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:49,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:49,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194498043] [2021-04-29 00:44:49,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:49,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:49,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:49,306 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 328 [2021-04-29 00:44:49,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 97 transitions, 1021 flow. Second operand has 8 states, 8 states have (on average 152.125) internal successors, (1217), 8 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:49,307 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:49,307 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 328 [2021-04-29 00:44:49,307 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:50,367 INFO L129 PetriNetUnfolder]: 1689/4449 cut-off events. [2021-04-29 00:44:50,368 INFO L130 PetriNetUnfolder]: For 18103/19502 co-relation queries the response was YES. [2021-04-29 00:44:50,389 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21714 conditions, 4449 events. 1689/4449 cut-off events. For 18103/19502 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 51194 event pairs, 0 based on Foata normal form. 71/2076 useless extension candidates. Maximal degree in co-relation 21672. Up to 1890 conditions per place. [2021-04-29 00:44:50,395 INFO L132 encePairwiseOnDemand]: 317/328 looper letters, 22 selfloop transitions, 11 changer transitions 11/103 dead transitions. [2021-04-29 00:44:50,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 103 transitions, 1198 flow [2021-04-29 00:44:50,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-29 00:44:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-04-29 00:44:50,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1234 transitions. [2021-04-29 00:44:50,401 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.47027439024390244 [2021-04-29 00:44:50,401 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1234 transitions. [2021-04-29 00:44:50,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1234 transitions. [2021-04-29 00:44:50,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:50,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1234 transitions. [2021-04-29 00:44:50,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 154.25) internal successors, (1234), 8 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:50,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 328.0) internal successors, (2952), 9 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:50,409 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 328.0) internal successors, (2952), 9 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:50,410 INFO L185 Difference]: Start difference. First operand has 112 places, 97 transitions, 1021 flow. Second operand 8 states and 1234 transitions. [2021-04-29 00:44:50,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 103 transitions, 1198 flow [2021-04-29 00:44:51,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 103 transitions, 1014 flow, removed 38 selfloop flow, removed 12 redundant places. [2021-04-29 00:44:51,048 INFO L241 Difference]: Finished difference. Result has 110 places, 92 transitions, 835 flow [2021-04-29 00:44:51,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=844, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=835, PETRI_PLACES=110, PETRI_TRANSITIONS=92} [2021-04-29 00:44:51,048 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -16 predicate places. [2021-04-29 00:44:51,048 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:51,048 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 92 transitions, 835 flow [2021-04-29 00:44:51,048 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 92 transitions, 835 flow [2021-04-29 00:44:51,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 92 transitions, 835 flow [2021-04-29 00:44:51,386 INFO L129 PetriNetUnfolder]: 1361/3575 cut-off events. [2021-04-29 00:44:51,386 INFO L130 PetriNetUnfolder]: For 7013/7195 co-relation queries the response was YES. [2021-04-29 00:44:51,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12687 conditions, 3575 events. 1361/3575 cut-off events. For 7013/7195 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 39780 event pairs, 0 based on Foata normal form. 26/1593 useless extension candidates. Maximal degree in co-relation 12650. Up to 1530 conditions per place. [2021-04-29 00:44:51,435 INFO L146 LiptonReduction]: Number of co-enabled transitions 796 [2021-04-29 00:44:51,464 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:51,464 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:51,464 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 416 [2021-04-29 00:44:51,465 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 92 transitions, 835 flow [2021-04-29 00:44:51,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 152.125) internal successors, (1217), 8 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:51,466 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:51,466 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:51,466 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-04-29 00:44:51,466 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:51,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:51,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1810738599, now seen corresponding path program 1 times [2021-04-29 00:44:51,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:51,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234379117] [2021-04-29 00:44:51,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:51,596 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-04-29 00:44:51,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-04-29 00:44:51,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:51,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:44:51,747 INFO L142 QuantifierPusher]: treesize reduction 26, result has 48.0 percent of original size [2021-04-29 00:44:51,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-04-29 00:44:51,850 INFO L142 QuantifierPusher]: treesize reduction 20, result has 83.1 percent of original size [2021-04-29 00:44:51,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 98 [2021-04-29 00:44:52,038 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 19 [2021-04-29 00:44:52,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:52,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:44:52,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:52,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:52,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234379117] [2021-04-29 00:44:52,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:52,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:52,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522379061] [2021-04-29 00:44:52,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:52,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:52,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:52,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:52,144 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 328 [2021-04-29 00:44:52,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 92 transitions, 835 flow. Second operand has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:52,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:52,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 328 [2021-04-29 00:44:52,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:52,425 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2021-04-29 00:44:53,345 INFO L129 PetriNetUnfolder]: 1361/3548 cut-off events. [2021-04-29 00:44:53,346 INFO L130 PetriNetUnfolder]: For 8203/8372 co-relation queries the response was YES. [2021-04-29 00:44:53,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12808 conditions, 3548 events. 1361/3548 cut-off events. For 8203/8372 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 39779 event pairs, 0 based on Foata normal form. 63/1643 useless extension candidates. Maximal degree in co-relation 12769. Up to 1530 conditions per place. [2021-04-29 00:44:53,363 INFO L132 encePairwiseOnDemand]: 318/328 looper letters, 15 selfloop transitions, 12 changer transitions 12/98 dead transitions. [2021-04-29 00:44:53,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 98 transitions, 995 flow [2021-04-29 00:44:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:44:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:44:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1358 transitions. [2021-04-29 00:44:53,368 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4600271002710027 [2021-04-29 00:44:53,369 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1358 transitions. [2021-04-29 00:44:53,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1358 transitions. [2021-04-29 00:44:53,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:53,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1358 transitions. [2021-04-29 00:44:53,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 150.88888888888889) internal successors, (1358), 9 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:53,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 328.0) internal successors, (3280), 10 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:53,375 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 328.0) internal successors, (3280), 10 states have internal predecessors, (3280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:53,375 INFO L185 Difference]: Start difference. First operand has 105 places, 92 transitions, 835 flow. Second operand 9 states and 1358 transitions. [2021-04-29 00:44:53,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 98 transitions, 995 flow [2021-04-29 00:44:53,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 907 flow, removed 12 selfloop flow, removed 11 redundant places. [2021-04-29 00:44:53,632 INFO L241 Difference]: Finished difference. Result has 105 places, 86 transitions, 728 flow [2021-04-29 00:44:53,633 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=328, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=105, PETRI_TRANSITIONS=86} [2021-04-29 00:44:53,633 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -21 predicate places. [2021-04-29 00:44:53,633 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:53,633 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 86 transitions, 728 flow [2021-04-29 00:44:53,633 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 86 transitions, 728 flow [2021-04-29 00:44:53,634 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 86 transitions, 728 flow [2021-04-29 00:44:53,788 INFO L129 PetriNetUnfolder]: 765/2042 cut-off events. [2021-04-29 00:44:53,788 INFO L130 PetriNetUnfolder]: For 3291/3403 co-relation queries the response was YES. [2021-04-29 00:44:53,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7248 conditions, 2042 events. 765/2042 cut-off events. For 3291/3403 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 20623 event pairs, 0 based on Foata normal form. 13/893 useless extension candidates. Maximal degree in co-relation 7213. Up to 900 conditions per place. [2021-04-29 00:44:53,811 INFO L146 LiptonReduction]: Number of co-enabled transitions 732 [2021-04-29 00:44:54,479 WARN L205 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-04-29 00:44:54,705 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:44:56,062 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-04-29 00:44:56,526 WARN L205 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:44:56,550 INFO L158 LiptonReduction]: Checked pairs total: 6 [2021-04-29 00:44:56,550 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:44:56,550 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2917 [2021-04-29 00:44:56,551 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 87 transitions, 736 flow [2021-04-29 00:44:56,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:56,551 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:56,551 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-04-29 00:44:56,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-04-29 00:44:56,551 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash 778678262, now seen corresponding path program 1 times [2021-04-29 00:44:56,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:56,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762869712] [2021-04-29 00:44:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:56,697 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-04-29 00:44:56,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-04-29 00:44:56,785 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-04-29 00:44:56,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-04-29 00:44:56,894 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-04-29 00:44:56,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-04-29 00:44:57,029 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2021-04-29 00:44:57,032 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-04-29 00:44:57,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-04-29 00:44:57,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:57,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-04-29 00:44:57,177 INFO L142 QuantifierPusher]: treesize reduction 3, result has 85.7 percent of original size [2021-04-29 00:44:57,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:44:57,244 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-04-29 00:44:57,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:57,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762869712] [2021-04-29 00:44:57,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:57,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-29 00:44:57,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553975544] [2021-04-29 00:44:57,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-29 00:44:57,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:57,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-29 00:44:57,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-04-29 00:44:57,291 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 329 [2021-04-29 00:44:57,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 87 transitions, 736 flow. Second operand has 9 states, 9 states have (on average 156.11111111111111) internal successors, (1405), 9 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:57,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:57,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 329 [2021-04-29 00:44:57,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:57,550 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2021-04-29 00:44:58,442 INFO L129 PetriNetUnfolder]: 1037/2754 cut-off events. [2021-04-29 00:44:58,443 INFO L130 PetriNetUnfolder]: For 6585/6731 co-relation queries the response was YES. [2021-04-29 00:44:58,454 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10063 conditions, 2754 events. 1037/2754 cut-off events. For 6585/6731 co-relation queries the response was YES. Maximal size of possible extension queue 825. Compared 29426 event pairs, 0 based on Foata normal form. 54/1300 useless extension candidates. Maximal degree in co-relation 10026. Up to 1170 conditions per place. [2021-04-29 00:44:58,458 INFO L132 encePairwiseOnDemand]: 319/329 looper letters, 15 selfloop transitions, 13 changer transitions 7/94 dead transitions. [2021-04-29 00:44:58,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 94 transitions, 896 flow [2021-04-29 00:44:58,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-29 00:44:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-04-29 00:44:58,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1574 transitions. [2021-04-29 00:44:58,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.478419452887538 [2021-04-29 00:44:58,465 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1574 transitions. [2021-04-29 00:44:58,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1574 transitions. [2021-04-29 00:44:58,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:44:58,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1574 transitions. [2021-04-29 00:44:58,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 157.4) internal successors, (1574), 10 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:58,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 329.0) internal successors, (3619), 11 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:58,475 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 329.0) internal successors, (3619), 11 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:58,475 INFO L185 Difference]: Start difference. First operand has 101 places, 87 transitions, 736 flow. Second operand 10 states and 1574 transitions. [2021-04-29 00:44:58,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 94 transitions, 896 flow [2021-04-29 00:44:58,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 795 flow, removed 16 selfloop flow, removed 15 redundant places. [2021-04-29 00:44:58,749 INFO L241 Difference]: Finished difference. Result has 99 places, 87 transitions, 700 flow [2021-04-29 00:44:58,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=700, PETRI_PLACES=99, PETRI_TRANSITIONS=87} [2021-04-29 00:44:58,750 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -27 predicate places. [2021-04-29 00:44:58,750 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:44:58,750 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 87 transitions, 700 flow [2021-04-29 00:44:58,751 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 87 transitions, 700 flow [2021-04-29 00:44:58,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 87 transitions, 700 flow [2021-04-29 00:44:58,912 INFO L129 PetriNetUnfolder]: 765/2043 cut-off events. [2021-04-29 00:44:58,912 INFO L130 PetriNetUnfolder]: For 2892/3012 co-relation queries the response was YES. [2021-04-29 00:44:58,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7172 conditions, 2043 events. 765/2043 cut-off events. For 2892/3012 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 20742 event pairs, 0 based on Foata normal form. 15/894 useless extension candidates. Maximal degree in co-relation 7138. Up to 900 conditions per place. [2021-04-29 00:44:58,936 INFO L146 LiptonReduction]: Number of co-enabled transitions 744 [2021-04-29 00:44:58,949 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:44:58,949 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:44:58,949 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 199 [2021-04-29 00:44:58,950 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 700 flow [2021-04-29 00:44:58,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 156.11111111111111) internal successors, (1405), 9 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:58,951 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:44:58,951 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:44:58,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-04-29 00:44:58,952 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:44:58,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:44:58,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1415460740, now seen corresponding path program 1 times [2021-04-29 00:44:58,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:44:58,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424824239] [2021-04-29 00:44:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:44:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:44:59,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:44:59,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:44:59,132 INFO L142 QuantifierPusher]: treesize reduction 5, result has 76.2 percent of original size [2021-04-29 00:44:59,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:44:59,173 INFO L142 QuantifierPusher]: treesize reduction 16, result has 69.2 percent of original size [2021-04-29 00:44:59,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-04-29 00:44:59,306 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2021-04-29 00:44:59,309 INFO L142 QuantifierPusher]: treesize reduction 6, result has 87.5 percent of original size [2021-04-29 00:44:59,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-04-29 00:44:59,456 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2021-04-29 00:44:59,460 INFO L142 QuantifierPusher]: treesize reduction 27, result has 40.0 percent of original size [2021-04-29 00:44:59,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:44:59,524 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-04-29 00:44:59,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:44:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:44:59,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424824239] [2021-04-29 00:44:59,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:44:59,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:44:59,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946464134] [2021-04-29 00:44:59,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:44:59,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:44:59,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:44:59,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:44:59,577 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 329 [2021-04-29 00:44:59,579 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 700 flow. Second operand has 8 states, 8 states have (on average 157.125) internal successors, (1257), 8 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:44:59,579 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:44:59,580 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 329 [2021-04-29 00:44:59,580 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:44:59,962 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-04-29 00:45:01,031 INFO L129 PetriNetUnfolder]: 1248/3307 cut-off events. [2021-04-29 00:45:01,031 INFO L130 PetriNetUnfolder]: For 7367/7529 co-relation queries the response was YES. [2021-04-29 00:45:01,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11953 conditions, 3307 events. 1248/3307 cut-off events. For 7367/7529 co-relation queries the response was YES. Maximal size of possible extension queue 1020. Compared 35911 event pairs, 0 based on Foata normal form. 55/1568 useless extension candidates. Maximal degree in co-relation 11917. Up to 1350 conditions per place. [2021-04-29 00:45:01,047 INFO L132 encePairwiseOnDemand]: 320/329 looper letters, 14 selfloop transitions, 15 changer transitions 9/94 dead transitions. [2021-04-29 00:45:01,047 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 94 transitions, 863 flow [2021-04-29 00:45:01,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-29 00:45:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-04-29 00:45:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1587 transitions. [2021-04-29 00:45:01,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.482370820668693 [2021-04-29 00:45:01,055 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1587 transitions. [2021-04-29 00:45:01,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1587 transitions. [2021-04-29 00:45:01,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:45:01,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1587 transitions. [2021-04-29 00:45:01,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 158.7) internal successors, (1587), 10 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:01,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 329.0) internal successors, (3619), 11 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:01,061 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 329.0) internal successors, (3619), 11 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:01,061 INFO L185 Difference]: Start difference. First operand has 97 places, 87 transitions, 700 flow. Second operand 10 states and 1587 transitions. [2021-04-29 00:45:01,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 94 transitions, 863 flow [2021-04-29 00:45:01,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 94 transitions, 815 flow, removed 6 selfloop flow, removed 10 redundant places. [2021-04-29 00:45:01,295 INFO L241 Difference]: Finished difference. Result has 97 places, 81 transitions, 644 flow [2021-04-29 00:45:01,295 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=644, PETRI_PLACES=97, PETRI_TRANSITIONS=81} [2021-04-29 00:45:01,295 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -29 predicate places. [2021-04-29 00:45:01,295 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:45:01,296 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 81 transitions, 644 flow [2021-04-29 00:45:01,296 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 81 transitions, 644 flow [2021-04-29 00:45:01,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 81 transitions, 644 flow [2021-04-29 00:45:01,401 INFO L129 PetriNetUnfolder]: 354/1027 cut-off events. [2021-04-29 00:45:01,401 INFO L130 PetriNetUnfolder]: For 2058/2121 co-relation queries the response was YES. [2021-04-29 00:45:01,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 1027 events. 354/1027 cut-off events. For 2058/2121 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 9064 event pairs, 0 based on Foata normal form. 11/509 useless extension candidates. Maximal degree in co-relation 3683. Up to 405 conditions per place. [2021-04-29 00:45:01,412 INFO L146 LiptonReduction]: Number of co-enabled transitions 376 [2021-04-29 00:45:02,091 INFO L158 LiptonReduction]: Checked pairs total: 30 [2021-04-29 00:45:02,091 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-29 00:45:02,091 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 796 [2021-04-29 00:45:02,093 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 674 flow [2021-04-29 00:45:02,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 157.125) internal successors, (1257), 8 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:02,094 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:45:02,094 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:45:02,094 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-04-29 00:45:02,094 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:45:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:45:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash -184173274, now seen corresponding path program 2 times [2021-04-29 00:45:02,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:45:02,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793778201] [2021-04-29 00:45:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:45:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:45:02,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:02,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:45:02,293 INFO L142 QuantifierPusher]: treesize reduction 84, result has 23.6 percent of original size [2021-04-29 00:45:02,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-04-29 00:45:02,372 INFO L142 QuantifierPusher]: treesize reduction 57, result has 56.5 percent of original size [2021-04-29 00:45:02,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-04-29 00:45:02,397 INFO L142 QuantifierPusher]: treesize reduction 32, result has 68.3 percent of original size [2021-04-29 00:45:02,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-04-29 00:45:02,523 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 16 [2021-04-29 00:45:02,531 INFO L142 QuantifierPusher]: treesize reduction 23, result has 69.3 percent of original size [2021-04-29 00:45:02,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-04-29 00:45:02,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:02,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:45:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:45:02,668 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793778201] [2021-04-29 00:45:02,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:45:02,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:45:02,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706030887] [2021-04-29 00:45:02,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:45:02,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:45:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:45:02,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:45:02,672 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 331 [2021-04-29 00:45:02,673 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 674 flow. Second operand has 7 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:02,673 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:45:02,673 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 331 [2021-04-29 00:45:02,673 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:45:02,944 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2021-04-29 00:45:03,360 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2021-04-29 00:45:03,674 INFO L129 PetriNetUnfolder]: 461/1295 cut-off events. [2021-04-29 00:45:03,674 INFO L130 PetriNetUnfolder]: For 3645/3729 co-relation queries the response was YES. [2021-04-29 00:45:03,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 1295 events. 461/1295 cut-off events. For 3645/3729 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 11594 event pairs, 0 based on Foata normal form. 70/692 useless extension candidates. Maximal degree in co-relation 4836. Up to 495 conditions per place. [2021-04-29 00:45:03,680 INFO L132 encePairwiseOnDemand]: 322/331 looper letters, 10 selfloop transitions, 6 changer transitions 19/84 dead transitions. [2021-04-29 00:45:03,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 84 transitions, 757 flow [2021-04-29 00:45:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:45:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:45:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 998 transitions. [2021-04-29 00:45:03,687 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5025176233635448 [2021-04-29 00:45:03,687 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 998 transitions. [2021-04-29 00:45:03,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 998 transitions. [2021-04-29 00:45:03,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:45:03,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 998 transitions. [2021-04-29 00:45:03,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 166.33333333333334) internal successors, (998), 6 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:03,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:03,691 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:03,692 INFO L185 Difference]: Start difference. First operand has 96 places, 82 transitions, 674 flow. Second operand 6 states and 998 transitions. [2021-04-29 00:45:03,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 84 transitions, 757 flow [2021-04-29 00:45:03,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 84 transitions, 641 flow, removed 6 selfloop flow, removed 20 redundant places. [2021-04-29 00:45:03,731 INFO L241 Difference]: Finished difference. Result has 82 places, 65 transitions, 431 flow [2021-04-29 00:45:03,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2021-04-29 00:45:03,731 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -44 predicate places. [2021-04-29 00:45:03,731 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:45:03,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 65 transitions, 431 flow [2021-04-29 00:45:03,732 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 65 transitions, 431 flow [2021-04-29 00:45:03,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 65 transitions, 431 flow [2021-04-29 00:45:03,774 INFO L129 PetriNetUnfolder]: 155/496 cut-off events. [2021-04-29 00:45:03,774 INFO L130 PetriNetUnfolder]: For 960/994 co-relation queries the response was YES. [2021-04-29 00:45:03,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 496 events. 155/496 cut-off events. For 960/994 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 3781 event pairs, 0 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 1702. Up to 171 conditions per place. [2021-04-29 00:45:03,778 INFO L146 LiptonReduction]: Number of co-enabled transitions 220 [2021-04-29 00:45:06,750 WARN L205 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-04-29 00:45:09,424 WARN L205 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 176 DAG size of output: 175 [2021-04-29 00:45:15,323 WARN L205 SmtUtils]: Spent 5.89 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-04-29 00:45:18,008 WARN L205 SmtUtils]: Spent 2.68 s on a formula simplification that was a NOOP. DAG size: 254 [2021-04-29 00:45:21,198 WARN L205 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-04-29 00:45:22,614 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 175 [2021-04-29 00:45:29,185 WARN L205 SmtUtils]: Spent 6.57 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-29 00:45:32,101 WARN L205 SmtUtils]: Spent 2.91 s on a formula simplification that was a NOOP. DAG size: 255 [2021-04-29 00:45:32,112 INFO L158 LiptonReduction]: Checked pairs total: 4 [2021-04-29 00:45:32,112 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-29 00:45:32,113 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28382 [2021-04-29 00:45:32,113 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 431 flow [2021-04-29 00:45:32,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 164.28571428571428) internal successors, (1150), 7 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:32,114 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:45:32,114 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:45:32,114 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-04-29 00:45:32,114 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:45:32,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:45:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash 473789212, now seen corresponding path program 1 times [2021-04-29 00:45:32,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:45:32,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250636726] [2021-04-29 00:45:32,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:45:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:45:32,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:32,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:45:32,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:32,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:45:32,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:32,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:45:32,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:45:32,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:45:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:45:32,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250636726] [2021-04-29 00:45:32,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:45:32,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:45:32,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506767392] [2021-04-29 00:45:32,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:45:32,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:45:32,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:45:32,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:45:32,334 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 333 [2021-04-29 00:45:32,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 176.66666666666666) internal successors, (1060), 6 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:32,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:45:32,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 333 [2021-04-29 00:45:32,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:45:32,695 INFO L129 PetriNetUnfolder]: 263/827 cut-off events. [2021-04-29 00:45:32,695 INFO L130 PetriNetUnfolder]: For 2310/2385 co-relation queries the response was YES. [2021-04-29 00:45:32,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2975 conditions, 827 events. 263/827 cut-off events. For 2310/2385 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 6944 event pairs, 0 based on Foata normal form. 36/454 useless extension candidates. Maximal degree in co-relation 2950. Up to 298 conditions per place. [2021-04-29 00:45:32,699 INFO L132 encePairwiseOnDemand]: 328/333 looper letters, 9 selfloop transitions, 3 changer transitions 10/70 dead transitions. [2021-04-29 00:45:32,699 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 525 flow [2021-04-29 00:45:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:45:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:45:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1067 transitions. [2021-04-29 00:45:32,706 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.534034034034034 [2021-04-29 00:45:32,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1067 transitions. [2021-04-29 00:45:32,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1067 transitions. [2021-04-29 00:45:32,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:45:32,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1067 transitions. [2021-04-29 00:45:32,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 177.83333333333334) internal successors, (1067), 6 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:32,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:32,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:45:32,711 INFO L185 Difference]: Start difference. First operand has 75 places, 65 transitions, 431 flow. Second operand 6 states and 1067 transitions. [2021-04-29 00:45:32,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 525 flow [2021-04-29 00:45:32,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 462 flow, removed 10 selfloop flow, removed 13 redundant places. [2021-04-29 00:45:32,730 INFO L241 Difference]: Finished difference. Result has 68 places, 60 transitions, 362 flow [2021-04-29 00:45:32,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2021-04-29 00:45:32,731 INFO L343 CegarLoopForPetriNet]: 126 programPoint places, -58 predicate places. [2021-04-29 00:45:32,731 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:45:32,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 60 transitions, 362 flow [2021-04-29 00:45:32,731 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 60 transitions, 362 flow [2021-04-29 00:45:32,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 60 transitions, 362 flow [2021-04-29 00:45:32,770 INFO L129 PetriNetUnfolder]: 136/452 cut-off events. [2021-04-29 00:45:32,770 INFO L130 PetriNetUnfolder]: For 730/763 co-relation queries the response was YES. [2021-04-29 00:45:32,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 452 events. 136/452 cut-off events. For 730/763 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3411 event pairs, 0 based on Foata normal form. 3/239 useless extension candidates. Maximal degree in co-relation 1489. Up to 154 conditions per place. [2021-04-29 00:45:32,776 INFO L146 LiptonReduction]: Number of co-enabled transitions 180 [2021-04-29 00:45:33,804 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2021-04-29 00:45:34,156 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:45:35,789 WARN L205 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 112 DAG size of output: 86 [2021-04-29 00:45:36,465 WARN L205 SmtUtils]: Spent 673.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-04-29 00:45:41,895 WARN L205 SmtUtils]: Spent 5.42 s on a formula simplification. DAG size of input: 269 DAG size of output: 211 [2021-04-29 00:45:46,259 WARN L205 SmtUtils]: Spent 4.36 s on a formula simplification. DAG size of input: 204 DAG size of output: 203 [2021-04-29 00:45:56,253 WARN L205 SmtUtils]: Spent 9.99 s on a formula simplification. DAG size of input: 377 DAG size of output: 315 [2021-04-29 00:46:00,122 WARN L205 SmtUtils]: Spent 3.86 s on a formula simplification that was a NOOP. DAG size: 306 [2021-04-29 00:46:00,132 INFO L158 LiptonReduction]: Checked pairs total: 16 [2021-04-29 00:46:00,132 INFO L160 LiptonReduction]: Total number of compositions: 2 [2021-04-29 00:46:00,133 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27402 [2021-04-29 00:46:00,133 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 372 flow [2021-04-29 00:46:00,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.66666666666666) internal successors, (1060), 6 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:46:00,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:46:00,134 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-04-29 00:46:00,134 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-04-29 00:46:00,134 INFO L428 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:46:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:46:00,134 INFO L82 PathProgramCache]: Analyzing trace with hash -44848733, now seen corresponding path program 1 times [2021-04-29 00:46:00,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:46:00,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360280072] [2021-04-29 00:46:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:46:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:46:00,220 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:46:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:46:00,308 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:46:00,357 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 00:46:00,358 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 00:46:00,358 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-04-29 00:46:00,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 12:46:00 BasicIcfg [2021-04-29 00:46:00,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 00:46:00,469 INFO L168 Benchmark]: Toolchain (without parser) took 232889.28 ms. Allocated memory was 302.0 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 277.3 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 337.2 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:00,470 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 302.0 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:46:00,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.56 ms. Allocated memory is still 302.0 MB. Free memory was 274.1 MB in the beginning and 274.9 MB in the end (delta: -872.6 kB). Peak memory consumption was 36.3 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:00,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.08 ms. Allocated memory is still 302.0 MB. Free memory was 274.9 MB in the beginning and 272.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:00,470 INFO L168 Benchmark]: Boogie Preprocessor took 51.09 ms. Allocated memory is still 302.0 MB. Free memory was 272.8 MB in the beginning and 269.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:00,471 INFO L168 Benchmark]: RCFGBuilder took 3927.55 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 269.7 MB in the beginning and 278.3 MB in the end (delta: -8.6 MB). Peak memory consumption was 202.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:00,471 INFO L168 Benchmark]: TraceAbstraction took 227926.56 ms. Allocated memory was 362.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 278.3 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 275.0 MB. Max. memory is 16.0 GB. [2021-04-29 00:46:00,472 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.23 ms. Allocated memory is still 302.0 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 807.56 ms. Allocated memory is still 302.0 MB. Free memory was 274.1 MB in the beginning and 274.9 MB in the end (delta: -872.6 kB). Peak memory consumption was 36.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 123.08 ms. Allocated memory is still 302.0 MB. Free memory was 274.9 MB in the beginning and 272.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 51.09 ms. Allocated memory is still 302.0 MB. Free memory was 272.8 MB in the beginning and 269.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 3927.55 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 269.7 MB in the beginning and 278.3 MB in the end (delta: -8.6 MB). Peak memory consumption was 202.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 227926.56 ms. Allocated memory was 362.8 MB in the beginning and 1.8 GB in the end (delta: 1.5 GB). Free memory was 278.3 MB in the beginning and 1.5 GB in the end (delta: -1.2 GB). Peak memory consumption was 275.0 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 95041.5ms, 102 PlacesBefore, 126 PlacesAfterwards, 94 TransitionsBefore, 118 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 9 FixpointIterations, 160 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 228 TotalNumberOfCompositions, 15353 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3033, positive: 2748, positive conditional: 2748, positive unconditional: 0, negative: 285, negative conditional: 285, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1572, positive: 1510, positive conditional: 0, positive unconditional: 1510, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1572, positive: 1510, positive conditional: 0, positive unconditional: 1510, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1572, positive: 1492, positive conditional: 0, positive unconditional: 1492, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1670, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 1588, negative conditional: 0, negative unconditional: 1588, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3033, positive: 1238, positive conditional: 1238, positive unconditional: 0, negative: 223, negative conditional: 223, negative unconditional: 0, unknown: 1572, unknown conditional: 1572, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1572, Positive cache size: 1510, Positive conditional cache size: 1510, Positive unconditional cache size: 0, Negative cache size: 62, Negative conditional cache size: 62, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 207.8ms, 122 PlacesBefore, 50 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 932 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 904 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 102, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, positive: 54, positive conditional: 54, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1596, Positive cache size: 1526, Positive conditional cache size: 1526, Positive unconditional cache size: 0, Negative cache size: 70, Negative conditional cache size: 70, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 535.2ms, 51 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 564 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 185, positive: 154, positive conditional: 154, positive unconditional: 0, negative: 31, negative conditional: 31, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 75, positive: 68, positive conditional: 10, positive unconditional: 58, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 75, positive: 68, positive conditional: 10, positive unconditional: 58, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 75, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 29, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 7, negative conditional: 1, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 510, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 391, negative conditional: 99, negative unconditional: 292, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 185, positive: 86, positive conditional: 86, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 75, unknown conditional: 75, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1671, Positive cache size: 1594, Positive conditional cache size: 1594, Positive unconditional cache size: 0, Negative cache size: 77, Negative conditional cache size: 77, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 90.8ms, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 516 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 163, positive: 136, positive conditional: 136, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 24, positive conditional: 3, positive unconditional: 21, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, positive: 24, positive conditional: 3, positive unconditional: 21, 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: 25, positive: 24, positive conditional: 0, positive unconditional: 24, 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: 76, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, positive: 112, positive conditional: 112, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 25, unknown conditional: 25, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1696, Positive cache size: 1618, Positive conditional cache size: 1618, Positive unconditional cache size: 0, Negative cache size: 78, Negative conditional cache size: 78, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 312.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 99 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 4, positive unconditional: 7, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 11, positive conditional: 4, positive unconditional: 7, 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: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 256, positive: 191, positive conditional: 191, positive unconditional: 0, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1709, Positive cache size: 1629, Positive conditional cache size: 1629, Positive unconditional cache size: 0, Negative cache size: 80, Negative conditional cache size: 80, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 190.6ms, 55 PlacesBefore, 55 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 780 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 114, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1711, Positive cache size: 1629, Positive conditional cache size: 1629, Positive unconditional cache size: 0, Negative cache size: 82, Negative conditional cache size: 82, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1305.9ms, 61 PlacesBefore, 61 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 894 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1223, positive: 1109, positive conditional: 1109, positive unconditional: 0, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1737, Positive cache size: 1653, Positive conditional cache size: 1653, Positive unconditional cache size: 0, Negative cache size: 84, Negative conditional cache size: 84, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2449.6ms, 68 PlacesBefore, 68 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1090 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 210 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 52, positive: 50, positive conditional: 47, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 52, positive: 50, positive conditional: 47, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 52, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2337, positive: 2284, positive conditional: 2284, positive unconditional: 0, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1789, Positive cache size: 1703, Positive conditional cache size: 1703, Positive unconditional cache size: 0, Negative cache size: 86, Negative conditional cache size: 86, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1445.4ms, 73 PlacesBefore, 73 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 225 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 40, positive: 38, positive conditional: 38, positive unconditional: 0, 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: 40, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1347, positive: 1252, positive conditional: 1252, positive unconditional: 0, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 40, unknown conditional: 40, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1829, Positive cache size: 1741, Positive conditional cache size: 1741, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 527.1ms, 74 PlacesBefore, 70 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 772 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 165 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 38, positive conditional: 38, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 11, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 11, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 434, positive: 434, positive conditional: 434, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 41, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 13, unknown conditional: 13, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1842, Positive cache size: 1754, Positive conditional cache size: 1754, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 218.5ms, 72 PlacesBefore, 72 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 926 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 268 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1847, Positive cache size: 1759, Positive conditional cache size: 1759, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11335.7ms, 84 PlacesBefore, 85 PlacesAfterwards, 97 TransitionsBefore, 98 TransitionsAfterwards, 994 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 82, positive conditional: 82, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, 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: 14, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 39, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 90, positive: 68, positive conditional: 68, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 14, unknown conditional: 14, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1861, Positive cache size: 1773, Positive conditional cache size: 1773, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 176.4ms, 95 PlacesBefore, 94 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 1110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 511 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 7, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 84, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 924.0ms, 88 PlacesBefore, 88 PlacesAfterwards, 112 TransitionsBefore, 112 TransitionsAfterwards, 1444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 595.4ms, 96 PlacesBefore, 96 PlacesAfterwards, 120 TransitionsBefore, 120 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 592.0ms, 103 PlacesBefore, 101 PlacesAfterwards, 116 TransitionsBefore, 116 TransitionsAfterwards, 1538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 808.8ms, 103 PlacesBefore, 103 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 1654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 906.2ms, 106 PlacesBefore, 106 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1670 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 864.1ms, 116 PlacesBefore, 116 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1868, Positive cache size: 1780, Positive conditional cache size: 1780, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7815.3ms, 113 PlacesBefore, 112 PlacesAfterwards, 96 TransitionsBefore, 97 TransitionsAfterwards, 836 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 10 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1873, Positive cache size: 1785, Positive conditional cache size: 1785, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 415.8ms, 110 PlacesBefore, 105 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 796 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1873, Positive cache size: 1785, Positive conditional cache size: 1785, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2916.4ms, 105 PlacesBefore, 101 PlacesAfterwards, 86 TransitionsBefore, 87 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1879, Positive cache size: 1791, Positive conditional cache size: 1791, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 198.9ms, 99 PlacesBefore, 97 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1879, Positive cache size: 1791, Positive conditional cache size: 1791, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 795.2ms, 97 PlacesBefore, 96 PlacesAfterwards, 81 TransitionsBefore, 82 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 30 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 30, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 15, 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: 15, positive: 15, positive conditional: 0, positive unconditional: 15, 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: 30, positive: 15, positive conditional: 15, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1894, Positive cache size: 1806, Positive conditional cache size: 1806, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28381.0ms, 82 PlacesBefore, 75 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 220 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1896, Positive cache size: 1808, Positive conditional cache size: 1808, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27401.1ms, 68 PlacesBefore, 65 PlacesAfterwards, 60 TransitionsBefore, 61 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 16, unknown conditional: 16, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1912, Positive cache size: 1824, Positive conditional cache size: 1824, Positive unconditional cache size: 0, Negative cache size: 88, Negative conditional cache size: 88, Negative unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L772] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 36.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 227612.6ms, OverallIterations: 26, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 30822.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 95157.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 114 SDtfs, 144 SDslu, 62 SDs, 0 SdLazy, 1339 SolverSat, 559 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5317.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 10291.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1554occurred in iteration=17, InterpolantAutomatonStates: 175, 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: 139.1ms SsaConstructionTime, 1493.1ms SatisfiabilityAnalysisTime, 7888.3ms InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 381 ConstructedInterpolants, 0 QuantifiedInterpolants, 4363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...