/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 08:27:00,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 08:27:00,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 08:27:00,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 08:27:00,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 08:27:00,758 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 08:27:00,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 08:27:00,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 08:27:00,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 08:27:00,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 08:27:00,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 08:27:00,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 08:27:00,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 08:27:00,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 08:27:00,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 08:27:00,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 08:27:00,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 08:27:00,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 08:27:00,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 08:27:00,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 08:27:00,785 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 08:27:00,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 08:27:00,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 08:27:00,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 08:27:00,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 08:27:00,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 08:27:00,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 08:27:00,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 08:27:00,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 08:27:00,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 08:27:00,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 08:27:00,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 08:27:00,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 08:27:00,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 08:27:00,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 08:27:00,804 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 08:27:00,805 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 08:27:00,805 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 08:27:00,805 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 08:27:00,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 08:27:00,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 08:27:00,807 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 08:27:00,847 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 08:27:00,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 08:27:00,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 08:27:00,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 08:27:00,851 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 08:27:00,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 08:27:00,851 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 08:27:00,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 08:27:00,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 08:27:00,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 08:27:00,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 08:27:00,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 08:27:00,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 08:27:00,853 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 08:27:00,853 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 08:27:00,853 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 08:27:00,853 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 08:27:00,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 08:27:00,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 08:27:00,854 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 08:27:00,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 08:27:00,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 08:27:00,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 08:27:00,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 08:27:00,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 08:27:00,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 08:27:00,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 08:27:00,855 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 08:27:00,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 08:27:00,855 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 08:27:00,855 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 08:27:01,154 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 08:27:01,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 08:27:01,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 08:27:01,173 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 08:27:01,174 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 08:27:01,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-03-26 08:27:01,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68989dca/b7c07417f40e4c2baac25a436a0ca4f3/FLAG5174a3f20 [2021-03-26 08:27:01,751 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 08:27:01,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-03-26 08:27:01,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68989dca/b7c07417f40e4c2baac25a436a0ca4f3/FLAG5174a3f20 [2021-03-26 08:27:02,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68989dca/b7c07417f40e4c2baac25a436a0ca4f3 [2021-03-26 08:27:02,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 08:27:02,048 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 08:27:02,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 08:27:02,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 08:27:02,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 08:27:02,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,055 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700ccee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02, skipping insertion in model container [2021-03-26 08:27:02,055 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 08:27:02,111 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 08:27:02,256 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-26 08:27:02,516 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/singleton_with-uninit-problems.i[55568,55581] [2021-03-26 08:27:02,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 08:27:02,584 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 08:27:02,613 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-26 08:27:02,624 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/singleton_with-uninit-problems.i[55568,55581] [2021-03-26 08:27:02,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 08:27:02,825 INFO L208 MainTranslator]: Completed translation [2021-03-26 08:27:02,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02 WrapperNode [2021-03-26 08:27:02,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 08:27:02,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 08:27:02,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 08:27:02,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 08:27:02,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 08:27:02,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 08:27:02,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 08:27:02,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 08:27:02,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,919 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... [2021-03-26 08:27:02,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 08:27:02,922 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 08:27:02,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 08:27:02,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 08:27:02,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 08:27:02,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 08:27:02,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 08:27:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 08:27:02,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 08:27:02,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 08:27:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-03-26 08:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-03-26 08:27:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-26 08:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-26 08:27:03,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-26 08:27:03,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-26 08:27:03,001 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-26 08:27:03,001 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-26 08:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 08:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-03-26 08:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 08:27:03,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 08:27:03,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 08:27:03,005 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 08:27:03,447 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 08:27:03,448 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-03-26 08:27:03,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 08:27:03 BoogieIcfgContainer [2021-03-26 08:27:03,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 08:27:03,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 08:27:03,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 08:27:03,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 08:27:03,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 08:27:02" (1/3) ... [2021-03-26 08:27:03,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ab977e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 08:27:03, skipping insertion in model container [2021-03-26 08:27:03,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 08:27:02" (2/3) ... [2021-03-26 08:27:03,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73ab977e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 08:27:03, skipping insertion in model container [2021-03-26 08:27:03,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 08:27:03" (3/3) ... [2021-03-26 08:27:03,458 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2021-03-26 08:27:03,463 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 08:27:03,467 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 08:27:03,467 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 08:27:03,522 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,522 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,522 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,522 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,522 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,523 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,523 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,523 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,523 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,523 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,523 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,524 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,524 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,524 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,524 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,524 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,524 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,524 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,525 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,525 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,525 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,525 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,525 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,525 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,526 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,526 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,526 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,526 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,526 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,526 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,526 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,527 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,527 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,527 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,527 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,527 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,527 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,528 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,528 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,528 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,528 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,529 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,530 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,531 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,531 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,531 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,531 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,531 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,531 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,531 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,532 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,533 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,534 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,535 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,535 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,535 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,535 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,535 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,535 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,535 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,536 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,537 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,538 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,539 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,540 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,541 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,542 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,543 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,543 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,543 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,543 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,543 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,543 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,543 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,544 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,545 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,546 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,547 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,548 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,549 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,551 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,551 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,551 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,551 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,555 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,555 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,556 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,556 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,557 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,557 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,557 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,557 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,558 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,558 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,559 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,559 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,560 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,560 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,560 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,560 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,561 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,562 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,562 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,563 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,563 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,563 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,563 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,563 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,565 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,565 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,565 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,565 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,566 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,566 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,566 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,566 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,567 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,567 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,568 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,568 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,568 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,568 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,569 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,569 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,570 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,570 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,571 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,571 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,571 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,571 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,572 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,573 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,573 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,573 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 08:27:03,649 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-03-26 08:27:03,665 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-03-26 08:27:03,683 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 08:27:03,684 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 08:27:03,684 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 08:27:03,684 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 08:27:03,684 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 08:27:03,684 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 08:27:03,684 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 08:27:03,684 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 08:27:03,716 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 255 transitions, 890 flow [2021-03-26 08:27:03,786 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-26 08:27:03,787 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-26 08:27:03,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 316 events. 67/316 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 995 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2021-03-26 08:27:03,799 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 255 transitions, 890 flow [2021-03-26 08:27:03,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 147 transitions, 447 flow [2021-03-26 08:27:03,807 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:03,818 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-26 08:27:03,821 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-26 08:27:03,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 147 transitions, 447 flow [2021-03-26 08:27:03,901 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-26 08:27:03,902 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-26 08:27:03,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 316 events. 67/316 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 983 event pairs, 0 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2021-03-26 08:27:03,917 INFO L142 LiptonReduction]: Number of co-enabled transitions 4982 [2021-03-26 08:27:06,008 INFO L154 LiptonReduction]: Checked pairs total: 2660 [2021-03-26 08:27:06,009 INFO L156 LiptonReduction]: Total number of compositions: 70 [2021-03-26 08:27:06,012 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2206 [2021-03-26 08:27:06,025 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2021-03-26 08:27:06,025 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 08:27:06,025 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:06,026 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:06,026 INFO L428 AbstractCegarLoop]: === Iteration 1 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:06,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1880774221, now seen corresponding path program 1 times [2021-03-26 08:27:06,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:06,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4967] [2021-03-26 08:27:06,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:06,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:06,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:06,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:06,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:06,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:06,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:06,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:06,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:06,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:06,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:27:06,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:06,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:06,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:06,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:06,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4967] [2021-03-26 08:27:06,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:06,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 08:27:06,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306448585] [2021-03-26 08:27:06,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 08:27:06,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 08:27:06,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 08:27:06,378 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 336 [2021-03-26 08:27:06,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 85 transitions, 323 flow. Second operand has 7 states, 7 states have (on average 193.71428571428572) internal successors, (1356), 7 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:06,384 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:06,384 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 336 [2021-03-26 08:27:06,385 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:07,188 INFO L129 PetriNetUnfolder]: 3307/4976 cut-off events. [2021-03-26 08:27:07,188 INFO L130 PetriNetUnfolder]: For 1440/1445 co-relation queries the response was YES. [2021-03-26 08:27:07,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10444 conditions, 4976 events. 3307/4976 cut-off events. For 1440/1445 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26754 event pairs, 1751 based on Foata normal form. 121/3980 useless extension candidates. Maximal degree in co-relation 10407. Up to 2724 conditions per place. [2021-03-26 08:27:07,235 INFO L132 encePairwiseOnDemand]: 325/336 looper letters, 69 selfloop transitions, 7 changer transitions 4/121 dead transitions. [2021-03-26 08:27:07,235 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 121 transitions, 588 flow [2021-03-26 08:27:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:27:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:27:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1620 transitions. [2021-03-26 08:27:07,254 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6026785714285714 [2021-03-26 08:27:07,255 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1620 transitions. [2021-03-26 08:27:07,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1620 transitions. [2021-03-26 08:27:07,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:07,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1620 transitions. [2021-03-26 08:27:07,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 202.5) internal successors, (1620), 8 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:07,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 336.0) internal successors, (3024), 9 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:07,285 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 336.0) internal successors, (3024), 9 states have internal predecessors, (3024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:07,287 INFO L185 Difference]: Start difference. First operand has 64 places, 85 transitions, 323 flow. Second operand 8 states and 1620 transitions. [2021-03-26 08:27:07,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 121 transitions, 588 flow [2021-03-26 08:27:07,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 464 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-03-26 08:27:07,309 INFO L241 Difference]: Finished difference. Result has 62 places, 86 transitions, 256 flow [2021-03-26 08:27:07,311 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=336, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=62, PETRI_TRANSITIONS=86} [2021-03-26 08:27:07,311 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2021-03-26 08:27:07,311 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:07,312 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-26 08:27:07,313 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-26 08:27:07,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 86 transitions, 256 flow [2021-03-26 08:27:07,330 INFO L129 PetriNetUnfolder]: 115/277 cut-off events. [2021-03-26 08:27:07,330 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-26 08:27:07,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 277 events. 115/277 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 883 event pairs, 1 based on Foata normal form. 1/196 useless extension candidates. Maximal degree in co-relation 320. Up to 48 conditions per place. [2021-03-26 08:27:07,335 INFO L142 LiptonReduction]: Number of co-enabled transitions 1484 [2021-03-26 08:27:08,193 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-26 08:27:08,366 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-26 08:27:08,686 INFO L154 LiptonReduction]: Checked pairs total: 323 [2021-03-26 08:27:08,686 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 08:27:08,686 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1375 [2021-03-26 08:27:08,687 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 75 transitions, 234 flow [2021-03-26 08:27:08,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 193.71428571428572) internal successors, (1356), 7 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:08,688 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:08,688 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:08,689 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 08:27:08,689 INFO L428 AbstractCegarLoop]: === Iteration 2 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1911423025, now seen corresponding path program 1 times [2021-03-26 08:27:08,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:08,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035601166] [2021-03-26 08:27:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:08,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:08,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:08,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:08,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:08,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:08,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:08,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:08,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:08,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:08,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:08,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035601166] [2021-03-26 08:27:08,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:08,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:27:08,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191889138] [2021-03-26 08:27:08,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 08:27:08,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:08,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 08:27:08,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 08:27:08,759 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-26 08:27:08,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 75 transitions, 234 flow. Second operand has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:08,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:08,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-26 08:27:08,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:09,320 INFO L129 PetriNetUnfolder]: 4056/5694 cut-off events. [2021-03-26 08:27:09,320 INFO L130 PetriNetUnfolder]: For 1025/1025 co-relation queries the response was YES. [2021-03-26 08:27:09,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10629 conditions, 5694 events. 4056/5694 cut-off events. For 1025/1025 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 26293 event pairs, 1893 based on Foata normal form. 2/4271 useless extension candidates. Maximal degree in co-relation 9570. Up to 3235 conditions per place. [2021-03-26 08:27:09,360 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 58 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2021-03-26 08:27:09,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 442 flow [2021-03-26 08:27:09,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:27:09,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:27:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1473 transitions. [2021-03-26 08:27:09,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7054597701149425 [2021-03-26 08:27:09,364 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1473 transitions. [2021-03-26 08:27:09,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1473 transitions. [2021-03-26 08:27:09,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:09,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1473 transitions. [2021-03-26 08:27:09,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:09,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:09,372 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:09,372 INFO L185 Difference]: Start difference. First operand has 50 places, 75 transitions, 234 flow. Second operand 6 states and 1473 transitions. [2021-03-26 08:27:09,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 442 flow [2021-03-26 08:27:09,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 429 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-26 08:27:09,380 INFO L241 Difference]: Finished difference. Result has 54 places, 79 transitions, 269 flow [2021-03-26 08:27:09,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=54, PETRI_TRANSITIONS=79} [2021-03-26 08:27:09,381 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2021-03-26 08:27:09,381 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:09,381 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-26 08:27:09,382 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-26 08:27:09,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 79 transitions, 269 flow [2021-03-26 08:27:09,411 INFO L129 PetriNetUnfolder]: 223/447 cut-off events. [2021-03-26 08:27:09,411 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-03-26 08:27:09,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 447 events. 223/447 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1599 event pairs, 1 based on Foata normal form. 1/304 useless extension candidates. Maximal degree in co-relation 403. Up to 96 conditions per place. [2021-03-26 08:27:09,416 INFO L142 LiptonReduction]: Number of co-enabled transitions 1154 [2021-03-26 08:27:09,420 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:09,420 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:09,420 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-26 08:27:09,425 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 79 transitions, 269 flow [2021-03-26 08:27:09,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:09,426 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:09,426 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:09,427 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 08:27:09,427 INFO L428 AbstractCegarLoop]: === Iteration 3 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:09,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1741067560, now seen corresponding path program 1 times [2021-03-26 08:27:09,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:09,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378626505] [2021-03-26 08:27:09,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:09,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:09,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:09,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:09,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:09,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:09,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:09,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:09,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:09,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:09,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:09,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378626505] [2021-03-26 08:27:09,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:09,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:27:09,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513771536] [2021-03-26 08:27:09,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:27:09,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:09,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:27:09,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:27:09,524 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 348 [2021-03-26 08:27:09,526 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 79 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:09,526 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:09,526 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 348 [2021-03-26 08:27:09,526 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:10,127 INFO L129 PetriNetUnfolder]: 4974/6927 cut-off events. [2021-03-26 08:27:10,127 INFO L130 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2021-03-26 08:27:10,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13252 conditions, 6927 events. 4974/6927 cut-off events. For 1741/1741 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 32634 event pairs, 2253 based on Foata normal form. 2/5164 useless extension candidates. Maximal degree in co-relation 10922. Up to 2520 conditions per place. [2021-03-26 08:27:10,181 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 82 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2021-03-26 08:27:10,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 588 flow [2021-03-26 08:27:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:27:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:27:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1457 transitions. [2021-03-26 08:27:10,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5981116584564861 [2021-03-26 08:27:10,187 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1457 transitions. [2021-03-26 08:27:10,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1457 transitions. [2021-03-26 08:27:10,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:10,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1457 transitions. [2021-03-26 08:27:10,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,196 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,196 INFO L185 Difference]: Start difference. First operand has 54 places, 79 transitions, 269 flow. Second operand 7 states and 1457 transitions. [2021-03-26 08:27:10,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 588 flow [2021-03-26 08:27:10,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 577 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 08:27:10,204 INFO L241 Difference]: Finished difference. Result has 61 places, 81 transitions, 311 flow [2021-03-26 08:27:10,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=61, PETRI_TRANSITIONS=81} [2021-03-26 08:27:10,204 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2021-03-26 08:27:10,204 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:10,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-26 08:27:10,205 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-26 08:27:10,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 81 transitions, 311 flow [2021-03-26 08:27:10,230 INFO L129 PetriNetUnfolder]: 230/457 cut-off events. [2021-03-26 08:27:10,230 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-03-26 08:27:10,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 457 events. 230/457 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1646 event pairs, 0 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 400. Up to 96 conditions per place. [2021-03-26 08:27:10,235 INFO L142 LiptonReduction]: Number of co-enabled transitions 1222 [2021-03-26 08:27:10,239 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:10,239 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:10,239 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-26 08:27:10,240 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 81 transitions, 311 flow [2021-03-26 08:27:10,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,242 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:10,242 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:10,242 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 08:27:10,242 INFO L428 AbstractCegarLoop]: === Iteration 4 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:10,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:10,242 INFO L82 PathProgramCache]: Analyzing trace with hash -742337810, now seen corresponding path program 1 times [2021-03-26 08:27:10,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:10,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116349538] [2021-03-26 08:27:10,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:10,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:10,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:10,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:10,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:10,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:10,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:10,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:10,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116349538] [2021-03-26 08:27:10,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:10,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 08:27:10,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607849604] [2021-03-26 08:27:10,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 08:27:10,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 08:27:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 08:27:10,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 348 [2021-03-26 08:27:10,307 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 81 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 261.25) internal successors, (1045), 4 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,308 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:10,308 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 348 [2021-03-26 08:27:10,308 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:10,899 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][33], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-26 08:27:10,900 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,900 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][32], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, 125#L1164-2true, Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-26 08:27:10,900 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,901 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 210#true, 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-26 08:27:10,901 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,901 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,901 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,901 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,901 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][34], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-26 08:27:10,901 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,901 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,902 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,902 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,902 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][36], [Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-26 08:27:10,902 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,902 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,902 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,902 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,902 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][42], [Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-26 08:27:10,903 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,903 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,903 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,903 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:10,903 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][31], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), 210#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-26 08:27:10,904 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,904 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][30], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 210#true, 226#true, 42#L1156-1true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5)]) [2021-03-26 08:27:10,904 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,904 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-26 08:27:10,907 INFO L129 PetriNetUnfolder]: 5344/7964 cut-off events. [2021-03-26 08:27:10,907 INFO L130 PetriNetUnfolder]: For 6145/6145 co-relation queries the response was YES. [2021-03-26 08:27:10,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17336 conditions, 7964 events. 5344/7964 cut-off events. For 6145/6145 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 45349 event pairs, 563 based on Foata normal form. 0/6058 useless extension candidates. Maximal degree in co-relation 11827. Up to 2435 conditions per place. [2021-03-26 08:27:10,982 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 48 selfloop transitions, 20 changer transitions 2/122 dead transitions. [2021-03-26 08:27:10,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 122 transitions, 561 flow [2021-03-26 08:27:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 08:27:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 08:27:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1355 transitions. [2021-03-26 08:27:10,985 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7787356321839081 [2021-03-26 08:27:10,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1355 transitions. [2021-03-26 08:27:10,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1355 transitions. [2021-03-26 08:27:10,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:10,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1355 transitions. [2021-03-26 08:27:10,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:10,993 INFO L185 Difference]: Start difference. First operand has 61 places, 81 transitions, 311 flow. Second operand 5 states and 1355 transitions. [2021-03-26 08:27:10,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 122 transitions, 561 flow [2021-03-26 08:27:11,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 540 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-26 08:27:11,006 INFO L241 Difference]: Finished difference. Result has 67 places, 101 transitions, 476 flow [2021-03-26 08:27:11,007 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=67, PETRI_TRANSITIONS=101} [2021-03-26 08:27:11,007 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2021-03-26 08:27:11,007 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:11,007 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-26 08:27:11,007 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-26 08:27:11,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 476 flow [2021-03-26 08:27:11,196 INFO L129 PetriNetUnfolder]: 1882/3330 cut-off events. [2021-03-26 08:27:11,196 INFO L130 PetriNetUnfolder]: For 2071/2091 co-relation queries the response was YES. [2021-03-26 08:27:11,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6156 conditions, 3330 events. 1882/3330 cut-off events. For 2071/2091 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 21593 event pairs, 113 based on Foata normal form. 14/2316 useless extension candidates. Maximal degree in co-relation 4729. Up to 680 conditions per place. [2021-03-26 08:27:11,265 INFO L142 LiptonReduction]: Number of co-enabled transitions 1914 [2021-03-26 08:27:11,270 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:11,270 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:11,271 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 264 [2021-03-26 08:27:11,276 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 476 flow [2021-03-26 08:27:11,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 261.25) internal successors, (1045), 4 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:11,277 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:11,278 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:11,278 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 08:27:11,278 INFO L428 AbstractCegarLoop]: === Iteration 5 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:11,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1604078752, now seen corresponding path program 1 times [2021-03-26 08:27:11,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:11,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140534333] [2021-03-26 08:27:11,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:11,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:11,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:11,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:11,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:11,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:11,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:11,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:11,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:11,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140534333] [2021-03-26 08:27:11,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:11,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:27:11,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012314282] [2021-03-26 08:27:11,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 08:27:11,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:11,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 08:27:11,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 08:27:11,345 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-26 08:27:11,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 476 flow. Second operand has 5 states, 5 states have (on average 236.2) internal successors, (1181), 5 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:11,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:11,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-26 08:27:11,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:12,316 INFO L129 PetriNetUnfolder]: 9107/12595 cut-off events. [2021-03-26 08:27:12,316 INFO L130 PetriNetUnfolder]: For 15561/15783 co-relation queries the response was YES. [2021-03-26 08:27:12,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34280 conditions, 12595 events. 9107/12595 cut-off events. For 15561/15783 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 64879 event pairs, 2026 based on Foata normal form. 74/9356 useless extension candidates. Maximal degree in co-relation 27212. Up to 8670 conditions per place. [2021-03-26 08:27:12,418 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 95 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2021-03-26 08:27:12,418 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 827 flow [2021-03-26 08:27:12,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:27:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:27:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1475 transitions. [2021-03-26 08:27:12,422 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7064176245210728 [2021-03-26 08:27:12,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1475 transitions. [2021-03-26 08:27:12,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1475 transitions. [2021-03-26 08:27:12,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:12,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1475 transitions. [2021-03-26 08:27:12,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.83333333333334) internal successors, (1475), 6 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:12,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:12,429 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:12,429 INFO L185 Difference]: Start difference. First operand has 67 places, 101 transitions, 476 flow. Second operand 6 states and 1475 transitions. [2021-03-26 08:27:12,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 827 flow [2021-03-26 08:27:12,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 08:27:12,453 INFO L241 Difference]: Finished difference. Result has 74 places, 102 transitions, 504 flow [2021-03-26 08:27:12,453 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=74, PETRI_TRANSITIONS=102} [2021-03-26 08:27:12,453 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 10 predicate places. [2021-03-26 08:27:12,453 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:12,453 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 102 transitions, 504 flow [2021-03-26 08:27:12,454 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 102 transitions, 504 flow [2021-03-26 08:27:12,454 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 102 transitions, 504 flow [2021-03-26 08:27:12,676 INFO L129 PetriNetUnfolder]: 1910/3387 cut-off events. [2021-03-26 08:27:12,676 INFO L130 PetriNetUnfolder]: For 2203/2227 co-relation queries the response was YES. [2021-03-26 08:27:12,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6332 conditions, 3387 events. 1910/3387 cut-off events. For 2203/2227 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22165 event pairs, 112 based on Foata normal form. 18/2362 useless extension candidates. Maximal degree in co-relation 4319. Up to 714 conditions per place. [2021-03-26 08:27:12,725 INFO L142 LiptonReduction]: Number of co-enabled transitions 1910 [2021-03-26 08:27:12,730 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:12,730 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:12,730 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 277 [2021-03-26 08:27:12,732 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 102 transitions, 504 flow [2021-03-26 08:27:12,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 236.2) internal successors, (1181), 5 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:12,733 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:12,733 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:12,733 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 08:27:12,733 INFO L428 AbstractCegarLoop]: === Iteration 6 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1535794226, now seen corresponding path program 2 times [2021-03-26 08:27:12,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:12,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292215956] [2021-03-26 08:27:12,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:12,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:12,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:12,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:12,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:27:12,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:12,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:12,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:12,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:12,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:12,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:12,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292215956] [2021-03-26 08:27:12,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:12,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:27:12,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200425282] [2021-03-26 08:27:12,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:27:12,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:12,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:27:12,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:27:12,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-26 08:27:12,822 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 102 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:12,822 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:12,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-26 08:27:12,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:13,804 INFO L129 PetriNetUnfolder]: 8856/12256 cut-off events. [2021-03-26 08:27:13,804 INFO L130 PetriNetUnfolder]: For 16838/17054 co-relation queries the response was YES. [2021-03-26 08:27:13,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34028 conditions, 12256 events. 8856/12256 cut-off events. For 16838/17054 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 62749 event pairs, 2030 based on Foata normal form. 150/9224 useless extension candidates. Maximal degree in co-relation 25751. Up to 5431 conditions per place. [2021-03-26 08:27:13,890 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 90 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2021-03-26 08:27:13,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 139 transitions, 864 flow [2021-03-26 08:27:13,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:27:13,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:27:13,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1613 transitions. [2021-03-26 08:27:13,894 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.579382183908046 [2021-03-26 08:27:13,894 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1613 transitions. [2021-03-26 08:27:13,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1613 transitions. [2021-03-26 08:27:13,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:13,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1613 transitions. [2021-03-26 08:27:13,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.625) internal successors, (1613), 8 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:13,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:13,902 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:13,903 INFO L185 Difference]: Start difference. First operand has 74 places, 102 transitions, 504 flow. Second operand 8 states and 1613 transitions. [2021-03-26 08:27:13,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 139 transitions, 864 flow [2021-03-26 08:27:13,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 852 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 08:27:13,921 INFO L241 Difference]: Finished difference. Result has 79 places, 103 transitions, 549 flow [2021-03-26 08:27:13,921 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=549, PETRI_PLACES=79, PETRI_TRANSITIONS=103} [2021-03-26 08:27:13,922 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2021-03-26 08:27:13,922 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:13,922 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 103 transitions, 549 flow [2021-03-26 08:27:13,922 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 103 transitions, 549 flow [2021-03-26 08:27:13,924 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 103 transitions, 549 flow [2021-03-26 08:27:14,108 INFO L129 PetriNetUnfolder]: 1786/3207 cut-off events. [2021-03-26 08:27:14,108 INFO L130 PetriNetUnfolder]: For 2415/2435 co-relation queries the response was YES. [2021-03-26 08:27:14,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6261 conditions, 3207 events. 1786/3207 cut-off events. For 2415/2435 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 21125 event pairs, 113 based on Foata normal form. 14/2239 useless extension candidates. Maximal degree in co-relation 4243. Up to 680 conditions per place. [2021-03-26 08:27:14,149 INFO L142 LiptonReduction]: Number of co-enabled transitions 1902 [2021-03-26 08:27:14,154 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:14,154 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:14,154 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 232 [2021-03-26 08:27:14,155 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 103 transitions, 549 flow [2021-03-26 08:27:14,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:14,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:14,156 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:14,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 08:27:14,156 INFO L428 AbstractCegarLoop]: === Iteration 7 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1516767050, now seen corresponding path program 3 times [2021-03-26 08:27:14,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:14,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27734081] [2021-03-26 08:27:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:14,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:14,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:14,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:14,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:27:14,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:14,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:14,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:14,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:14,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:14,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:14,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:14,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:14,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:14,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27734081] [2021-03-26 08:27:14,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:14,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 08:27:14,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598859300] [2021-03-26 08:27:14,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 08:27:14,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:14,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 08:27:14,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 08:27:14,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 348 [2021-03-26 08:27:14,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 103 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 237.57142857142858) internal successors, (1663), 7 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:14,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:14,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 348 [2021-03-26 08:27:14,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:14,839 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][51], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 245#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 249#true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-26 08:27:14,839 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,839 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,839 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,839 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,855 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 199#(= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 245#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), 249#true, 125#L1164-2true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-26 08:27:14,855 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,855 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,855 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,855 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:14,875 INFO L129 PetriNetUnfolder]: 5329/8061 cut-off events. [2021-03-26 08:27:14,875 INFO L130 PetriNetUnfolder]: For 15980/16324 co-relation queries the response was YES. [2021-03-26 08:27:14,903 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24474 conditions, 8061 events. 5329/8061 cut-off events. For 15980/16324 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 47262 event pairs, 475 based on Foata normal form. 240/6583 useless extension candidates. Maximal degree in co-relation 17998. Up to 2472 conditions per place. [2021-03-26 08:27:14,938 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 56 selfloop transitions, 34 changer transitions 10/152 dead transitions. [2021-03-26 08:27:14,938 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 152 transitions, 1040 flow [2021-03-26 08:27:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:27:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:27:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2196 transitions. [2021-03-26 08:27:14,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2021-03-26 08:27:14,943 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2196 transitions. [2021-03-26 08:27:14,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2196 transitions. [2021-03-26 08:27:14,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:14,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2196 transitions. [2021-03-26 08:27:14,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 244.0) internal successors, (2196), 9 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:14,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:14,954 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:14,954 INFO L185 Difference]: Start difference. First operand has 79 places, 103 transitions, 549 flow. Second operand 9 states and 2196 transitions. [2021-03-26 08:27:14,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 152 transitions, 1040 flow [2021-03-26 08:27:14,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 995 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-03-26 08:27:14,972 INFO L241 Difference]: Finished difference. Result has 83 places, 115 transitions, 726 flow [2021-03-26 08:27:14,972 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=726, PETRI_PLACES=83, PETRI_TRANSITIONS=115} [2021-03-26 08:27:14,972 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 19 predicate places. [2021-03-26 08:27:14,972 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:14,972 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 115 transitions, 726 flow [2021-03-26 08:27:14,972 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 115 transitions, 726 flow [2021-03-26 08:27:14,973 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 115 transitions, 726 flow [2021-03-26 08:27:15,157 INFO L129 PetriNetUnfolder]: 1947/3603 cut-off events. [2021-03-26 08:27:15,157 INFO L130 PetriNetUnfolder]: For 4715/4757 co-relation queries the response was YES. [2021-03-26 08:27:15,170 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7842 conditions, 3603 events. 1947/3603 cut-off events. For 4715/4757 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 25044 event pairs, 74 based on Foata normal form. 18/2540 useless extension candidates. Maximal degree in co-relation 5743. Up to 776 conditions per place. [2021-03-26 08:27:15,197 INFO L142 LiptonReduction]: Number of co-enabled transitions 2076 [2021-03-26 08:27:15,203 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:15,203 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:15,203 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 231 [2021-03-26 08:27:15,204 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 115 transitions, 726 flow [2021-03-26 08:27:15,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 237.57142857142858) internal successors, (1663), 7 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:15,205 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:15,205 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:15,205 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 08:27:15,205 INFO L428 AbstractCegarLoop]: === Iteration 8 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:15,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:15,205 INFO L82 PathProgramCache]: Analyzing trace with hash -739810455, now seen corresponding path program 1 times [2021-03-26 08:27:15,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:15,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636911394] [2021-03-26 08:27:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:15,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:15,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:15,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:15,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:15,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636911394] [2021-03-26 08:27:15,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:15,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 08:27:15,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805519397] [2021-03-26 08:27:15,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 08:27:15,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:15,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 08:27:15,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 08:27:15,227 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 348 [2021-03-26 08:27:15,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 115 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:15,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:15,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 348 [2021-03-26 08:27:15,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:15,771 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][32], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 226#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 125#L1164-2true, Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), 287#true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-26 08:27:15,771 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,772 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,772 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,772 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,772 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][56], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 226#true, Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 125#L1164-2true, Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-26 08:27:15,773 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,773 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,773 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,773 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:15,780 INFO L129 PetriNetUnfolder]: 6059/9083 cut-off events. [2021-03-26 08:27:15,780 INFO L130 PetriNetUnfolder]: For 34721/35262 co-relation queries the response was YES. [2021-03-26 08:27:15,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30870 conditions, 9083 events. 6059/9083 cut-off events. For 34721/35262 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 52876 event pairs, 752 based on Foata normal form. 84/7080 useless extension candidates. Maximal degree in co-relation 24444. Up to 4318 conditions per place. [2021-03-26 08:27:15,846 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 67 selfloop transitions, 16 changer transitions 1/137 dead transitions. [2021-03-26 08:27:15,847 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 1067 flow [2021-03-26 08:27:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 08:27:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 08:27:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2021-03-26 08:27:15,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8132183908045977 [2021-03-26 08:27:15,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2021-03-26 08:27:15,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2021-03-26 08:27:15,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:15,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2021-03-26 08:27:15,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:15,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:15,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:15,853 INFO L185 Difference]: Start difference. First operand has 81 places, 115 transitions, 726 flow. Second operand 3 states and 849 transitions. [2021-03-26 08:27:15,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 1067 flow [2021-03-26 08:27:15,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 137 transitions, 1061 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 08:27:15,904 INFO L241 Difference]: Finished difference. Result has 82 places, 124 transitions, 880 flow [2021-03-26 08:27:15,905 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=82, PETRI_TRANSITIONS=124} [2021-03-26 08:27:15,905 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2021-03-26 08:27:15,905 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:15,905 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 124 transitions, 880 flow [2021-03-26 08:27:15,905 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 124 transitions, 880 flow [2021-03-26 08:27:15,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 124 transitions, 880 flow [2021-03-26 08:27:16,120 INFO L129 PetriNetUnfolder]: 2136/3904 cut-off events. [2021-03-26 08:27:16,120 INFO L130 PetriNetUnfolder]: For 7108/7218 co-relation queries the response was YES. [2021-03-26 08:27:16,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 3904 events. 2136/3904 cut-off events. For 7108/7218 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27562 event pairs, 66 based on Foata normal form. 30/2840 useless extension candidates. Maximal degree in co-relation 6775. Up to 832 conditions per place. [2021-03-26 08:27:16,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 2306 [2021-03-26 08:27:16,179 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:16,179 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:16,179 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 274 [2021-03-26 08:27:16,180 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 124 transitions, 880 flow [2021-03-26 08:27:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 275.3333333333333) internal successors, (826), 3 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:16,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:16,180 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:16,180 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 08:27:16,180 INFO L428 AbstractCegarLoop]: === Iteration 9 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:16,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1459289047, now seen corresponding path program 1 times [2021-03-26 08:27:16,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:16,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84121659] [2021-03-26 08:27:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:16,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:16,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:16,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:16,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:27:16,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:16,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:16,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:16,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:16,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:16,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:16,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84121659] [2021-03-26 08:27:16,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:16,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:27:16,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653339062] [2021-03-26 08:27:16,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:27:16,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:16,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:27:16,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:27:16,231 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-26 08:27:16,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 124 transitions, 880 flow. Second operand has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:16,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:16,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-26 08:27:16,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:17,159 INFO L129 PetriNetUnfolder]: 8862/12412 cut-off events. [2021-03-26 08:27:17,159 INFO L130 PetriNetUnfolder]: For 50299/51113 co-relation queries the response was YES. [2021-03-26 08:27:17,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44959 conditions, 12412 events. 8862/12412 cut-off events. For 50299/51113 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 66345 event pairs, 1911 based on Foata normal form. 281/9913 useless extension candidates. Maximal degree in co-relation 36825. Up to 6340 conditions per place. [2021-03-26 08:27:17,325 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 104 selfloop transitions, 16 changer transitions 18/166 dead transitions. [2021-03-26 08:27:17,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 166 transitions, 1413 flow [2021-03-26 08:27:17,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:27:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:27:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1610 transitions. [2021-03-26 08:27:17,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5783045977011494 [2021-03-26 08:27:17,329 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1610 transitions. [2021-03-26 08:27:17,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1610 transitions. [2021-03-26 08:27:17,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:17,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1610 transitions. [2021-03-26 08:27:17,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.25) internal successors, (1610), 8 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:17,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:17,338 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:17,338 INFO L185 Difference]: Start difference. First operand has 82 places, 124 transitions, 880 flow. Second operand 8 states and 1610 transitions. [2021-03-26 08:27:17,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 166 transitions, 1413 flow [2021-03-26 08:27:17,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 166 transitions, 1389 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 08:27:17,428 INFO L241 Difference]: Finished difference. Result has 90 places, 113 transitions, 852 flow [2021-03-26 08:27:17,428 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=852, PETRI_PLACES=90, PETRI_TRANSITIONS=113} [2021-03-26 08:27:17,429 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 26 predicate places. [2021-03-26 08:27:17,429 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:17,429 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 113 transitions, 852 flow [2021-03-26 08:27:17,429 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 113 transitions, 852 flow [2021-03-26 08:27:17,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 113 transitions, 852 flow [2021-03-26 08:27:17,605 INFO L129 PetriNetUnfolder]: 2030/3789 cut-off events. [2021-03-26 08:27:17,605 INFO L130 PetriNetUnfolder]: For 6954/7347 co-relation queries the response was YES. [2021-03-26 08:27:17,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8919 conditions, 3789 events. 2030/3789 cut-off events. For 6954/7347 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 27227 event pairs, 62 based on Foata normal form. 40/2762 useless extension candidates. Maximal degree in co-relation 6574. Up to 884 conditions per place. [2021-03-26 08:27:17,652 INFO L142 LiptonReduction]: Number of co-enabled transitions 2216 [2021-03-26 08:27:17,658 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:17,658 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:17,658 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 229 [2021-03-26 08:27:17,659 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 852 flow [2021-03-26 08:27:17,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.33333333333334) internal successors, (1166), 6 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:17,659 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:17,659 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:17,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 08:27:17,659 INFO L428 AbstractCegarLoop]: === Iteration 10 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1370679130, now seen corresponding path program 1 times [2021-03-26 08:27:17,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:17,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977059117] [2021-03-26 08:27:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:17,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:17,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:17,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:17,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:27:17,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:17,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:17,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:17,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:17,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:17,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:17,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:17,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:17,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977059117] [2021-03-26 08:27:17,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:17,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 08:27:17,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616659679] [2021-03-26 08:27:17,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 08:27:17,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:17,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 08:27:17,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 08:27:17,710 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-26 08:27:17,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 852 flow. Second operand has 7 states, 7 states have (on average 236.71428571428572) internal successors, (1657), 7 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:17,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:17,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-26 08:27:17,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:18,446 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][53], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 226#true, 292#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-26 08:27:18,446 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,446 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,447 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,447 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,452 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 292#true, 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 125#L1164-2true, Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1))]) [2021-03-26 08:27:18,452 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,452 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,452 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,452 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:18,454 INFO L129 PetriNetUnfolder]: 5708/8764 cut-off events. [2021-03-26 08:27:18,454 INFO L130 PetriNetUnfolder]: For 40617/41301 co-relation queries the response was YES. [2021-03-26 08:27:18,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32716 conditions, 8764 events. 5708/8764 cut-off events. For 40617/41301 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 54052 event pairs, 379 based on Foata normal form. 357/7528 useless extension candidates. Maximal degree in co-relation 25553. Up to 2921 conditions per place. [2021-03-26 08:27:18,510 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 64 selfloop transitions, 46 changer transitions 2/156 dead transitions. [2021-03-26 08:27:18,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 156 transitions, 1398 flow [2021-03-26 08:27:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:27:18,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:27:18,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1709 transitions. [2021-03-26 08:27:18,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.701559934318555 [2021-03-26 08:27:18,514 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1709 transitions. [2021-03-26 08:27:18,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1709 transitions. [2021-03-26 08:27:18,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:18,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1709 transitions. [2021-03-26 08:27:18,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 244.14285714285714) internal successors, (1709), 7 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:18,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:18,521 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:18,521 INFO L185 Difference]: Start difference. First operand has 88 places, 113 transitions, 852 flow. Second operand 7 states and 1709 transitions. [2021-03-26 08:27:18,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 156 transitions, 1398 flow [2021-03-26 08:27:18,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 156 transitions, 1366 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-26 08:27:18,572 INFO L241 Difference]: Finished difference. Result has 92 places, 129 transitions, 1193 flow [2021-03-26 08:27:18,572 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1193, PETRI_PLACES=92, PETRI_TRANSITIONS=129} [2021-03-26 08:27:18,572 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 28 predicate places. [2021-03-26 08:27:18,572 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:18,572 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 129 transitions, 1193 flow [2021-03-26 08:27:18,572 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 129 transitions, 1193 flow [2021-03-26 08:27:18,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 129 transitions, 1193 flow [2021-03-26 08:27:18,829 INFO L129 PetriNetUnfolder]: 2221/4150 cut-off events. [2021-03-26 08:27:18,829 INFO L130 PetriNetUnfolder]: For 14244/15019 co-relation queries the response was YES. [2021-03-26 08:27:18,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11727 conditions, 4150 events. 2221/4150 cut-off events. For 14244/15019 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 30104 event pairs, 64 based on Foata normal form. 76/3082 useless extension candidates. Maximal degree in co-relation 8675. Up to 960 conditions per place. [2021-03-26 08:27:18,875 INFO L142 LiptonReduction]: Number of co-enabled transitions 2482 [2021-03-26 08:27:18,882 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:18,883 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:18,883 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 311 [2021-03-26 08:27:18,883 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 129 transitions, 1193 flow [2021-03-26 08:27:18,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 236.71428571428572) internal successors, (1657), 7 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:18,884 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:18,884 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:18,884 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 08:27:18,884 INFO L428 AbstractCegarLoop]: === Iteration 11 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:18,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:18,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1940270885, now seen corresponding path program 1 times [2021-03-26 08:27:18,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:18,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072916660] [2021-03-26 08:27:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:18,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:18,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:18,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:18,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-26 08:27:18,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:18,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:18,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:18,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:18,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:18,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:18,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072916660] [2021-03-26 08:27:18,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:18,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:27:18,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414370994] [2021-03-26 08:27:18,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:27:18,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:18,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:27:18,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:27:18,930 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 348 [2021-03-26 08:27:18,931 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 129 transitions, 1193 flow. Second operand has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:18,931 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:18,931 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 348 [2021-03-26 08:27:18,931 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:19,611 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][34], [321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 226#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true]) [2021-03-26 08:27:19,611 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,611 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,611 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,611 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,612 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][55], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 125#L1164-2true]) [2021-03-26 08:27:19,612 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,612 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,612 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,612 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:19,618 INFO L129 PetriNetUnfolder]: 5711/8738 cut-off events. [2021-03-26 08:27:19,618 INFO L130 PetriNetUnfolder]: For 64111/65081 co-relation queries the response was YES. [2021-03-26 08:27:19,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37887 conditions, 8738 events. 5711/8738 cut-off events. For 64111/65081 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 53151 event pairs, 621 based on Foata normal form. 304/7394 useless extension candidates. Maximal degree in co-relation 29141. Up to 4322 conditions per place. [2021-03-26 08:27:19,677 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 80 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2021-03-26 08:27:19,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 148 transitions, 1579 flow [2021-03-26 08:27:19,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 08:27:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 08:27:19,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1272 transitions. [2021-03-26 08:27:19,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7310344827586207 [2021-03-26 08:27:19,680 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1272 transitions. [2021-03-26 08:27:19,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1272 transitions. [2021-03-26 08:27:19,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:19,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1272 transitions. [2021-03-26 08:27:19,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.4) internal successors, (1272), 5 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:19,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:19,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:19,685 INFO L185 Difference]: Start difference. First operand has 92 places, 129 transitions, 1193 flow. Second operand 5 states and 1272 transitions. [2021-03-26 08:27:19,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 148 transitions, 1579 flow [2021-03-26 08:27:19,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 148 transitions, 1574 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 08:27:19,738 INFO L241 Difference]: Finished difference. Result has 95 places, 133 transitions, 1325 flow [2021-03-26 08:27:19,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1325, PETRI_PLACES=95, PETRI_TRANSITIONS=133} [2021-03-26 08:27:19,739 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 31 predicate places. [2021-03-26 08:27:19,739 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:19,739 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 133 transitions, 1325 flow [2021-03-26 08:27:19,739 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 133 transitions, 1325 flow [2021-03-26 08:27:19,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 133 transitions, 1325 flow [2021-03-26 08:27:19,970 INFO L129 PetriNetUnfolder]: 2182/4096 cut-off events. [2021-03-26 08:27:19,970 INFO L130 PetriNetUnfolder]: For 14632/14924 co-relation queries the response was YES. [2021-03-26 08:27:19,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12361 conditions, 4096 events. 2182/4096 cut-off events. For 14632/14924 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29823 event pairs, 52 based on Foata normal form. 62/3039 useless extension candidates. Maximal degree in co-relation 9243. Up to 932 conditions per place. [2021-03-26 08:27:20,017 INFO L142 LiptonReduction]: Number of co-enabled transitions 2512 [2021-03-26 08:27:20,022 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:20,022 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:20,022 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 283 [2021-03-26 08:27:20,022 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1325 flow [2021-03-26 08:27:20,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:20,023 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:20,023 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:20,023 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 08:27:20,023 INFO L428 AbstractCegarLoop]: === Iteration 12 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:20,024 INFO L82 PathProgramCache]: Analyzing trace with hash -414745382, now seen corresponding path program 2 times [2021-03-26 08:27:20,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:20,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744067990] [2021-03-26 08:27:20,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:20,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:20,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:20,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:20,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 08:27:20,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:20,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:27:20,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:20,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:27:20,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:20,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:20,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:20,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:20,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:20,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:20,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:20,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744067990] [2021-03-26 08:27:20,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:20,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 08:27:20,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755105741] [2021-03-26 08:27:20,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 08:27:20,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:20,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 08:27:20,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 08:27:20,093 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 348 [2021-03-26 08:27:20,094 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 133 transitions, 1325 flow. Second operand has 8 states, 8 states have (on average 233.5) internal successors, (1868), 8 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:20,094 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:20,094 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 348 [2021-03-26 08:27:20,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:20,930 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][56], [Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 226#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 42#L1156-1true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-26 08:27:20,930 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,930 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,930 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,930 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,939 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][35], [321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 336#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 278#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 280#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21|), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 354#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 226#true, 42#L1156-1true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true]) [2021-03-26 08:27:20,939 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,939 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,939 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,939 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:20,942 INFO L129 PetriNetUnfolder]: 5948/9107 cut-off events. [2021-03-26 08:27:20,942 INFO L130 PetriNetUnfolder]: For 80833/81720 co-relation queries the response was YES. [2021-03-26 08:27:20,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41288 conditions, 9107 events. 5948/9107 cut-off events. For 80833/81720 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 55247 event pairs, 425 based on Foata normal form. 286/7625 useless extension candidates. Maximal degree in co-relation 31628. Up to 2829 conditions per place. [2021-03-26 08:27:21,022 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 65 selfloop transitions, 66 changer transitions 2/177 dead transitions. [2021-03-26 08:27:21,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 177 transitions, 2051 flow [2021-03-26 08:27:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:27:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:27:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1688 transitions. [2021-03-26 08:27:21,026 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6929392446633826 [2021-03-26 08:27:21,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1688 transitions. [2021-03-26 08:27:21,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1688 transitions. [2021-03-26 08:27:21,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:21,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1688 transitions. [2021-03-26 08:27:21,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 241.14285714285714) internal successors, (1688), 7 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:21,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:21,032 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:21,032 INFO L185 Difference]: Start difference. First operand has 95 places, 133 transitions, 1325 flow. Second operand 7 states and 1688 transitions. [2021-03-26 08:27:21,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 177 transitions, 2051 flow [2021-03-26 08:27:21,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 177 transitions, 2016 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 08:27:21,132 INFO L241 Difference]: Finished difference. Result has 102 places, 151 transitions, 1856 flow [2021-03-26 08:27:21,132 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1856, PETRI_PLACES=102, PETRI_TRANSITIONS=151} [2021-03-26 08:27:21,132 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 38 predicate places. [2021-03-26 08:27:21,132 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:21,133 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 151 transitions, 1856 flow [2021-03-26 08:27:21,133 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 151 transitions, 1856 flow [2021-03-26 08:27:21,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 151 transitions, 1856 flow [2021-03-26 08:27:21,425 INFO L129 PetriNetUnfolder]: 2215/4146 cut-off events. [2021-03-26 08:27:21,426 INFO L130 PetriNetUnfolder]: For 23389/23894 co-relation queries the response was YES. [2021-03-26 08:27:21,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14178 conditions, 4146 events. 2215/4146 cut-off events. For 23389/23894 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 30164 event pairs, 47 based on Foata normal form. 144/3132 useless extension candidates. Maximal degree in co-relation 9811. Up to 948 conditions per place. [2021-03-26 08:27:21,488 INFO L142 LiptonReduction]: Number of co-enabled transitions 2734 [2021-03-26 08:27:21,494 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:21,494 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:21,494 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 362 [2021-03-26 08:27:21,495 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 151 transitions, 1856 flow [2021-03-26 08:27:21,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 233.5) internal successors, (1868), 8 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:21,496 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:21,496 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:21,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 08:27:21,496 INFO L428 AbstractCegarLoop]: === Iteration 13 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1940269459, now seen corresponding path program 1 times [2021-03-26 08:27:21,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:21,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665626123] [2021-03-26 08:27:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:21,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 08:27:21,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 08:27:21,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-26 08:27:21,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:27:21,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:27:21,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:27:21,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:27:21,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-26 08:27:21,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:21,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:21,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:21,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665626123] [2021-03-26 08:27:21,689 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:21,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-26 08:27:21,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050645315] [2021-03-26 08:27:21,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 08:27:21,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:21,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 08:27:21,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-26 08:27:21,692 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-26 08:27:21,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 151 transitions, 1856 flow. Second operand has 11 states, 11 states have (on average 189.27272727272728) internal successors, (2082), 11 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:21,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:21,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-26 08:27:21,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:23,442 INFO L129 PetriNetUnfolder]: 10702/15056 cut-off events. [2021-03-26 08:27:23,443 INFO L130 PetriNetUnfolder]: For 179343/180230 co-relation queries the response was YES. [2021-03-26 08:27:23,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74078 conditions, 15056 events. 10702/15056 cut-off events. For 179343/180230 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 83867 event pairs, 1928 based on Foata normal form. 94/11776 useless extension candidates. Maximal degree in co-relation 60344. Up to 10784 conditions per place. [2021-03-26 08:27:23,535 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 173 selfloop transitions, 42 changer transitions 3/246 dead transitions. [2021-03-26 08:27:23,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 246 transitions, 3502 flow [2021-03-26 08:27:23,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 08:27:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 08:27:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2173 transitions. [2021-03-26 08:27:23,540 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5676593521421107 [2021-03-26 08:27:23,540 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2173 transitions. [2021-03-26 08:27:23,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2173 transitions. [2021-03-26 08:27:23,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:23,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2173 transitions. [2021-03-26 08:27:23,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 197.54545454545453) internal successors, (2173), 11 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:23,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:23,549 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:23,549 INFO L185 Difference]: Start difference. First operand has 102 places, 151 transitions, 1856 flow. Second operand 11 states and 2173 transitions. [2021-03-26 08:27:23,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 246 transitions, 3502 flow [2021-03-26 08:27:23,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 246 transitions, 3497 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 08:27:23,696 INFO L241 Difference]: Finished difference. Result has 116 places, 186 transitions, 2570 flow [2021-03-26 08:27:23,696 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1851, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2570, PETRI_PLACES=116, PETRI_TRANSITIONS=186} [2021-03-26 08:27:23,697 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 52 predicate places. [2021-03-26 08:27:23,697 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:23,697 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 186 transitions, 2570 flow [2021-03-26 08:27:23,697 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 186 transitions, 2570 flow [2021-03-26 08:27:23,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 186 transitions, 2570 flow [2021-03-26 08:27:24,004 INFO L129 PetriNetUnfolder]: 2704/5029 cut-off events. [2021-03-26 08:27:24,004 INFO L130 PetriNetUnfolder]: For 31755/32358 co-relation queries the response was YES. [2021-03-26 08:27:24,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17908 conditions, 5029 events. 2704/5029 cut-off events. For 31755/32358 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 37566 event pairs, 55 based on Foata normal form. 124/3719 useless extension candidates. Maximal degree in co-relation 13546. Up to 1140 conditions per place. [2021-03-26 08:27:24,076 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-26 08:27:24,085 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:24,085 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:24,085 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 388 [2021-03-26 08:27:24,086 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 186 transitions, 2570 flow [2021-03-26 08:27:24,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 189.27272727272728) internal successors, (2082), 11 states have internal predecessors, (2082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:24,086 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:24,086 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:24,086 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 08:27:24,087 INFO L428 AbstractCegarLoop]: === Iteration 14 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2068052205, now seen corresponding path program 2 times [2021-03-26 08:27:24,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:24,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25075865] [2021-03-26 08:27:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:24,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:24,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:27:24,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:27:24,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:24,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:24,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:24,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:24,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:24,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:24,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25075865] [2021-03-26 08:27:24,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:24,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:27:24,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869604213] [2021-03-26 08:27:24,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:27:24,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:24,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:27:24,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:27:24,169 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-26 08:27:24,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 186 transitions, 2570 flow. Second operand has 9 states, 9 states have (on average 191.55555555555554) internal successors, (1724), 9 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:24,170 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:24,170 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-26 08:27:24,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:25,998 INFO L129 PetriNetUnfolder]: 13896/19275 cut-off events. [2021-03-26 08:27:25,998 INFO L130 PetriNetUnfolder]: For 258894/259968 co-relation queries the response was YES. [2021-03-26 08:27:26,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 97376 conditions, 19275 events. 13896/19275 cut-off events. For 258894/259968 co-relation queries the response was YES. Maximal size of possible extension queue 886. Compared 107499 event pairs, 2645 based on Foata normal form. 96/14857 useless extension candidates. Maximal degree in co-relation 82894. Up to 8682 conditions per place. [2021-03-26 08:27:26,160 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 164 selfloop transitions, 34 changer transitions 66/292 dead transitions. [2021-03-26 08:27:26,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 292 transitions, 4478 flow [2021-03-26 08:27:26,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:27:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:27:26,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1815 transitions. [2021-03-26 08:27:26,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5795019157088123 [2021-03-26 08:27:26,164 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1815 transitions. [2021-03-26 08:27:26,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1815 transitions. [2021-03-26 08:27:26,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:26,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1815 transitions. [2021-03-26 08:27:26,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 201.66666666666666) internal successors, (1815), 9 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:26,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:26,171 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:26,171 INFO L185 Difference]: Start difference. First operand has 116 places, 186 transitions, 2570 flow. Second operand 9 states and 1815 transitions. [2021-03-26 08:27:26,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 292 transitions, 4478 flow [2021-03-26 08:27:26,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 292 transitions, 4299 flow, removed 88 selfloop flow, removed 1 redundant places. [2021-03-26 08:27:26,407 INFO L241 Difference]: Finished difference. Result has 127 places, 146 transitions, 1817 flow [2021-03-26 08:27:26,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2459, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1817, PETRI_PLACES=127, PETRI_TRANSITIONS=146} [2021-03-26 08:27:26,407 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2021-03-26 08:27:26,408 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:26,408 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 146 transitions, 1817 flow [2021-03-26 08:27:26,408 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 146 transitions, 1817 flow [2021-03-26 08:27:26,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 146 transitions, 1817 flow [2021-03-26 08:27:26,747 INFO L129 PetriNetUnfolder]: 2963/5511 cut-off events. [2021-03-26 08:27:26,747 INFO L130 PetriNetUnfolder]: For 35743/36357 co-relation queries the response was YES. [2021-03-26 08:27:26,782 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19165 conditions, 5511 events. 2963/5511 cut-off events. For 35743/36357 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 41793 event pairs, 52 based on Foata normal form. 95/3974 useless extension candidates. Maximal degree in co-relation 16429. Up to 1256 conditions per place. [2021-03-26 08:27:26,833 INFO L142 LiptonReduction]: Number of co-enabled transitions 2534 [2021-03-26 08:27:26,838 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:26,839 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:26,839 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 431 [2021-03-26 08:27:26,839 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 146 transitions, 1817 flow [2021-03-26 08:27:26,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.55555555555554) internal successors, (1724), 9 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:26,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:26,839 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:26,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 08:27:26,840 INFO L428 AbstractCegarLoop]: === Iteration 15 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:26,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:26,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1101121893, now seen corresponding path program 1 times [2021-03-26 08:27:26,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:26,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658596341] [2021-03-26 08:27:26,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:26,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 08:27:26,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:27:26,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:27:26,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:27:26,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:27:26,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:27:26,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:27:26,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:26,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:26,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:26,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:26,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658596341] [2021-03-26 08:27:26,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:26,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:27:26,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454438240] [2021-03-26 08:27:26,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:27:26,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:26,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:27:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:27:27,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-26 08:27:27,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 146 transitions, 1817 flow. Second operand has 10 states, 10 states have (on average 190.5) internal successors, (1905), 10 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:27,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:27,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-26 08:27:27,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:28,898 INFO L129 PetriNetUnfolder]: 14848/20634 cut-off events. [2021-03-26 08:27:28,899 INFO L130 PetriNetUnfolder]: For 271659/271696 co-relation queries the response was YES. [2021-03-26 08:27:29,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101587 conditions, 20634 events. 14848/20634 cut-off events. For 271659/271696 co-relation queries the response was YES. Maximal size of possible extension queue 950. Compared 115886 event pairs, 3110 based on Foata normal form. 88/15751 useless extension candidates. Maximal degree in co-relation 92109. Up to 15017 conditions per place. [2021-03-26 08:27:29,124 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 123 selfloop transitions, 32 changer transitions 3/186 dead transitions. [2021-03-26 08:27:29,124 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 2646 flow [2021-03-26 08:27:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:27:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:27:29,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1780 transitions. [2021-03-26 08:27:29,128 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5683269476372924 [2021-03-26 08:27:29,128 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1780 transitions. [2021-03-26 08:27:29,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1780 transitions. [2021-03-26 08:27:29,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:29,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1780 transitions. [2021-03-26 08:27:29,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 197.77777777777777) internal successors, (1780), 9 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:29,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:29,134 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:29,134 INFO L185 Difference]: Start difference. First operand has 127 places, 146 transitions, 1817 flow. Second operand 9 states and 1780 transitions. [2021-03-26 08:27:29,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 2646 flow [2021-03-26 08:27:29,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 2473 flow, removed 34 selfloop flow, removed 10 redundant places. [2021-03-26 08:27:29,442 INFO L241 Difference]: Finished difference. Result has 128 places, 157 transitions, 2001 flow [2021-03-26 08:27:29,442 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2001, PETRI_PLACES=128, PETRI_TRANSITIONS=157} [2021-03-26 08:27:29,442 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 64 predicate places. [2021-03-26 08:27:29,442 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:29,442 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 157 transitions, 2001 flow [2021-03-26 08:27:29,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 157 transitions, 2001 flow [2021-03-26 08:27:29,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 157 transitions, 2001 flow [2021-03-26 08:27:30,004 INFO L129 PetriNetUnfolder]: 3311/6092 cut-off events. [2021-03-26 08:27:30,005 INFO L130 PetriNetUnfolder]: For 33986/34356 co-relation queries the response was YES. [2021-03-26 08:27:30,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 6092 events. 3311/6092 cut-off events. For 33986/34356 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 46454 event pairs, 53 based on Foata normal form. 97/4368 useless extension candidates. Maximal degree in co-relation 17124. Up to 1408 conditions per place. [2021-03-26 08:27:30,095 INFO L142 LiptonReduction]: Number of co-enabled transitions 2660 [2021-03-26 08:27:30,100 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:30,100 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:30,100 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 658 [2021-03-26 08:27:30,100 INFO L480 AbstractCegarLoop]: Abstraction has has 128 places, 157 transitions, 2001 flow [2021-03-26 08:27:30,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.5) internal successors, (1905), 10 states have internal predecessors, (1905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:30,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:30,101 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:30,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 08:27:30,101 INFO L428 AbstractCegarLoop]: === Iteration 16 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash 505804647, now seen corresponding path program 2 times [2021-03-26 08:27:30,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:30,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207612369] [2021-03-26 08:27:30,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:30,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:27:30,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 08:27:30,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 08:27:30,406 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2021-03-26 08:27:30,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:27:30,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:27:30,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:27:30,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,474 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 08:27:30,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:27:30,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:27:30,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:30,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:30,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:30,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207612369] [2021-03-26 08:27:30,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:30,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 08:27:30,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900508358] [2021-03-26 08:27:30,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 08:27:30,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 08:27:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-03-26 08:27:30,520 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-26 08:27:30,521 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 157 transitions, 2001 flow. Second operand has 12 states, 12 states have (on average 187.25) internal successors, (2247), 12 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:30,521 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:30,521 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-26 08:27:30,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:33,021 INFO L129 PetriNetUnfolder]: 16084/22173 cut-off events. [2021-03-26 08:27:33,021 INFO L130 PetriNetUnfolder]: For 277670/278352 co-relation queries the response was YES. [2021-03-26 08:27:33,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108418 conditions, 22173 events. 16084/22173 cut-off events. For 277670/278352 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 123751 event pairs, 2373 based on Foata normal form. 87/16835 useless extension candidates. Maximal degree in co-relation 98605. Up to 11711 conditions per place. [2021-03-26 08:27:33,223 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 177 selfloop transitions, 53 changer transitions 4/262 dead transitions. [2021-03-26 08:27:33,224 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 262 transitions, 3980 flow [2021-03-26 08:27:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:27:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:27:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1582 transitions. [2021-03-26 08:27:33,226 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5682471264367817 [2021-03-26 08:27:33,226 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1582 transitions. [2021-03-26 08:27:33,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1582 transitions. [2021-03-26 08:27:33,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:33,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1582 transitions. [2021-03-26 08:27:33,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 197.75) internal successors, (1582), 8 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:33,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:33,230 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:33,230 INFO L185 Difference]: Start difference. First operand has 128 places, 157 transitions, 2001 flow. Second operand 8 states and 1582 transitions. [2021-03-26 08:27:33,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 262 transitions, 3980 flow [2021-03-26 08:27:33,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 262 transitions, 3754 flow, removed 89 selfloop flow, removed 5 redundant places. [2021-03-26 08:27:33,573 INFO L241 Difference]: Finished difference. Result has 133 places, 182 transitions, 2469 flow [2021-03-26 08:27:33,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2469, PETRI_PLACES=133, PETRI_TRANSITIONS=182} [2021-03-26 08:27:33,574 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2021-03-26 08:27:33,574 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:33,574 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 182 transitions, 2469 flow [2021-03-26 08:27:33,574 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 182 transitions, 2469 flow [2021-03-26 08:27:33,575 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 182 transitions, 2469 flow [2021-03-26 08:27:33,771 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][16], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 33#thread2EXITtrue, Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 121#L1152-1true]) [2021-03-26 08:27:33,772 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:27:33,772 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:27:33,772 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:27:33,772 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:27:34,080 INFO L129 PetriNetUnfolder]: 3638/6661 cut-off events. [2021-03-26 08:27:34,080 INFO L130 PetriNetUnfolder]: For 42093/42457 co-relation queries the response was YES. [2021-03-26 08:27:34,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22244 conditions, 6661 events. 3638/6661 cut-off events. For 42093/42457 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 51284 event pairs, 53 based on Foata normal form. 138/4749 useless extension candidates. Maximal degree in co-relation 19845. Up to 1588 conditions per place. [2021-03-26 08:27:34,169 INFO L142 LiptonReduction]: Number of co-enabled transitions 2778 [2021-03-26 08:27:34,177 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:34,177 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:34,178 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 604 [2021-03-26 08:27:34,178 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 182 transitions, 2469 flow [2021-03-26 08:27:34,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 187.25) internal successors, (2247), 12 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:34,178 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:34,179 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:34,179 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 08:27:34,179 INFO L428 AbstractCegarLoop]: === Iteration 17 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:34,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:34,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1501503079, now seen corresponding path program 1 times [2021-03-26 08:27:34,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:34,179 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631967740] [2021-03-26 08:27:34,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:34,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:34,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:34,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:34,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:34,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:34,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:34,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:34,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:34,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631967740] [2021-03-26 08:27:34,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:34,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 08:27:34,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251282145] [2021-03-26 08:27:34,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 08:27:34,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:34,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 08:27:34,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-26 08:27:34,219 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-26 08:27:34,219 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 182 transitions, 2469 flow. Second operand has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:34,219 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:34,219 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-26 08:27:34,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:36,494 INFO L129 PetriNetUnfolder]: 15379/21530 cut-off events. [2021-03-26 08:27:36,495 INFO L130 PetriNetUnfolder]: For 278881/279268 co-relation queries the response was YES. [2021-03-26 08:27:36,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105571 conditions, 21530 events. 15379/21530 cut-off events. For 278881/279268 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 123747 event pairs, 3191 based on Foata normal form. 76/16346 useless extension candidates. Maximal degree in co-relation 96968. Up to 16170 conditions per place. [2021-03-26 08:27:36,668 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 180 selfloop transitions, 7 changer transitions 20/242 dead transitions. [2021-03-26 08:27:36,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 242 transitions, 3709 flow [2021-03-26 08:27:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:27:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:27:36,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1467 transitions. [2021-03-26 08:27:36,669 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7025862068965517 [2021-03-26 08:27:36,669 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1467 transitions. [2021-03-26 08:27:36,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1467 transitions. [2021-03-26 08:27:36,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:36,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1467 transitions. [2021-03-26 08:27:36,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.5) internal successors, (1467), 6 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:36,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:36,672 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:36,672 INFO L185 Difference]: Start difference. First operand has 133 places, 182 transitions, 2469 flow. Second operand 6 states and 1467 transitions. [2021-03-26 08:27:36,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 242 transitions, 3709 flow [2021-03-26 08:27:37,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 242 transitions, 3648 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-03-26 08:27:37,026 INFO L241 Difference]: Finished difference. Result has 137 places, 183 transitions, 2436 flow [2021-03-26 08:27:37,026 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2408, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2436, PETRI_PLACES=137, PETRI_TRANSITIONS=183} [2021-03-26 08:27:37,026 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 73 predicate places. [2021-03-26 08:27:37,026 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:37,026 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 183 transitions, 2436 flow [2021-03-26 08:27:37,027 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 183 transitions, 2436 flow [2021-03-26 08:27:37,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 183 transitions, 2436 flow [2021-03-26 08:27:37,363 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][15], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 33#thread2EXITtrue, Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), 464#true, Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 121#L1152-1true]) [2021-03-26 08:27:37,363 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-26 08:27:37,363 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:27:37,363 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:27:37,363 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-26 08:27:37,636 INFO L129 PetriNetUnfolder]: 3646/6675 cut-off events. [2021-03-26 08:27:37,636 INFO L130 PetriNetUnfolder]: For 39016/39374 co-relation queries the response was YES. [2021-03-26 08:27:37,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22123 conditions, 6675 events. 3646/6675 cut-off events. For 39016/39374 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 51607 event pairs, 61 based on Foata normal form. 139/4751 useless extension candidates. Maximal degree in co-relation 20211. Up to 1610 conditions per place. [2021-03-26 08:27:37,769 INFO L142 LiptonReduction]: Number of co-enabled transitions 2762 [2021-03-26 08:27:37,777 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:37,777 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:37,777 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 751 [2021-03-26 08:27:37,778 INFO L480 AbstractCegarLoop]: Abstraction has has 137 places, 183 transitions, 2436 flow [2021-03-26 08:27:37,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 236.6) internal successors, (1183), 5 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:37,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:37,778 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:37,778 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 08:27:37,778 INFO L428 AbstractCegarLoop]: === Iteration 18 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:37,779 INFO L82 PathProgramCache]: Analyzing trace with hash -848365179, now seen corresponding path program 2 times [2021-03-26 08:27:37,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:37,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378095697] [2021-03-26 08:27:37,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:37,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:37,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:37,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:37,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:27:37,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:37,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:37,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:37,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:37,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:37,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:37,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378095697] [2021-03-26 08:27:37,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:37,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:27:37,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655166416] [2021-03-26 08:27:37,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:27:37,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:27:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:27:37,835 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-26 08:27:37,835 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 183 transitions, 2436 flow. Second operand has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:37,836 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:37,836 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-26 08:27:37,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:39,946 INFO L129 PetriNetUnfolder]: 14866/20885 cut-off events. [2021-03-26 08:27:39,946 INFO L130 PetriNetUnfolder]: For 263855/264172 co-relation queries the response was YES. [2021-03-26 08:27:40,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102923 conditions, 20885 events. 14866/20885 cut-off events. For 263855/264172 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 120058 event pairs, 3098 based on Foata normal form. 154/15992 useless extension candidates. Maximal degree in co-relation 96498. Up to 13645 conditions per place. [2021-03-26 08:27:40,255 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 172 selfloop transitions, 17 changer transitions 21/243 dead transitions. [2021-03-26 08:27:40,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 243 transitions, 3679 flow [2021-03-26 08:27:40,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:27:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:27:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1603 transitions. [2021-03-26 08:27:40,257 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5757902298850575 [2021-03-26 08:27:40,257 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1603 transitions. [2021-03-26 08:27:40,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1603 transitions. [2021-03-26 08:27:40,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:40,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1603 transitions. [2021-03-26 08:27:40,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 200.375) internal successors, (1603), 8 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:40,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:40,261 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:40,261 INFO L185 Difference]: Start difference. First operand has 137 places, 183 transitions, 2436 flow. Second operand 8 states and 1603 transitions. [2021-03-26 08:27:40,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 243 transitions, 3679 flow [2021-03-26 08:27:40,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 243 transitions, 3659 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-26 08:27:40,496 INFO L241 Difference]: Finished difference. Result has 142 places, 183 transitions, 2456 flow [2021-03-26 08:27:40,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2456, PETRI_PLACES=142, PETRI_TRANSITIONS=183} [2021-03-26 08:27:40,496 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 78 predicate places. [2021-03-26 08:27:40,496 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:40,496 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 183 transitions, 2456 flow [2021-03-26 08:27:40,497 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 183 transitions, 2456 flow [2021-03-26 08:27:40,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 183 transitions, 2456 flow [2021-03-26 08:27:40,719 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= (store |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23| (store (select |v_#memory_int_76| |v_thread0Thread1of1ForFork4_~#t5~0.base_23|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_19| 4)) |v_#memory_int_75|) InVars {#memory_int=|v_#memory_int_76|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} OutVars{#memory_int=|v_#memory_int_75|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_23|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_19|} AuxVars[] AssignedVars[#memory_int, thread0Thread1of1ForFork4_#t~nondet11][14], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 33#thread2EXITtrue, Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 476#true, 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 121#L1152-1true]) [2021-03-26 08:27:40,720 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-26 08:27:40,720 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:27:40,720 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:27:40,720 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-26 08:27:41,041 INFO L129 PetriNetUnfolder]: 3550/6544 cut-off events. [2021-03-26 08:27:41,041 INFO L130 PetriNetUnfolder]: For 37989/38430 co-relation queries the response was YES. [2021-03-26 08:27:41,074 INFO L84 FinitePrefix]: Finished finitePrefix Result has 21594 conditions, 6544 events. 3550/6544 cut-off events. For 37989/38430 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 50783 event pairs, 60 based on Foata normal form. 179/4728 useless extension candidates. Maximal degree in co-relation 19328. Up to 1594 conditions per place. [2021-03-26 08:27:41,129 INFO L142 LiptonReduction]: Number of co-enabled transitions 2688 [2021-03-26 08:27:41,136 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:41,136 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:41,136 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 640 [2021-03-26 08:27:41,136 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 183 transitions, 2456 flow [2021-03-26 08:27:41,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.5) internal successors, (1167), 6 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:41,137 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:41,137 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:41,137 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-26 08:27:41,137 INFO L428 AbstractCegarLoop]: === Iteration 19 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash -751820630, now seen corresponding path program 1 times [2021-03-26 08:27:41,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:41,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051671668] [2021-03-26 08:27:41,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:41,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:41,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:41,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:41,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 08:27:41,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:41,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:27:41,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:41,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:27:41,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:41,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:41,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:41,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:41,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:41,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:41,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051671668] [2021-03-26 08:27:41,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:41,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 08:27:41,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361819600] [2021-03-26 08:27:41,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 08:27:41,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:41,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 08:27:41,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 08:27:41,222 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 348 [2021-03-26 08:27:41,223 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 183 transitions, 2456 flow. Second operand has 8 states, 8 states have (on average 215.625) internal successors, (1725), 8 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:41,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:41,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 348 [2021-03-26 08:27:41,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:42,971 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][60], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 476#true, Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 354#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 226#true, 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 125#L1164-2true]) [2021-03-26 08:27:42,971 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,971 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,971 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,971 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,973 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][87], [Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 472#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 476#true, 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 226#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true]) [2021-03-26 08:27:42,973 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,973 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,973 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,973 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:27:42,990 INFO L129 PetriNetUnfolder]: 9517/14461 cut-off events. [2021-03-26 08:27:42,990 INFO L130 PetriNetUnfolder]: For 221989/223381 co-relation queries the response was YES. [2021-03-26 08:27:43,068 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77847 conditions, 14461 events. 9517/14461 cut-off events. For 221989/223381 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 93629 event pairs, 422 based on Foata normal form. 407/11741 useless extension candidates. Maximal degree in co-relation 72301. Up to 4277 conditions per place. [2021-03-26 08:27:43,122 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 123 selfloop transitions, 79 changer transitions 4/256 dead transitions. [2021-03-26 08:27:43,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 256 transitions, 3877 flow [2021-03-26 08:27:43,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:27:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:27:43,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2003 transitions. [2021-03-26 08:27:43,124 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6395274584929758 [2021-03-26 08:27:43,124 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2003 transitions. [2021-03-26 08:27:43,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2003 transitions. [2021-03-26 08:27:43,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:43,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2003 transitions. [2021-03-26 08:27:43,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 222.55555555555554) internal successors, (2003), 9 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:43,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:43,128 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:43,128 INFO L185 Difference]: Start difference. First operand has 142 places, 183 transitions, 2456 flow. Second operand 9 states and 2003 transitions. [2021-03-26 08:27:43,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 256 transitions, 3877 flow [2021-03-26 08:27:43,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 256 transitions, 3838 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-03-26 08:27:43,334 INFO L241 Difference]: Finished difference. Result has 147 places, 216 transitions, 3423 flow [2021-03-26 08:27:43,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2419, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3423, PETRI_PLACES=147, PETRI_TRANSITIONS=216} [2021-03-26 08:27:43,335 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 83 predicate places. [2021-03-26 08:27:43,335 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:43,335 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 216 transitions, 3423 flow [2021-03-26 08:27:43,335 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 216 transitions, 3423 flow [2021-03-26 08:27:43,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 216 transitions, 3423 flow [2021-03-26 08:27:43,979 INFO L129 PetriNetUnfolder]: 4085/7572 cut-off events. [2021-03-26 08:27:43,979 INFO L130 PetriNetUnfolder]: For 61169/62186 co-relation queries the response was YES. [2021-03-26 08:27:44,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26400 conditions, 7572 events. 4085/7572 cut-off events. For 61169/62186 co-relation queries the response was YES. Maximal size of possible extension queue 618. Compared 60260 event pairs, 44 based on Foata normal form. 198/5481 useless extension candidates. Maximal degree in co-relation 22768. Up to 1876 conditions per place. [2021-03-26 08:27:44,092 INFO L142 LiptonReduction]: Number of co-enabled transitions 3576 [2021-03-26 08:27:44,100 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:44,100 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:44,100 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 765 [2021-03-26 08:27:44,101 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 216 transitions, 3423 flow [2021-03-26 08:27:44,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 215.625) internal successors, (1725), 8 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:44,101 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:44,101 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:44,101 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-26 08:27:44,102 INFO L428 AbstractCegarLoop]: === Iteration 20 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:44,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1471250094, now seen corresponding path program 2 times [2021-03-26 08:27:44,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:44,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419011214] [2021-03-26 08:27:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:44,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:44,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:44,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:44,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:27:44,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:44,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:44,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:44,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:44,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:44,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:27:44,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:44,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:44,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:44,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:44,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419011214] [2021-03-26 08:27:44,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:44,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 08:27:44,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26594103] [2021-03-26 08:27:44,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 08:27:44,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:44,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 08:27:44,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 08:27:44,164 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-26 08:27:44,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 216 transitions, 3423 flow. Second operand has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:44,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:44,165 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-26 08:27:44,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:47,225 INFO L129 PetriNetUnfolder]: 18370/25861 cut-off events. [2021-03-26 08:27:47,225 INFO L130 PetriNetUnfolder]: For 443940/444615 co-relation queries the response was YES. [2021-03-26 08:27:47,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142313 conditions, 25861 events. 18370/25861 cut-off events. For 443940/444615 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 156836 event pairs, 3518 based on Foata normal form. 173/19676 useless extension candidates. Maximal degree in co-relation 129069. Up to 14697 conditions per place. [2021-03-26 08:27:47,529 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 278 selfloop transitions, 28 changer transitions 4/343 dead transitions. [2021-03-26 08:27:47,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 343 transitions, 6035 flow [2021-03-26 08:27:47,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:27:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:27:47,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1816 transitions. [2021-03-26 08:27:47,531 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5798212005108557 [2021-03-26 08:27:47,531 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1816 transitions. [2021-03-26 08:27:47,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1816 transitions. [2021-03-26 08:27:47,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:47,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1816 transitions. [2021-03-26 08:27:47,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 201.77777777777777) internal successors, (1816), 9 states have internal predecessors, (1816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:47,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:47,535 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:47,535 INFO L185 Difference]: Start difference. First operand has 147 places, 216 transitions, 3423 flow. Second operand 9 states and 1816 transitions. [2021-03-26 08:27:47,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 343 transitions, 6035 flow [2021-03-26 08:27:48,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 343 transitions, 5883 flow, removed 23 selfloop flow, removed 3 redundant places. [2021-03-26 08:27:48,746 INFO L241 Difference]: Finished difference. Result has 156 places, 229 transitions, 3670 flow [2021-03-26 08:27:48,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3324, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3670, PETRI_PLACES=156, PETRI_TRANSITIONS=229} [2021-03-26 08:27:48,746 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 92 predicate places. [2021-03-26 08:27:48,746 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:48,747 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 229 transitions, 3670 flow [2021-03-26 08:27:48,747 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 229 transitions, 3670 flow [2021-03-26 08:27:48,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 229 transitions, 3670 flow [2021-03-26 08:27:49,509 INFO L129 PetriNetUnfolder]: 4791/8891 cut-off events. [2021-03-26 08:27:49,510 INFO L130 PetriNetUnfolder]: For 62545/63213 co-relation queries the response was YES. [2021-03-26 08:27:49,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30618 conditions, 8891 events. 4791/8891 cut-off events. For 62545/63213 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 73092 event pairs, 49 based on Foata normal form. 101/6244 useless extension candidates. Maximal degree in co-relation 27071. Up to 2210 conditions per place. [2021-03-26 08:27:49,652 INFO L142 LiptonReduction]: Number of co-enabled transitions 3876 [2021-03-26 08:27:49,661 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:49,661 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:49,661 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 915 [2021-03-26 08:27:49,662 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 229 transitions, 3670 flow [2021-03-26 08:27:49,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:49,662 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:49,662 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:49,662 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-26 08:27:49,662 INFO L428 AbstractCegarLoop]: === Iteration 21 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash 290202358, now seen corresponding path program 3 times [2021-03-26 08:27:49,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:49,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306856121] [2021-03-26 08:27:49,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:49,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:49,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:27:49,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:49,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:27:49,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:49,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:49,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:49,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:27:49,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:49,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:27:49,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:49,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:49,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:49,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:49,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:49,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306856121] [2021-03-26 08:27:49,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:49,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 08:27:49,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391908830] [2021-03-26 08:27:49,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 08:27:49,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 08:27:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-26 08:27:49,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-26 08:27:49,745 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 229 transitions, 3670 flow. Second operand has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:49,745 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:49,745 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-26 08:27:49,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:52,825 INFO L129 PetriNetUnfolder]: 17939/25437 cut-off events. [2021-03-26 08:27:52,825 INFO L130 PetriNetUnfolder]: For 402935/403973 co-relation queries the response was YES. [2021-03-26 08:27:53,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138875 conditions, 25437 events. 17939/25437 cut-off events. For 402935/403973 co-relation queries the response was YES. Maximal size of possible extension queue 1255. Compared 156061 event pairs, 3541 based on Foata normal form. 200/19365 useless extension candidates. Maximal degree in co-relation 129334. Up to 18819 conditions per place. [2021-03-26 08:27:53,086 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 219 selfloop transitions, 17 changer transitions 16/285 dead transitions. [2021-03-26 08:27:53,087 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 285 transitions, 5034 flow [2021-03-26 08:27:53,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:27:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:27:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1404 transitions. [2021-03-26 08:27:53,088 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5763546798029556 [2021-03-26 08:27:53,088 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1404 transitions. [2021-03-26 08:27:53,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1404 transitions. [2021-03-26 08:27:53,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:53,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1404 transitions. [2021-03-26 08:27:53,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 200.57142857142858) internal successors, (1404), 7 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:53,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:53,092 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:53,092 INFO L185 Difference]: Start difference. First operand has 156 places, 229 transitions, 3670 flow. Second operand 7 states and 1404 transitions. [2021-03-26 08:27:53,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 285 transitions, 5034 flow [2021-03-26 08:27:53,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 285 transitions, 4997 flow, removed 16 selfloop flow, removed 2 redundant places. [2021-03-26 08:27:53,958 INFO L241 Difference]: Finished difference. Result has 162 places, 228 transitions, 3660 flow [2021-03-26 08:27:53,958 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3635, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3660, PETRI_PLACES=162, PETRI_TRANSITIONS=228} [2021-03-26 08:27:53,959 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 98 predicate places. [2021-03-26 08:27:53,959 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:27:53,959 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 228 transitions, 3660 flow [2021-03-26 08:27:53,959 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 228 transitions, 3660 flow [2021-03-26 08:27:53,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 228 transitions, 3660 flow [2021-03-26 08:27:54,754 INFO L129 PetriNetUnfolder]: 4765/8869 cut-off events. [2021-03-26 08:27:54,754 INFO L130 PetriNetUnfolder]: For 60810/61461 co-relation queries the response was YES. [2021-03-26 08:27:54,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30308 conditions, 8869 events. 4765/8869 cut-off events. For 60810/61461 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 73277 event pairs, 46 based on Foata normal form. 94/6221 useless extension candidates. Maximal degree in co-relation 27373. Up to 2214 conditions per place. [2021-03-26 08:27:54,934 INFO L142 LiptonReduction]: Number of co-enabled transitions 3864 [2021-03-26 08:27:54,944 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:27:54,944 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:27:54,944 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 985 [2021-03-26 08:27:54,944 INFO L480 AbstractCegarLoop]: Abstraction has has 162 places, 228 transitions, 3660 flow [2021-03-26 08:27:54,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 192.875) internal successors, (1543), 8 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:54,945 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:27:54,945 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:27:54,945 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-26 08:27:54,945 INFO L428 AbstractCegarLoop]: === Iteration 22 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:27:54,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:27:54,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1195912476, now seen corresponding path program 1 times [2021-03-26 08:27:54,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:27:54,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960693863] [2021-03-26 08:27:54,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:27:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:27:54,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:54,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:27:54,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:54,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 08:27:54,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:54,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:27:55,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:55,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:27:55,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:55,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:27:55,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:55,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:27:55,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:55,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:27:55,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:55,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:27:55,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:27:55,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:27:55,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:27:55,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960693863] [2021-03-26 08:27:55,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:27:55,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:27:55,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69396312] [2021-03-26 08:27:55,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:27:55,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:27:55,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:27:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:27:55,051 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-26 08:27:55,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 228 transitions, 3660 flow. Second operand has 10 states, 10 states have (on average 189.5) internal successors, (1895), 10 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:55,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:27:55,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-26 08:27:55,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:27:58,500 INFO L129 PetriNetUnfolder]: 19146/27056 cut-off events. [2021-03-26 08:27:58,500 INFO L130 PetriNetUnfolder]: For 440684/441791 co-relation queries the response was YES. [2021-03-26 08:27:59,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148911 conditions, 27056 events. 19146/27056 cut-off events. For 440684/441791 co-relation queries the response was YES. Maximal size of possible extension queue 1326. Compared 166003 event pairs, 3711 based on Foata normal form. 179/20472 useless extension candidates. Maximal degree in co-relation 139181. Up to 18937 conditions per place. [2021-03-26 08:27:59,111 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 228 selfloop transitions, 20 changer transitions 8/289 dead transitions. [2021-03-26 08:27:59,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 289 transitions, 5156 flow [2021-03-26 08:27:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:27:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:27:59,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1385 transitions. [2021-03-26 08:27:59,112 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5685550082101807 [2021-03-26 08:27:59,112 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1385 transitions. [2021-03-26 08:27:59,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1385 transitions. [2021-03-26 08:27:59,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:27:59,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1385 transitions. [2021-03-26 08:27:59,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.85714285714286) internal successors, (1385), 7 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:59,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:59,115 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:27:59,115 INFO L185 Difference]: Start difference. First operand has 162 places, 228 transitions, 3660 flow. Second operand 7 states and 1385 transitions. [2021-03-26 08:27:59,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 289 transitions, 5156 flow [2021-03-26 08:28:00,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 289 transitions, 5055 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-26 08:28:00,061 INFO L241 Difference]: Finished difference. Result has 166 places, 233 transitions, 3781 flow [2021-03-26 08:28:00,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3582, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3781, PETRI_PLACES=166, PETRI_TRANSITIONS=233} [2021-03-26 08:28:00,062 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 102 predicate places. [2021-03-26 08:28:00,062 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:00,062 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 233 transitions, 3781 flow [2021-03-26 08:28:00,062 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 233 transitions, 3781 flow [2021-03-26 08:28:00,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 233 transitions, 3781 flow [2021-03-26 08:28:00,884 INFO L129 PetriNetUnfolder]: 4946/9156 cut-off events. [2021-03-26 08:28:00,884 INFO L130 PetriNetUnfolder]: For 62289/63031 co-relation queries the response was YES. [2021-03-26 08:28:00,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31755 conditions, 9156 events. 4946/9156 cut-off events. For 62289/63031 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 75553 event pairs, 30 based on Foata normal form. 114/6443 useless extension candidates. Maximal degree in co-relation 27800. Up to 2278 conditions per place. [2021-03-26 08:28:01,037 INFO L142 LiptonReduction]: Number of co-enabled transitions 4012 [2021-03-26 08:28:01,046 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:01,046 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:01,046 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 984 [2021-03-26 08:28:01,047 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 233 transitions, 3781 flow [2021-03-26 08:28:01,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.5) internal successors, (1895), 10 states have internal predecessors, (1895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:01,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:01,047 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:01,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-26 08:28:01,047 INFO L428 AbstractCegarLoop]: === Iteration 23 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 120244828, now seen corresponding path program 2 times [2021-03-26 08:28:01,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:01,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625542830] [2021-03-26 08:28:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:01,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:01,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 08:28:01,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:28:01,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:28:01,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:28:01,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:28:01,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:28:01,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:01,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:01,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625542830] [2021-03-26 08:28:01,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:01,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:28:01,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012923202] [2021-03-26 08:28:01,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:28:01,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:28:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:28:01,152 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 348 [2021-03-26 08:28:01,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 233 transitions, 3781 flow. Second operand has 9 states, 9 states have (on average 230.44444444444446) internal successors, (2074), 9 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:01,153 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:01,153 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 348 [2021-03-26 08:28:01,153 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:03,270 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][110], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 514#true, Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 554#true, 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 569#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, Black: 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)))]) [2021-03-26 08:28:03,271 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:28:03,271 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:03,271 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:03,271 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:03,295 INFO L129 PetriNetUnfolder]: 11450/17555 cut-off events. [2021-03-26 08:28:03,295 INFO L130 PetriNetUnfolder]: For 325356/328166 co-relation queries the response was YES. [2021-03-26 08:28:03,439 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104379 conditions, 17555 events. 11450/17555 cut-off events. For 325356/328166 co-relation queries the response was YES. Maximal size of possible extension queue 990. Compared 119125 event pairs, 739 based on Foata normal form. 829/14409 useless extension candidates. Maximal degree in co-relation 91100. Up to 5908 conditions per place. [2021-03-26 08:28:03,513 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 128 selfloop transitions, 93 changer transitions 2/274 dead transitions. [2021-03-26 08:28:03,513 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 274 transitions, 4812 flow [2021-03-26 08:28:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:28:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:28:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1661 transitions. [2021-03-26 08:28:03,515 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6818555008210181 [2021-03-26 08:28:03,515 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1661 transitions. [2021-03-26 08:28:03,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1661 transitions. [2021-03-26 08:28:03,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:03,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1661 transitions. [2021-03-26 08:28:03,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 237.28571428571428) internal successors, (1661), 7 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:03,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:03,518 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:03,518 INFO L185 Difference]: Start difference. First operand has 166 places, 233 transitions, 3781 flow. Second operand 7 states and 1661 transitions. [2021-03-26 08:28:03,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 274 transitions, 4812 flow [2021-03-26 08:28:04,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 274 transitions, 4754 flow, removed 15 selfloop flow, removed 4 redundant places. [2021-03-26 08:28:04,463 INFO L241 Difference]: Finished difference. Result has 171 places, 247 transitions, 4422 flow [2021-03-26 08:28:04,463 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3723, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4422, PETRI_PLACES=171, PETRI_TRANSITIONS=247} [2021-03-26 08:28:04,464 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 107 predicate places. [2021-03-26 08:28:04,464 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:04,464 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 247 transitions, 4422 flow [2021-03-26 08:28:04,464 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 247 transitions, 4422 flow [2021-03-26 08:28:04,465 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 247 transitions, 4422 flow [2021-03-26 08:28:05,289 INFO L129 PetriNetUnfolder]: 4884/9076 cut-off events. [2021-03-26 08:28:05,289 INFO L130 PetriNetUnfolder]: For 76443/76880 co-relation queries the response was YES. [2021-03-26 08:28:05,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33809 conditions, 9076 events. 4884/9076 cut-off events. For 76443/76880 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 75126 event pairs, 34 based on Foata normal form. 89/6396 useless extension candidates. Maximal degree in co-relation 30528. Up to 2250 conditions per place. [2021-03-26 08:28:05,496 INFO L142 LiptonReduction]: Number of co-enabled transitions 4228 [2021-03-26 08:28:05,507 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:05,507 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:05,507 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1043 [2021-03-26 08:28:05,508 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 247 transitions, 4422 flow [2021-03-26 08:28:05,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 230.44444444444446) internal successors, (2074), 9 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:05,508 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:05,508 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:05,508 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-26 08:28:05,508 INFO L428 AbstractCegarLoop]: === Iteration 24 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2125628681, now seen corresponding path program 1 times [2021-03-26 08:28:05,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:05,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138206902] [2021-03-26 08:28:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:05,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:05,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:05,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:05,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 08:28:05,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:05,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 08:28:05,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:05,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:28:05,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:05,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:28:05,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:05,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:28:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:05,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138206902] [2021-03-26 08:28:05,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:05,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 08:28:05,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204334221] [2021-03-26 08:28:05,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 08:28:05,573 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 08:28:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 08:28:05,574 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 348 [2021-03-26 08:28:05,575 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 247 transitions, 4422 flow. Second operand has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:05,575 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:05,575 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 348 [2021-03-26 08:28:05,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:07,735 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][94], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 514#true, Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 569#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 321#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 607#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 125#L1164-2true, Black: 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)))]) [2021-03-26 08:28:07,735 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,735 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,735 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,735 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,758 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_21|))) (or (and .cse0 |v_ULTIMATE.start_main_#t~short21_28|) (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short21_28|)))) (= |v_ULTIMATE.start_main_#t~mem19_21| (select (select |v_#memory_int_149| v_~v~0.base_53) v_~v~0.offset_53))) InVars {~v~0.offset=v_~v~0.offset_53, #memory_int=|v_#memory_int_149|, ~v~0.base=v_~v~0.base_53} OutVars{~v~0.offset=v_~v~0.offset_53, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_21|, #memory_int=|v_#memory_int_149|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_36|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_28|, ~v~0.base=v_~v~0.base_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19, ULTIMATE.start_main_#t~mem18, ULTIMATE.start_main_#t~short21][90], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 514#true, Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 386#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 42#L1156-1true, Black: 305#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 569#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 317#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 605#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 354#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), Black: 356#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 226#true, Black: 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 362#true, Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), 506#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 125#L1164-2true, Black: 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-26 08:28:07,758 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,759 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,759 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,759 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-26 08:28:07,763 INFO L129 PetriNetUnfolder]: 11130/17017 cut-off events. [2021-03-26 08:28:07,763 INFO L130 PetriNetUnfolder]: For 385062/388198 co-relation queries the response was YES. [2021-03-26 08:28:07,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110824 conditions, 17017 events. 11130/17017 cut-off events. For 385062/388198 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 114581 event pairs, 683 based on Foata normal form. 1207/14603 useless extension candidates. Maximal degree in co-relation 99803. Up to 6953 conditions per place. [2021-03-26 08:28:08,251 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 161 selfloop transitions, 61 changer transitions 2/275 dead transitions. [2021-03-26 08:28:08,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 275 transitions, 5184 flow [2021-03-26 08:28:08,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:28:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:28:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1630 transitions. [2021-03-26 08:28:08,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6691297208538588 [2021-03-26 08:28:08,253 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1630 transitions. [2021-03-26 08:28:08,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1630 transitions. [2021-03-26 08:28:08,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:08,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1630 transitions. [2021-03-26 08:28:08,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 232.85714285714286) internal successors, (1630), 7 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:08,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:08,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:08,256 INFO L185 Difference]: Start difference. First operand has 171 places, 247 transitions, 4422 flow. Second operand 7 states and 1630 transitions. [2021-03-26 08:28:08,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 275 transitions, 5184 flow [2021-03-26 08:28:09,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 275 transitions, 5098 flow, removed 21 selfloop flow, removed 3 redundant places. [2021-03-26 08:28:09,332 INFO L241 Difference]: Finished difference. Result has 175 places, 251 transitions, 4626 flow [2021-03-26 08:28:09,332 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4336, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4626, PETRI_PLACES=175, PETRI_TRANSITIONS=251} [2021-03-26 08:28:09,332 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 111 predicate places. [2021-03-26 08:28:09,332 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:09,332 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 251 transitions, 4626 flow [2021-03-26 08:28:09,332 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 251 transitions, 4626 flow [2021-03-26 08:28:09,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 251 transitions, 4626 flow [2021-03-26 08:28:10,200 INFO L129 PetriNetUnfolder]: 4894/9078 cut-off events. [2021-03-26 08:28:10,201 INFO L130 PetriNetUnfolder]: For 82947/83893 co-relation queries the response was YES. [2021-03-26 08:28:10,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34829 conditions, 9078 events. 4894/9078 cut-off events. For 82947/83893 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 75039 event pairs, 17 based on Foata normal form. 235/6542 useless extension candidates. Maximal degree in co-relation 33029. Up to 2252 conditions per place. [2021-03-26 08:28:10,361 INFO L142 LiptonReduction]: Number of co-enabled transitions 4244 [2021-03-26 08:28:10,371 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:10,372 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:10,372 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1040 [2021-03-26 08:28:10,372 INFO L480 AbstractCegarLoop]: Abstraction has has 175 places, 251 transitions, 4626 flow [2021-03-26 08:28:10,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:10,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:10,372 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:10,372 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-26 08:28:10,373 INFO L428 AbstractCegarLoop]: === Iteration 25 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:10,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:10,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1621581695, now seen corresponding path program 1 times [2021-03-26 08:28:10,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:10,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327006034] [2021-03-26 08:28:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:10,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:28:10,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:10,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 08:28:10,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:28:10,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:28:10,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 08:28:10,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 08:28:10,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:28:10,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:10,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:10,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:10,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:10,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327006034] [2021-03-26 08:28:10,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:10,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:28:10,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808543893] [2021-03-26 08:28:10,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:28:10,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:10,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:28:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:28:10,530 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-26 08:28:10,530 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 251 transitions, 4626 flow. Second operand has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:10,530 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:10,530 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-26 08:28:10,530 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:14,567 INFO L129 PetriNetUnfolder]: 19955/28159 cut-off events. [2021-03-26 08:28:14,567 INFO L130 PetriNetUnfolder]: For 607182/607990 co-relation queries the response was YES. [2021-03-26 08:28:14,864 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173395 conditions, 28159 events. 19955/28159 cut-off events. For 607182/607990 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 174134 event pairs, 3837 based on Foata normal form. 535/21759 useless extension candidates. Maximal degree in co-relation 165624. Up to 16769 conditions per place. [2021-03-26 08:28:14,962 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 243 selfloop transitions, 58 changer transitions 3/337 dead transitions. [2021-03-26 08:28:14,962 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 337 transitions, 6924 flow [2021-03-26 08:28:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 08:28:14,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 08:28:14,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1953 transitions. [2021-03-26 08:28:14,963 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5612068965517242 [2021-03-26 08:28:14,964 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1953 transitions. [2021-03-26 08:28:14,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1953 transitions. [2021-03-26 08:28:14,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:14,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1953 transitions. [2021-03-26 08:28:14,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.3) internal successors, (1953), 10 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:14,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:14,967 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:14,967 INFO L185 Difference]: Start difference. First operand has 175 places, 251 transitions, 4626 flow. Second operand 10 states and 1953 transitions. [2021-03-26 08:28:14,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 337 transitions, 6924 flow [2021-03-26 08:28:16,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 337 transitions, 6728 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-03-26 08:28:16,490 INFO L241 Difference]: Finished difference. Result has 182 places, 264 transitions, 4958 flow [2021-03-26 08:28:16,490 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4410, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4958, PETRI_PLACES=182, PETRI_TRANSITIONS=264} [2021-03-26 08:28:16,490 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 118 predicate places. [2021-03-26 08:28:16,491 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:16,491 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 264 transitions, 4958 flow [2021-03-26 08:28:16,491 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 264 transitions, 4958 flow [2021-03-26 08:28:16,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 264 transitions, 4958 flow [2021-03-26 08:28:17,448 INFO L129 PetriNetUnfolder]: 5208/9668 cut-off events. [2021-03-26 08:28:17,448 INFO L130 PetriNetUnfolder]: For 81515/82343 co-relation queries the response was YES. [2021-03-26 08:28:17,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35431 conditions, 9668 events. 5208/9668 cut-off events. For 81515/82343 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 80887 event pairs, 13 based on Foata normal form. 200/6913 useless extension candidates. Maximal degree in co-relation 33289. Up to 2442 conditions per place. [2021-03-26 08:28:17,605 INFO L142 LiptonReduction]: Number of co-enabled transitions 4438 [2021-03-26 08:28:17,617 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:17,617 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:17,617 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1126 [2021-03-26 08:28:17,617 INFO L480 AbstractCegarLoop]: Abstraction has has 182 places, 264 transitions, 4958 flow [2021-03-26 08:28:17,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:17,618 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:17,618 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:17,618 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-26 08:28:17,618 INFO L428 AbstractCegarLoop]: === Iteration 26 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash 644705952, now seen corresponding path program 1 times [2021-03-26 08:28:17,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:17,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017928309] [2021-03-26 08:28:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:17,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:28:17,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:28:17,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 08:28:17,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:28:17,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:28:17,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:28:17,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:28:17,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:28:17,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:17,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:17,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:17,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017928309] [2021-03-26 08:28:17,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:17,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:28:17,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843118471] [2021-03-26 08:28:17,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:28:17,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:17,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:28:17,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:28:17,725 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-26 08:28:17,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 264 transitions, 4958 flow. Second operand has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:17,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:17,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-26 08:28:17,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:21,841 INFO L129 PetriNetUnfolder]: 20148/28129 cut-off events. [2021-03-26 08:28:21,841 INFO L130 PetriNetUnfolder]: For 590738/591089 co-relation queries the response was YES. [2021-03-26 08:28:22,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 174730 conditions, 28129 events. 20148/28129 cut-off events. For 590738/591089 co-relation queries the response was YES. Maximal size of possible extension queue 1382. Compared 169791 event pairs, 3993 based on Foata normal form. 172/21600 useless extension candidates. Maximal degree in co-relation 161545. Up to 11029 conditions per place. [2021-03-26 08:28:22,255 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 264 selfloop transitions, 79 changer transitions 6/380 dead transitions. [2021-03-26 08:28:22,255 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 380 transitions, 7697 flow [2021-03-26 08:28:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 08:28:22,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 08:28:22,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2156 transitions. [2021-03-26 08:28:22,257 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2021-03-26 08:28:22,257 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2156 transitions. [2021-03-26 08:28:22,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2156 transitions. [2021-03-26 08:28:22,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:22,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2156 transitions. [2021-03-26 08:28:22,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 196.0) internal successors, (2156), 11 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:22,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:22,261 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:22,261 INFO L185 Difference]: Start difference. First operand has 182 places, 264 transitions, 4958 flow. Second operand 11 states and 2156 transitions. [2021-03-26 08:28:22,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 380 transitions, 7697 flow [2021-03-26 08:28:23,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 380 transitions, 7513 flow, removed 56 selfloop flow, removed 7 redundant places. [2021-03-26 08:28:23,662 INFO L241 Difference]: Finished difference. Result has 188 places, 271 transitions, 5080 flow [2021-03-26 08:28:23,663 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4719, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5080, PETRI_PLACES=188, PETRI_TRANSITIONS=271} [2021-03-26 08:28:23,663 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 124 predicate places. [2021-03-26 08:28:23,663 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:23,663 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 271 transitions, 5080 flow [2021-03-26 08:28:23,663 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 271 transitions, 5080 flow [2021-03-26 08:28:23,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 271 transitions, 5080 flow [2021-03-26 08:28:24,416 INFO L129 PetriNetUnfolder]: 5107/9508 cut-off events. [2021-03-26 08:28:24,417 INFO L130 PetriNetUnfolder]: For 77426/78077 co-relation queries the response was YES. [2021-03-26 08:28:24,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34360 conditions, 9508 events. 5107/9508 cut-off events. For 77426/78077 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 79502 event pairs, 10 based on Foata normal form. 202/6770 useless extension candidates. Maximal degree in co-relation 31522. Up to 2430 conditions per place. [2021-03-26 08:28:24,617 INFO L142 LiptonReduction]: Number of co-enabled transitions 4392 [2021-03-26 08:28:24,629 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:24,629 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:24,629 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 966 [2021-03-26 08:28:24,629 INFO L480 AbstractCegarLoop]: Abstraction has has 188 places, 271 transitions, 5080 flow [2021-03-26 08:28:24,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.6) internal successors, (1886), 10 states have internal predecessors, (1886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:24,630 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:24,630 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:24,630 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-26 08:28:24,630 INFO L428 AbstractCegarLoop]: === Iteration 27 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:24,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1522625699, now seen corresponding path program 2 times [2021-03-26 08:28:24,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:24,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883773162] [2021-03-26 08:28:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:24,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:28:24,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:28:24,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:24,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:28:24,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:28:24,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:24,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:24,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:28:24,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:28:24,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:28:24,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:24,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:24,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:24,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883773162] [2021-03-26 08:28:24,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:24,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-26 08:28:24,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091312904] [2021-03-26 08:28:24,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 08:28:24,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:24,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 08:28:24,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-03-26 08:28:24,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-26 08:28:24,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 271 transitions, 5080 flow. Second operand has 11 states, 11 states have (on average 187.45454545454547) internal successors, (2062), 11 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:24,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:24,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-26 08:28:24,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:28,713 INFO L129 PetriNetUnfolder]: 18946/26878 cut-off events. [2021-03-26 08:28:28,714 INFO L130 PetriNetUnfolder]: For 548368/549175 co-relation queries the response was YES. [2021-03-26 08:28:29,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160879 conditions, 26878 events. 18946/26878 cut-off events. For 548368/549175 co-relation queries the response was YES. Maximal size of possible extension queue 1325. Compared 166184 event pairs, 3156 based on Foata normal form. 298/20693 useless extension candidates. Maximal degree in co-relation 147601. Up to 18329 conditions per place. [2021-03-26 08:28:29,379 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 218 selfloop transitions, 60 changer transitions 20/332 dead transitions. [2021-03-26 08:28:29,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 332 transitions, 6825 flow [2021-03-26 08:28:29,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 08:28:29,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 08:28:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1944 transitions. [2021-03-26 08:28:29,382 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5586206896551724 [2021-03-26 08:28:29,382 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1944 transitions. [2021-03-26 08:28:29,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1944 transitions. [2021-03-26 08:28:29,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:29,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1944 transitions. [2021-03-26 08:28:29,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 194.4) internal successors, (1944), 10 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:29,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:29,399 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:29,399 INFO L185 Difference]: Start difference. First operand has 188 places, 271 transitions, 5080 flow. Second operand 10 states and 1944 transitions. [2021-03-26 08:28:29,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 332 transitions, 6825 flow [2021-03-26 08:28:30,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 332 transitions, 6613 flow, removed 46 selfloop flow, removed 6 redundant places. [2021-03-26 08:28:30,344 INFO L241 Difference]: Finished difference. Result has 193 places, 253 transitions, 4718 flow [2021-03-26 08:28:30,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4672, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4718, PETRI_PLACES=193, PETRI_TRANSITIONS=253} [2021-03-26 08:28:30,344 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 129 predicate places. [2021-03-26 08:28:30,344 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:30,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 253 transitions, 4718 flow [2021-03-26 08:28:30,344 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 253 transitions, 4718 flow [2021-03-26 08:28:30,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 193 places, 253 transitions, 4718 flow [2021-03-26 08:28:31,241 INFO L129 PetriNetUnfolder]: 4836/8999 cut-off events. [2021-03-26 08:28:31,242 INFO L130 PetriNetUnfolder]: For 74580/75958 co-relation queries the response was YES. [2021-03-26 08:28:31,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30770 conditions, 8999 events. 4836/8999 cut-off events. For 74580/75958 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 74725 event pairs, 18 based on Foata normal form. 302/6457 useless extension candidates. Maximal degree in co-relation 28076. Up to 2382 conditions per place. [2021-03-26 08:28:31,378 INFO L142 LiptonReduction]: Number of co-enabled transitions 4176 [2021-03-26 08:28:31,392 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:31,393 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:31,393 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1049 [2021-03-26 08:28:31,393 INFO L480 AbstractCegarLoop]: Abstraction has has 193 places, 253 transitions, 4718 flow [2021-03-26 08:28:31,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.45454545454547) internal successors, (2062), 11 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:31,394 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:31,394 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:31,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-26 08:28:31,394 INFO L428 AbstractCegarLoop]: === Iteration 28 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1469979140, now seen corresponding path program 1 times [2021-03-26 08:28:31,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:31,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26756477] [2021-03-26 08:28:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:31,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:28:31,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-26 08:28:31,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-26 08:28:31,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-03-26 08:28:31,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:28:31,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:28:31,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:31,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:31,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:28:31,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:28:31,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:31,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:31,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:31,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26756477] [2021-03-26 08:28:31,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:31,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 08:28:31,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042523032] [2021-03-26 08:28:31,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 08:28:31,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 08:28:31,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-26 08:28:31,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-26 08:28:31,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 253 transitions, 4718 flow. Second operand has 12 states, 12 states have (on average 185.33333333333334) internal successors, (2224), 12 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:31,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:31,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-26 08:28:31,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:35,730 INFO L129 PetriNetUnfolder]: 17921/25265 cut-off events. [2021-03-26 08:28:35,730 INFO L130 PetriNetUnfolder]: For 511841/512274 co-relation queries the response was YES. [2021-03-26 08:28:36,019 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152262 conditions, 25265 events. 17921/25265 cut-off events. For 511841/512274 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 153750 event pairs, 2983 based on Foata normal form. 204/19508 useless extension candidates. Maximal degree in co-relation 138540. Up to 12217 conditions per place. [2021-03-26 08:28:36,083 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 195 selfloop transitions, 76 changer transitions 13/315 dead transitions. [2021-03-26 08:28:36,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 315 transitions, 6249 flow [2021-03-26 08:28:36,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:28:36,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:28:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1738 transitions. [2021-03-26 08:28:36,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5549169859514687 [2021-03-26 08:28:36,085 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1738 transitions. [2021-03-26 08:28:36,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1738 transitions. [2021-03-26 08:28:36,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:36,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1738 transitions. [2021-03-26 08:28:36,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.11111111111111) internal successors, (1738), 9 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:36,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:36,089 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:36,089 INFO L185 Difference]: Start difference. First operand has 193 places, 253 transitions, 4718 flow. Second operand 9 states and 1738 transitions. [2021-03-26 08:28:36,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 315 transitions, 6249 flow [2021-03-26 08:28:37,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 315 transitions, 6106 flow, removed 16 selfloop flow, removed 9 redundant places. [2021-03-26 08:28:37,082 INFO L241 Difference]: Finished difference. Result has 192 places, 250 transitions, 4662 flow [2021-03-26 08:28:37,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4537, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4662, PETRI_PLACES=192, PETRI_TRANSITIONS=250} [2021-03-26 08:28:37,083 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 128 predicate places. [2021-03-26 08:28:37,083 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:37,083 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 250 transitions, 4662 flow [2021-03-26 08:28:37,083 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 250 transitions, 4662 flow [2021-03-26 08:28:37,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 192 places, 250 transitions, 4662 flow [2021-03-26 08:28:37,934 INFO L129 PetriNetUnfolder]: 4669/8714 cut-off events. [2021-03-26 08:28:37,935 INFO L130 PetriNetUnfolder]: For 71860/73372 co-relation queries the response was YES. [2021-03-26 08:28:38,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 28989 conditions, 8714 events. 4669/8714 cut-off events. For 71860/73372 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 72395 event pairs, 12 based on Foata normal form. 308/6313 useless extension candidates. Maximal degree in co-relation 27730. Up to 2304 conditions per place. [2021-03-26 08:28:38,093 INFO L142 LiptonReduction]: Number of co-enabled transitions 4018 [2021-03-26 08:28:38,103 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:38,103 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:38,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1020 [2021-03-26 08:28:38,103 INFO L480 AbstractCegarLoop]: Abstraction has has 192 places, 250 transitions, 4662 flow [2021-03-26 08:28:38,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.33333333333334) internal successors, (2224), 12 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:38,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:38,104 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:38,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-26 08:28:38,104 INFO L428 AbstractCegarLoop]: === Iteration 29 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:38,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:38,104 INFO L82 PathProgramCache]: Analyzing trace with hash 253186649, now seen corresponding path program 1 times [2021-03-26 08:28:38,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:38,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124806088] [2021-03-26 08:28:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:38,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:28:38,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 08:28:38,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:28:38,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:28:38,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:28:38,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:28:38,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:28:38,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:38,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:38,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:38,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124806088] [2021-03-26 08:28:38,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:38,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:28:38,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922736362] [2021-03-26 08:28:38,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:28:38,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:38,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:28:38,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:28:38,199 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-26 08:28:38,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 250 transitions, 4662 flow. Second operand has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:38,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:38,200 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-26 08:28:38,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:41,335 INFO L129 PetriNetUnfolder]: 16465/23785 cut-off events. [2021-03-26 08:28:41,335 INFO L130 PetriNetUnfolder]: For 495116/495133 co-relation queries the response was YES. [2021-03-26 08:28:41,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141224 conditions, 23785 events. 16465/23785 cut-off events. For 495116/495133 co-relation queries the response was YES. Maximal size of possible extension queue 1245. Compared 151368 event pairs, 3404 based on Foata normal form. 424/18543 useless extension candidates. Maximal degree in co-relation 130926. Up to 9847 conditions per place. [2021-03-26 08:28:41,970 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 226 selfloop transitions, 64 changer transitions 27/352 dead transitions. [2021-03-26 08:28:41,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 352 transitions, 6993 flow [2021-03-26 08:28:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:28:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:28:41,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1802 transitions. [2021-03-26 08:28:41,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5753512132822478 [2021-03-26 08:28:41,972 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1802 transitions. [2021-03-26 08:28:41,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1802 transitions. [2021-03-26 08:28:41,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:41,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1802 transitions. [2021-03-26 08:28:41,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.22222222222223) internal successors, (1802), 9 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:41,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:41,977 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:41,977 INFO L185 Difference]: Start difference. First operand has 192 places, 250 transitions, 4662 flow. Second operand 9 states and 1802 transitions. [2021-03-26 08:28:41,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 352 transitions, 6993 flow [2021-03-26 08:28:42,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 352 transitions, 6888 flow, removed 22 selfloop flow, removed 6 redundant places. [2021-03-26 08:28:42,918 INFO L241 Difference]: Finished difference. Result has 197 places, 254 transitions, 4776 flow [2021-03-26 08:28:42,919 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4397, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4776, PETRI_PLACES=197, PETRI_TRANSITIONS=254} [2021-03-26 08:28:42,919 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 133 predicate places. [2021-03-26 08:28:42,919 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:42,919 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 254 transitions, 4776 flow [2021-03-26 08:28:42,919 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 254 transitions, 4776 flow [2021-03-26 08:28:42,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 254 transitions, 4776 flow [2021-03-26 08:28:43,345 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][200], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 655#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 35#thread2EXITtrue, Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 43#thread2EXITtrue, Black: 674#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 686#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread2Thread1of1ForFork5_thidvar0 1)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 715#true, Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 601#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 723#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 607#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 730#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 734#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 610#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 362#true, Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 631#(and (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|))) (or (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (and (= thread2Thread1of1ForFork5_thidvar0 1) (= |thread0Thread1of1ForFork4_~#t3~0.offset| |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|))))), 123#L1152-2true, Black: 619#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-26 08:28:43,345 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 08:28:43,345 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 08:28:43,345 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 08:28:43,345 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 08:28:43,727 INFO L129 PetriNetUnfolder]: 4638/8674 cut-off events. [2021-03-26 08:28:43,727 INFO L130 PetriNetUnfolder]: For 63786/65159 co-relation queries the response was YES. [2021-03-26 08:28:43,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27487 conditions, 8674 events. 4638/8674 cut-off events. For 63786/65159 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 71981 event pairs, 13 based on Foata normal form. 223/6110 useless extension candidates. Maximal degree in co-relation 26286. Up to 2384 conditions per place. [2021-03-26 08:28:43,847 INFO L142 LiptonReduction]: Number of co-enabled transitions 3818 [2021-03-26 08:28:43,858 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:43,858 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:43,858 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 939 [2021-03-26 08:28:43,858 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 254 transitions, 4776 flow [2021-03-26 08:28:43,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:43,859 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:43,859 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:43,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-26 08:28:43,859 INFO L428 AbstractCegarLoop]: === Iteration 30 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:43,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:43,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1642776239, now seen corresponding path program 2 times [2021-03-26 08:28:43,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:43,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135500823] [2021-03-26 08:28:43,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:43,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:28:43,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 08:28:43,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:28:43,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:28:43,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:28:43,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:28:43,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:28:43,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,942 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:43,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:43,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:43,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135500823] [2021-03-26 08:28:43,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:43,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:28:43,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934673730] [2021-03-26 08:28:43,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:28:43,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:28:43,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:28:43,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-26 08:28:43,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 254 transitions, 4776 flow. Second operand has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:43,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:43,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-26 08:28:43,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:46,822 INFO L129 PetriNetUnfolder]: 15318/22180 cut-off events. [2021-03-26 08:28:46,822 INFO L130 PetriNetUnfolder]: For 432220/432298 co-relation queries the response was YES. [2021-03-26 08:28:46,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129070 conditions, 22180 events. 15318/22180 cut-off events. For 432220/432298 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 140990 event pairs, 3324 based on Foata normal form. 100/16902 useless extension candidates. Maximal degree in co-relation 120516. Up to 16710 conditions per place. [2021-03-26 08:28:47,053 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 212 selfloop transitions, 38 changer transitions 3/288 dead transitions. [2021-03-26 08:28:47,054 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 288 transitions, 5830 flow [2021-03-26 08:28:47,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:28:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:28:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1392 transitions. [2021-03-26 08:28:47,055 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2021-03-26 08:28:47,056 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1392 transitions. [2021-03-26 08:28:47,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1392 transitions. [2021-03-26 08:28:47,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:47,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1392 transitions. [2021-03-26 08:28:47,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 198.85714285714286) internal successors, (1392), 7 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:47,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:47,059 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:47,059 INFO L185 Difference]: Start difference. First operand has 197 places, 254 transitions, 4776 flow. Second operand 7 states and 1392 transitions. [2021-03-26 08:28:47,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 288 transitions, 5830 flow [2021-03-26 08:28:48,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 288 transitions, 5799 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 08:28:48,113 INFO L241 Difference]: Finished difference. Result has 203 places, 256 transitions, 4889 flow [2021-03-26 08:28:48,113 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4661, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4889, PETRI_PLACES=203, PETRI_TRANSITIONS=256} [2021-03-26 08:28:48,114 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 139 predicate places. [2021-03-26 08:28:48,114 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:48,114 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 256 transitions, 4889 flow [2021-03-26 08:28:48,114 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 256 transitions, 4889 flow [2021-03-26 08:28:48,117 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 256 transitions, 4889 flow [2021-03-26 08:28:48,857 INFO L129 PetriNetUnfolder]: 4619/8644 cut-off events. [2021-03-26 08:28:48,857 INFO L130 PetriNetUnfolder]: For 63955/65397 co-relation queries the response was YES. [2021-03-26 08:28:48,947 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27123 conditions, 8644 events. 4619/8644 cut-off events. For 63955/65397 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 71602 event pairs, 15 based on Foata normal form. 215/6087 useless extension candidates. Maximal degree in co-relation 25913. Up to 2390 conditions per place. [2021-03-26 08:28:49,039 INFO L142 LiptonReduction]: Number of co-enabled transitions 3754 [2021-03-26 08:28:49,050 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:49,050 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:49,050 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 936 [2021-03-26 08:28:49,050 INFO L480 AbstractCegarLoop]: Abstraction has has 203 places, 256 transitions, 4889 flow [2021-03-26 08:28:49,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.6) internal successors, (1906), 10 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:49,051 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:49,051 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:49,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-26 08:28:49,051 INFO L428 AbstractCegarLoop]: === Iteration 31 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:49,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1762518449, now seen corresponding path program 3 times [2021-03-26 08:28:49,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:49,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307914794] [2021-03-26 08:28:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:49,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:28:49,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 08:28:49,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 08:28:49,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:28:49,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:28:49,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:28:49,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:28:49,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:28:49,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:28:49,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:28:49,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:49,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:49,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:49,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:49,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307914794] [2021-03-26 08:28:49,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:49,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 08:28:49,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77486565] [2021-03-26 08:28:49,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 08:28:49,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:49,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 08:28:49,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-26 08:28:49,251 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-26 08:28:49,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 256 transitions, 4889 flow. Second operand has 12 states, 12 states have (on average 187.33333333333334) internal successors, (2248), 12 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:49,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:49,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-26 08:28:49,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:52,609 INFO L129 PetriNetUnfolder]: 15915/23076 cut-off events. [2021-03-26 08:28:52,609 INFO L130 PetriNetUnfolder]: For 442568/442646 co-relation queries the response was YES. [2021-03-26 08:28:52,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132253 conditions, 23076 events. 15915/23076 cut-off events. For 442568/442646 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 147100 event pairs, 3159 based on Foata normal form. 91/17485 useless extension candidates. Maximal degree in co-relation 123806. Up to 15964 conditions per place. [2021-03-26 08:28:52,834 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 231 selfloop transitions, 42 changer transitions 11/319 dead transitions. [2021-03-26 08:28:52,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 319 transitions, 6675 flow [2021-03-26 08:28:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:28:52,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:28:52,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1374 transitions. [2021-03-26 08:28:52,836 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5640394088669951 [2021-03-26 08:28:52,836 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1374 transitions. [2021-03-26 08:28:52,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1374 transitions. [2021-03-26 08:28:52,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:52,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1374 transitions. [2021-03-26 08:28:52,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.28571428571428) internal successors, (1374), 7 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:52,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:52,839 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:52,839 INFO L185 Difference]: Start difference. First operand has 203 places, 256 transitions, 4889 flow. Second operand 7 states and 1374 transitions. [2021-03-26 08:28:52,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 319 transitions, 6675 flow [2021-03-26 08:28:53,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 319 transitions, 6643 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 08:28:53,644 INFO L241 Difference]: Finished difference. Result has 210 places, 261 transitions, 5123 flow [2021-03-26 08:28:53,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4848, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5123, PETRI_PLACES=210, PETRI_TRANSITIONS=261} [2021-03-26 08:28:53,644 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 146 predicate places. [2021-03-26 08:28:53,644 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:53,645 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 261 transitions, 5123 flow [2021-03-26 08:28:53,645 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 261 transitions, 5123 flow [2021-03-26 08:28:53,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 210 places, 261 transitions, 5123 flow [2021-03-26 08:28:54,298 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([486] thread3ENTRY-->thread3EXIT: Formula: (and (= (store |v_#memory_int_142| v_~v~0.base_49 (store (select |v_#memory_int_142| v_~v~0.base_49) v_~v~0.offset_49 89)) |v_#memory_int_141|) (= |v_thread3Thread1of1ForFork0_#res.base_9| 0) (= v_thread3Thread1of1ForFork0_~arg.offset_11 |v_thread3Thread1of1ForFork0_#in~arg.offset_11|) (= v_thread3Thread1of1ForFork0_~arg.base_11 |v_thread3Thread1of1ForFork0_#in~arg.base_11|) (= |v_thread3Thread1of1ForFork0_#res.offset_9| 0)) InVars {thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, #memory_int=|v_#memory_int_142|, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} OutVars{thread3Thread1of1ForFork0_#in~arg.offset=|v_thread3Thread1of1ForFork0_#in~arg.offset_11|, ~v~0.offset=v_~v~0.offset_49, thread3Thread1of1ForFork0_#res.offset=|v_thread3Thread1of1ForFork0_#res.offset_9|, #memory_int=|v_#memory_int_141|, thread3Thread1of1ForFork0_~arg.offset=v_thread3Thread1of1ForFork0_~arg.offset_11, thread3Thread1of1ForFork0_#res.base=|v_thread3Thread1of1ForFork0_#res.base_9|, thread3Thread1of1ForFork0_~arg.base=v_thread3Thread1of1ForFork0_~arg.base_11, thread3Thread1of1ForFork0_#in~arg.base=|v_thread3Thread1of1ForFork0_#in~arg.base_11|, ~v~0.base=v_~v~0.base_49} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#res.offset, #memory_int, thread3Thread1of1ForFork0_~arg.offset, thread3Thread1of1ForFork0_#res.base, thread3Thread1of1ForFork0_~arg.base][204], [Black: 504#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), Black: 384#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 372#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 378#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 262#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 380#(and (not (= thread3Thread1of1ForFork0_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 89)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (or (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 253#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 382#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= |ULTIMATE.start_main_~#t~0.offset| 0) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (or (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (and (= thread3Thread1of1ForFork0_thidvar0 2) (= ~v~0.offset |ULTIMATE.start_main_~#t~0.offset|)))), Black: 770#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)), Black: 776#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= thread2Thread1of1ForFork1_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 778#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= thread2Thread1of1ForFork1_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 274#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 529#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 531#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 655#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 523#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 527#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 153#thread3EXITtrue, Black: 276#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|)), Black: 401#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 406#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 408#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 412#(and (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0))), 289#(= (select (select |#memory_int| ~v~0.base) ~v~0.offset) 89), 35#thread2EXITtrue, Black: 544#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 548#(and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0))), 43#thread2EXITtrue, Black: 674#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 686#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread2Thread1of1ForFork5_thidvar0 1)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 296#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 433#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 435#(and (or (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|) (and (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= thread3Thread1of1ForFork0_thidvar0 2)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (or (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= |thread0Thread1of1ForFork4_~#t4~0.offset| |ULTIMATE.start_main_~#t~0.offset|))), Black: 427#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), 440#true, Black: 563#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), Black: 571#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= thread2Thread1of1ForFork5_thidvar0 (select (select (store |#memory_int| ~v~0.base (store (select |#memory_int| ~v~0.base) ~v~0.offset 88)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0))), Black: 183#(not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)), Black: 187#(and (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread1Thread1of1ForFork3_thidvar0)) (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 323#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 319#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|) (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset))), 73#ULTIMATE.startEXITtrue, 586#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 451#(not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)), Black: 457#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 459#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread3Thread1of1ForFork0_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |ULTIMATE.start_main_#t~mem18| thread3Thread1of1ForFork0_thidvar0)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 200#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 205#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 338#(and (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 588#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 590#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t5~0.base|) |ULTIMATE.start_main_#t~short21| (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), 601#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89)), Black: 467#(= |ULTIMATE.start_main_#t~mem18| 5), 350#(and (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 212#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 723#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 217#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) 5) (= |ULTIMATE.start_main_#t~mem18| 5) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 607#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (= (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t4~0.base|) |thread0Thread1of1ForFork4_~#t4~0.offset| 3)) ~v~0.base) ~v~0.offset) 89) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 221#(and (not (= |ULTIMATE.start_main_#t~mem18| thread1Thread1of1ForFork3_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 730#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= |ULTIMATE.start_main_#t~mem18| 5) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 734#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), 610#true, Black: 352#(and (= 88 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t3~0.base|) |thread0Thread1of1ForFork4_~#t3~0.offset| 2)) ~v~0.base) ~v~0.offset)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t3~0.base|) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|)), Black: 228#(= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)), 362#true, Black: 480#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 229#|ULTIMATE.start_main_#t~short21|, Black: 489#(and (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)) (= |ULTIMATE.start_main_#t~mem18| 5)), Black: 231#(and (= 88 (select (select |#memory_int| ~v~0.base) ~v~0.offset)) |ULTIMATE.start_main_#t~short21|), 496#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|))), Black: 752#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork1_thidvar0)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), Black: 748#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork1_thidvar0)), Black: 750#(and (not (= |ULTIMATE.start_main_~#t~0.base| |thread0Thread1of1ForFork4_~#t4~0.base|)) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|)) (= (select |#valid| |ULTIMATE.start_main_~#t~0.base|) 1)), 759#true, Black: 240#(= |ULTIMATE.start_main_#t~mem18| 5), Black: 631#(and (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (not (= ~v~0.base |ULTIMATE.start_main_~#t~0.base|))) (or (not (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|)) (and (= thread2Thread1of1ForFork5_thidvar0 1) (= |thread0Thread1of1ForFork4_~#t3~0.offset| |ULTIMATE.start_main_~#t~0.offset|))) (not (= |thread0Thread1of1ForFork4_~#t1~0.base| |ULTIMATE.start_main_~#t~0.base|)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|) thread2Thread1of1ForFork5_thidvar0)) (not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)) (or (= |thread0Thread1of1ForFork4_~#t3~0.base| |ULTIMATE.start_main_~#t~0.base|) (and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t~0.base|) (= 5 (select (select (store |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base| (store (select |#memory_int| |thread0Thread1of1ForFork4_~#t2~0.base|) |thread0Thread1of1ForFork4_~#t2~0.offset| 1)) |ULTIMATE.start_main_~#t~0.base|) |ULTIMATE.start_main_~#t~0.offset|)) (not (= |thread0Thread1of1ForFork4_~#t2~0.base| |ULTIMATE.start_main_~#t~0.base|))))), Black: 619#(not (= |ULTIMATE.start_main_#t~mem18| thread2Thread1of1ForFork5_thidvar0)), 123#L1152-2true, Black: 502#(and (not (= |thread0Thread1of1ForFork4_~#t5~0.base| ~v~0.base)) (not (= ~v~0.base |thread0Thread1of1ForFork4_~#t4~0.base|)) (= (select |#valid| |thread0Thread1of1ForFork4_~#t5~0.base|) 1) (<= (+ |#StackHeapBarrier| 1) |thread0Thread1of1ForFork4_~#t4~0.base|))]) [2021-03-26 08:28:54,299 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-03-26 08:28:54,299 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 08:28:54,299 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 08:28:54,299 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-03-26 08:28:54,533 INFO L129 PetriNetUnfolder]: 4765/8899 cut-off events. [2021-03-26 08:28:54,533 INFO L130 PetriNetUnfolder]: For 66186/67615 co-relation queries the response was YES. [2021-03-26 08:28:54,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27894 conditions, 8899 events. 4765/8899 cut-off events. For 66186/67615 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 74007 event pairs, 8 based on Foata normal form. 211/6176 useless extension candidates. Maximal degree in co-relation 26647. Up to 2492 conditions per place. [2021-03-26 08:28:54,695 INFO L142 LiptonReduction]: Number of co-enabled transitions 3834 [2021-03-26 08:28:54,706 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:28:54,706 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:28:54,706 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1062 [2021-03-26 08:28:54,707 INFO L480 AbstractCegarLoop]: Abstraction has has 210 places, 261 transitions, 5123 flow [2021-03-26 08:28:54,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 187.33333333333334) internal successors, (2248), 12 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:54,707 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:28:54,707 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:28:54,707 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-26 08:28:54,707 INFO L428 AbstractCegarLoop]: === Iteration 32 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:28:54,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:28:54,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1071976973, now seen corresponding path program 1 times [2021-03-26 08:28:54,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:28:54,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744575068] [2021-03-26 08:28:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:28:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:28:54,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:28:54,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 08:28:54,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 08:28:54,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 08:28:54,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:28:54,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:28:54,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:28:54,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:54,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:28:54,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:28:54,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:28:54,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:28:54,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:28:54,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:28:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:28:54,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744575068] [2021-03-26 08:28:54,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:28:54,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 08:28:54,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158693145] [2021-03-26 08:28:54,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 08:28:54,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:28:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 08:28:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-26 08:28:54,981 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-26 08:28:54,983 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 261 transitions, 5123 flow. Second operand has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:54,983 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:28:54,983 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-26 08:28:54,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:28:58,403 INFO L129 PetriNetUnfolder]: 15664/22620 cut-off events. [2021-03-26 08:28:58,403 INFO L130 PetriNetUnfolder]: For 460253/460484 co-relation queries the response was YES. [2021-03-26 08:28:58,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 130640 conditions, 22620 events. 15664/22620 cut-off events. For 460253/460484 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 142098 event pairs, 2844 based on Foata normal form. 118/17188 useless extension candidates. Maximal degree in co-relation 123226. Up to 11161 conditions per place. [2021-03-26 08:28:58,995 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 169 selfloop transitions, 86 changer transitions 23/317 dead transitions. [2021-03-26 08:28:58,995 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 317 transitions, 6533 flow [2021-03-26 08:28:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:28:58,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:28:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1734 transitions. [2021-03-26 08:28:58,997 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.553639846743295 [2021-03-26 08:28:58,997 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1734 transitions. [2021-03-26 08:28:58,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1734 transitions. [2021-03-26 08:28:58,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:28:58,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1734 transitions. [2021-03-26 08:28:58,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 192.66666666666666) internal successors, (1734), 9 states have internal predecessors, (1734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:59,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:59,001 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:28:59,001 INFO L185 Difference]: Start difference. First operand has 210 places, 261 transitions, 5123 flow. Second operand 9 states and 1734 transitions. [2021-03-26 08:28:59,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 317 transitions, 6533 flow [2021-03-26 08:28:59,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 317 transitions, 6376 flow, removed 3 selfloop flow, removed 14 redundant places. [2021-03-26 08:28:59,733 INFO L241 Difference]: Finished difference. Result has 204 places, 244 transitions, 4729 flow [2021-03-26 08:28:59,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4626, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4729, PETRI_PLACES=204, PETRI_TRANSITIONS=244} [2021-03-26 08:28:59,734 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 140 predicate places. [2021-03-26 08:28:59,734 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:28:59,734 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 204 places, 244 transitions, 4729 flow [2021-03-26 08:28:59,734 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 204 places, 244 transitions, 4729 flow [2021-03-26 08:28:59,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 204 places, 244 transitions, 4729 flow [2021-03-26 08:29:00,347 INFO L129 PetriNetUnfolder]: 4485/8423 cut-off events. [2021-03-26 08:29:00,348 INFO L130 PetriNetUnfolder]: For 59455/60588 co-relation queries the response was YES. [2021-03-26 08:29:00,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25171 conditions, 8423 events. 4485/8423 cut-off events. For 59455/60588 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 70023 event pairs, 8 based on Foata normal form. 180/5834 useless extension candidates. Maximal degree in co-relation 24421. Up to 2370 conditions per place. [2021-03-26 08:29:00,682 INFO L142 LiptonReduction]: Number of co-enabled transitions 3356 [2021-03-26 08:29:00,691 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:00,692 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:00,692 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 958 [2021-03-26 08:29:00,692 INFO L480 AbstractCegarLoop]: Abstraction has has 204 places, 244 transitions, 4729 flow [2021-03-26 08:29:00,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:00,693 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:00,693 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:00,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-26 08:29:00,693 INFO L428 AbstractCegarLoop]: === Iteration 33 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:00,693 INFO L82 PathProgramCache]: Analyzing trace with hash 95235625, now seen corresponding path program 1 times [2021-03-26 08:29:00,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:00,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244316110] [2021-03-26 08:29:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:00,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:29:00,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 08:29:00,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:29:00,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 08:29:00,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:29:00,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:00,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:00,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 08:29:00,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 08:29:00,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 08:29:00,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:29:00,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:00,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:00,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:00,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244316110] [2021-03-26 08:29:00,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:00,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 08:29:00,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808465186] [2021-03-26 08:29:00,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 08:29:00,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:00,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 08:29:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-26 08:29:00,946 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-26 08:29:00,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 244 transitions, 4729 flow. Second operand has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:00,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:00,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-26 08:29:00,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:03,998 INFO L129 PetriNetUnfolder]: 13916/20511 cut-off events. [2021-03-26 08:29:03,998 INFO L130 PetriNetUnfolder]: For 400195/400276 co-relation queries the response was YES. [2021-03-26 08:29:04,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 114792 conditions, 20511 events. 13916/20511 cut-off events. For 400195/400276 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 132785 event pairs, 2268 based on Foata normal form. 93/15476 useless extension candidates. Maximal degree in co-relation 106907. Up to 13911 conditions per place. [2021-03-26 08:29:04,168 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 194 selfloop transitions, 49 changer transitions 25/303 dead transitions. [2021-03-26 08:29:04,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 303 transitions, 6117 flow [2021-03-26 08:29:04,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:29:04,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:29:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1737 transitions. [2021-03-26 08:29:04,172 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5545977011494253 [2021-03-26 08:29:04,172 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1737 transitions. [2021-03-26 08:29:04,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1737 transitions. [2021-03-26 08:29:04,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:04,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1737 transitions. [2021-03-26 08:29:04,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:04,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:04,176 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:04,176 INFO L185 Difference]: Start difference. First operand has 204 places, 244 transitions, 4729 flow. Second operand 9 states and 1737 transitions. [2021-03-26 08:29:04,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 303 transitions, 6117 flow [2021-03-26 08:29:04,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 303 transitions, 5803 flow, removed 84 selfloop flow, removed 7 redundant places. [2021-03-26 08:29:04,884 INFO L241 Difference]: Finished difference. Result has 206 places, 235 transitions, 4346 flow [2021-03-26 08:29:04,884 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4413, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4346, PETRI_PLACES=206, PETRI_TRANSITIONS=235} [2021-03-26 08:29:04,884 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 142 predicate places. [2021-03-26 08:29:04,884 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:04,885 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 235 transitions, 4346 flow [2021-03-26 08:29:04,885 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 235 transitions, 4346 flow [2021-03-26 08:29:04,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 235 transitions, 4346 flow [2021-03-26 08:29:05,635 INFO L129 PetriNetUnfolder]: 3974/7460 cut-off events. [2021-03-26 08:29:05,635 INFO L130 PetriNetUnfolder]: For 40207/40364 co-relation queries the response was YES. [2021-03-26 08:29:05,695 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20486 conditions, 7460 events. 3974/7460 cut-off events. For 40207/40364 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 60588 event pairs, 29 based on Foata normal form. 68/5027 useless extension candidates. Maximal degree in co-relation 19945. Up to 2136 conditions per place. [2021-03-26 08:29:05,764 INFO L142 LiptonReduction]: Number of co-enabled transitions 3084 [2021-03-26 08:29:05,773 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:05,773 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:05,773 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 889 [2021-03-26 08:29:05,774 INFO L480 AbstractCegarLoop]: Abstraction has has 206 places, 235 transitions, 4346 flow [2021-03-26 08:29:05,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.41666666666666) internal successors, (2225), 12 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:05,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:05,774 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:05,774 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-03-26 08:29:05,774 INFO L428 AbstractCegarLoop]: === Iteration 34 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:05,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:05,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1291294908, now seen corresponding path program 1 times [2021-03-26 08:29:05,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:05,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103781538] [2021-03-26 08:29:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:05,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:05,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:29:05,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:05,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:29:05,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:05,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:29:05,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:05,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:05,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:05,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:05,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:05,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103781538] [2021-03-26 08:29:05,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:05,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 08:29:05,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345291605] [2021-03-26 08:29:05,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 08:29:05,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:05,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 08:29:05,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-26 08:29:05,815 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-26 08:29:05,816 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 235 transitions, 4346 flow. Second operand has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:05,816 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:05,816 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-26 08:29:05,816 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:08,046 INFO L129 PetriNetUnfolder]: 11178/17014 cut-off events. [2021-03-26 08:29:08,047 INFO L130 PetriNetUnfolder]: For 300811/300849 co-relation queries the response was YES. [2021-03-26 08:29:08,161 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92520 conditions, 17014 events. 11178/17014 cut-off events. For 300811/300849 co-relation queries the response was YES. Maximal size of possible extension queue 986. Compared 113476 event pairs, 2515 based on Foata normal form. 178/12924 useless extension candidates. Maximal degree in co-relation 86759. Up to 11045 conditions per place. [2021-03-26 08:29:08,209 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 178 selfloop transitions, 5 changer transitions 73/288 dead transitions. [2021-03-26 08:29:08,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 288 transitions, 5806 flow [2021-03-26 08:29:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:29:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:29:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1597 transitions. [2021-03-26 08:29:08,211 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5736350574712644 [2021-03-26 08:29:08,212 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1597 transitions. [2021-03-26 08:29:08,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1597 transitions. [2021-03-26 08:29:08,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:08,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1597 transitions. [2021-03-26 08:29:08,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 199.625) internal successors, (1597), 8 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:08,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:08,215 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:08,215 INFO L185 Difference]: Start difference. First operand has 206 places, 235 transitions, 4346 flow. Second operand 8 states and 1597 transitions. [2021-03-26 08:29:08,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 288 transitions, 5806 flow [2021-03-26 08:29:08,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 288 transitions, 5250 flow, removed 39 selfloop flow, removed 19 redundant places. [2021-03-26 08:29:08,740 INFO L241 Difference]: Finished difference. Result has 196 places, 214 transitions, 3536 flow [2021-03-26 08:29:08,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3741, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3536, PETRI_PLACES=196, PETRI_TRANSITIONS=214} [2021-03-26 08:29:08,740 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 132 predicate places. [2021-03-26 08:29:08,740 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:08,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 214 transitions, 3536 flow [2021-03-26 08:29:08,741 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 214 transitions, 3536 flow [2021-03-26 08:29:08,742 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 180 places, 214 transitions, 3536 flow [2021-03-26 08:29:09,111 INFO L129 PetriNetUnfolder]: 3043/5689 cut-off events. [2021-03-26 08:29:09,111 INFO L130 PetriNetUnfolder]: For 25856/26401 co-relation queries the response was YES. [2021-03-26 08:29:09,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14662 conditions, 5689 events. 3043/5689 cut-off events. For 25856/26401 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 43967 event pairs, 10 based on Foata normal form. 141/3895 useless extension candidates. Maximal degree in co-relation 14555. Up to 1624 conditions per place. [2021-03-26 08:29:09,205 INFO L142 LiptonReduction]: Number of co-enabled transitions 2804 [2021-03-26 08:29:09,214 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:09,214 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:09,214 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 474 [2021-03-26 08:29:09,215 INFO L480 AbstractCegarLoop]: Abstraction has has 180 places, 214 transitions, 3536 flow [2021-03-26 08:29:09,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 194.83333333333334) internal successors, (1169), 6 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:09,215 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:09,215 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:09,215 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-03-26 08:29:09,215 INFO L428 AbstractCegarLoop]: === Iteration 35 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:09,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:09,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1251056328, now seen corresponding path program 2 times [2021-03-26 08:29:09,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:09,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115608620] [2021-03-26 08:29:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:09,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:09,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 08:29:09,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:09,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:09,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:09,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:09,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:09,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:29:09,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:09,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:09,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:09,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:09,288 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:09,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:09,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115608620] [2021-03-26 08:29:09,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:09,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-26 08:29:09,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040358444] [2021-03-26 08:29:09,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 08:29:09,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 08:29:09,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-26 08:29:09,291 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-26 08:29:09,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 214 transitions, 3536 flow. Second operand has 8 states, 8 states have (on average 193.125) internal successors, (1545), 8 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:09,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:09,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-26 08:29:09,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:11,185 INFO L129 PetriNetUnfolder]: 9386/14152 cut-off events. [2021-03-26 08:29:11,185 INFO L130 PetriNetUnfolder]: For 195203/195203 co-relation queries the response was YES. [2021-03-26 08:29:11,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71844 conditions, 14152 events. 9386/14152 cut-off events. For 195203/195203 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 90586 event pairs, 2204 based on Foata normal form. 108/10681 useless extension candidates. Maximal degree in co-relation 71693. Up to 9526 conditions per place. [2021-03-26 08:29:11,285 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 157 selfloop transitions, 6 changer transitions 71/265 dead transitions. [2021-03-26 08:29:11,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 265 transitions, 4868 flow [2021-03-26 08:29:11,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 08:29:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 08:29:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1782 transitions. [2021-03-26 08:29:11,287 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2021-03-26 08:29:11,287 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1782 transitions. [2021-03-26 08:29:11,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1782 transitions. [2021-03-26 08:29:11,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:11,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1782 transitions. [2021-03-26 08:29:11,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.0) internal successors, (1782), 9 states have internal predecessors, (1782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:11,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:11,290 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 348.0) internal successors, (3480), 10 states have internal predecessors, (3480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:11,290 INFO L185 Difference]: Start difference. First operand has 180 places, 214 transitions, 3536 flow. Second operand 9 states and 1782 transitions. [2021-03-26 08:29:11,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 265 transitions, 4868 flow [2021-03-26 08:29:11,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 265 transitions, 4745 flow, removed 26 selfloop flow, removed 16 redundant places. [2021-03-26 08:29:11,595 INFO L241 Difference]: Finished difference. Result has 174 places, 194 transitions, 3084 flow [2021-03-26 08:29:11,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3344, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3084, PETRI_PLACES=174, PETRI_TRANSITIONS=194} [2021-03-26 08:29:11,595 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 110 predicate places. [2021-03-26 08:29:11,595 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:11,595 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 194 transitions, 3084 flow [2021-03-26 08:29:11,595 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 194 transitions, 3084 flow [2021-03-26 08:29:11,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 194 transitions, 3084 flow [2021-03-26 08:29:11,872 INFO L129 PetriNetUnfolder]: 2546/4732 cut-off events. [2021-03-26 08:29:11,872 INFO L130 PetriNetUnfolder]: For 18909/19331 co-relation queries the response was YES. [2021-03-26 08:29:11,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11828 conditions, 4732 events. 2546/4732 cut-off events. For 18909/19331 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 35276 event pairs, 12 based on Foata normal form. 116/3227 useless extension candidates. Maximal degree in co-relation 11744. Up to 1368 conditions per place. [2021-03-26 08:29:11,937 INFO L142 LiptonReduction]: Number of co-enabled transitions 2616 [2021-03-26 08:29:11,946 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:11,947 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:11,947 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 352 [2021-03-26 08:29:11,947 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 194 transitions, 3084 flow [2021-03-26 08:29:11,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 193.125) internal successors, (1545), 8 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:11,947 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:11,947 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:11,947 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-03-26 08:29:11,947 INFO L428 AbstractCegarLoop]: === Iteration 36 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash -395795564, now seen corresponding path program 1 times [2021-03-26 08:29:11,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:11,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660476206] [2021-03-26 08:29:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:11,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:11,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 08:29:11,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:11,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:11,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:11,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:12,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:12,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:12,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:12,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:29:12,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:12,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:12,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:12,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:12,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:12,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:12,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660476206] [2021-03-26 08:29:12,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:12,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-26 08:29:12,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671713721] [2021-03-26 08:29:12,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-26 08:29:12,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-26 08:29:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-26 08:29:12,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-26 08:29:12,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 194 transitions, 3084 flow. Second operand has 9 states, 9 states have (on average 191.88888888888889) internal successors, (1727), 9 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-03-26 08:29:12,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:12,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-26 08:29:12,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:13,484 INFO L129 PetriNetUnfolder]: 7973/11985 cut-off events. [2021-03-26 08:29:13,485 INFO L130 PetriNetUnfolder]: For 154467/154486 co-relation queries the response was YES. [2021-03-26 08:29:13,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59800 conditions, 11985 events. 7973/11985 cut-off events. For 154467/154486 co-relation queries the response was YES. Maximal size of possible extension queue 709. Compared 74675 event pairs, 1910 based on Foata normal form. 116/9051 useless extension candidates. Maximal degree in co-relation 59713. Up to 7967 conditions per place. [2021-03-26 08:29:13,586 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 135 selfloop transitions, 9 changer transitions 64/237 dead transitions. [2021-03-26 08:29:13,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 237 transitions, 4142 flow [2021-03-26 08:29:13,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 08:29:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 08:29:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1963 transitions. [2021-03-26 08:29:13,588 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5640804597701149 [2021-03-26 08:29:13,588 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1963 transitions. [2021-03-26 08:29:13,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1963 transitions. [2021-03-26 08:29:13,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:13,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1963 transitions. [2021-03-26 08:29:13,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 196.3) internal successors, (1963), 10 states have internal predecessors, (1963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:13,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:13,592 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:13,592 INFO L185 Difference]: Start difference. First operand has 166 places, 194 transitions, 3084 flow. Second operand 10 states and 1963 transitions. [2021-03-26 08:29:13,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 237 transitions, 4142 flow [2021-03-26 08:29:13,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 237 transitions, 4058 flow, removed 20 selfloop flow, removed 14 redundant places. [2021-03-26 08:29:13,881 INFO L241 Difference]: Finished difference. Result has 163 places, 172 transitions, 2529 flow [2021-03-26 08:29:13,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2920, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2529, PETRI_PLACES=163, PETRI_TRANSITIONS=172} [2021-03-26 08:29:13,882 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 99 predicate places. [2021-03-26 08:29:13,882 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:13,882 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 172 transitions, 2529 flow [2021-03-26 08:29:13,882 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 172 transitions, 2529 flow [2021-03-26 08:29:13,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 172 transitions, 2529 flow [2021-03-26 08:29:14,116 INFO L129 PetriNetUnfolder]: 2026/3753 cut-off events. [2021-03-26 08:29:14,116 INFO L130 PetriNetUnfolder]: For 12785/12873 co-relation queries the response was YES. [2021-03-26 08:29:14,133 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9235 conditions, 3753 events. 2026/3753 cut-off events. For 12785/12873 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 26877 event pairs, 5 based on Foata normal form. 51/2514 useless extension candidates. Maximal degree in co-relation 8349. Up to 1084 conditions per place. [2021-03-26 08:29:14,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 2428 [2021-03-26 08:29:14,167 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:14,167 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:14,167 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 285 [2021-03-26 08:29:14,167 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 172 transitions, 2529 flow [2021-03-26 08:29:14,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 191.88888888888889) internal successors, (1727), 9 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-03-26 08:29:14,168 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:14,168 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:14,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-03-26 08:29:14,168 INFO L428 AbstractCegarLoop]: === Iteration 37 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:14,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:14,168 INFO L82 PathProgramCache]: Analyzing trace with hash 779695080, now seen corresponding path program 2 times [2021-03-26 08:29:14,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:14,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006167611] [2021-03-26 08:29:14,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:14,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 08:29:14,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:29:14,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:14,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:14,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:14,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:29:14,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:14,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:14,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:14,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:14,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006167611] [2021-03-26 08:29:14,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:14,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:29:14,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500130689] [2021-03-26 08:29:14,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:29:14,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:14,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:29:14,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:29:14,285 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-26 08:29:14,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 172 transitions, 2529 flow. Second operand has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:14,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:14,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-26 08:29:14,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:15,486 INFO L129 PetriNetUnfolder]: 6565/9844 cut-off events. [2021-03-26 08:29:15,486 INFO L130 PetriNetUnfolder]: For 123035/123036 co-relation queries the response was YES. [2021-03-26 08:29:15,528 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48853 conditions, 9844 events. 6565/9844 cut-off events. For 123035/123036 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 59055 event pairs, 1737 based on Foata normal form. 109/7443 useless extension candidates. Maximal degree in co-relation 43217. Up to 6453 conditions per place. [2021-03-26 08:29:15,543 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 119 selfloop transitions, 12 changer transitions 50/208 dead transitions. [2021-03-26 08:29:15,544 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 208 transitions, 3408 flow [2021-03-26 08:29:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 08:29:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 08:29:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1955 transitions. [2021-03-26 08:29:15,546 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5617816091954023 [2021-03-26 08:29:15,546 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1955 transitions. [2021-03-26 08:29:15,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1955 transitions. [2021-03-26 08:29:15,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:15,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1955 transitions. [2021-03-26 08:29:15,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.5) internal successors, (1955), 10 states have internal predecessors, (1955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:15,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:15,550 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:15,550 INFO L185 Difference]: Start difference. First operand has 156 places, 172 transitions, 2529 flow. Second operand 10 states and 1955 transitions. [2021-03-26 08:29:15,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 208 transitions, 3408 flow [2021-03-26 08:29:15,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 208 transitions, 3332 flow, removed 17 selfloop flow, removed 12 redundant places. [2021-03-26 08:29:15,743 INFO L241 Difference]: Finished difference. Result has 155 places, 157 transitions, 2158 flow [2021-03-26 08:29:15,743 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2158, PETRI_PLACES=155, PETRI_TRANSITIONS=157} [2021-03-26 08:29:15,743 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 91 predicate places. [2021-03-26 08:29:15,743 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:15,743 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 157 transitions, 2158 flow [2021-03-26 08:29:15,743 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 157 transitions, 2158 flow [2021-03-26 08:29:15,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 145 places, 157 transitions, 2158 flow [2021-03-26 08:29:15,895 INFO L129 PetriNetUnfolder]: 1529/2834 cut-off events. [2021-03-26 08:29:15,895 INFO L130 PetriNetUnfolder]: For 8869/8976 co-relation queries the response was YES. [2021-03-26 08:29:15,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 2834 events. 1529/2834 cut-off events. For 8869/8976 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 19112 event pairs, 5 based on Foata normal form. 42/1881 useless extension candidates. Maximal degree in co-relation 6785. Up to 816 conditions per place. [2021-03-26 08:29:15,933 INFO L142 LiptonReduction]: Number of co-enabled transitions 2242 [2021-03-26 08:29:15,937 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:15,938 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:15,938 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 195 [2021-03-26 08:29:15,938 INFO L480 AbstractCegarLoop]: Abstraction has has 145 places, 157 transitions, 2158 flow [2021-03-26 08:29:15,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:15,938 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:15,938 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:15,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-03-26 08:29:15,939 INFO L428 AbstractCegarLoop]: === Iteration 38 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:15,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1777407144, now seen corresponding path program 3 times [2021-03-26 08:29:15,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:15,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929181338] [2021-03-26 08:29:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:15,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:15,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:29:15,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:15,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 08:29:15,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:15,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 08:29:15,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:15,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:16,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:16,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:29:16,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:16,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:29:16,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:16,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:16,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:16,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:29:16,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:16,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:16,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:16,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:16,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929181338] [2021-03-26 08:29:16,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:16,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-26 08:29:16,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897793643] [2021-03-26 08:29:16,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 08:29:16,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:16,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 08:29:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-03-26 08:29:16,056 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-26 08:29:16,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 157 transitions, 2158 flow. Second operand has 11 states, 11 states have (on average 188.54545454545453) internal successors, (2074), 11 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:16,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:16,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-26 08:29:16,057 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:17,296 INFO L129 PetriNetUnfolder]: 6597/9840 cut-off events. [2021-03-26 08:29:17,296 INFO L130 PetriNetUnfolder]: For 118663/118664 co-relation queries the response was YES. [2021-03-26 08:29:17,347 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47733 conditions, 9840 events. 6597/9840 cut-off events. For 118663/118664 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 58708 event pairs, 1599 based on Foata normal form. 55/7359 useless extension candidates. Maximal degree in co-relation 45057. Up to 6431 conditions per place. [2021-03-26 08:29:17,372 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 134 selfloop transitions, 18 changer transitions 30/209 dead transitions. [2021-03-26 08:29:17,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 209 transitions, 3046 flow [2021-03-26 08:29:17,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:29:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:29:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1581 transitions. [2021-03-26 08:29:17,374 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5678879310344828 [2021-03-26 08:29:17,374 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1581 transitions. [2021-03-26 08:29:17,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1581 transitions. [2021-03-26 08:29:17,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:17,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1581 transitions. [2021-03-26 08:29:17,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 197.625) internal successors, (1581), 8 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:17,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:17,378 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:17,378 INFO L185 Difference]: Start difference. First operand has 145 places, 157 transitions, 2158 flow. Second operand 8 states and 1581 transitions. [2021-03-26 08:29:17,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 209 transitions, 3046 flow [2021-03-26 08:29:17,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 209 transitions, 2976 flow, removed 21 selfloop flow, removed 13 redundant places. [2021-03-26 08:29:17,559 INFO L241 Difference]: Finished difference. Result has 143 places, 163 transitions, 2299 flow [2021-03-26 08:29:17,559 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2299, PETRI_PLACES=143, PETRI_TRANSITIONS=163} [2021-03-26 08:29:17,559 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 79 predicate places. [2021-03-26 08:29:17,560 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:17,560 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 163 transitions, 2299 flow [2021-03-26 08:29:17,560 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 163 transitions, 2299 flow [2021-03-26 08:29:17,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 163 transitions, 2299 flow [2021-03-26 08:29:17,741 INFO L129 PetriNetUnfolder]: 1808/3321 cut-off events. [2021-03-26 08:29:17,741 INFO L130 PetriNetUnfolder]: For 10310/10503 co-relation queries the response was YES. [2021-03-26 08:29:17,761 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7922 conditions, 3321 events. 1808/3321 cut-off events. For 10310/10503 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 23069 event pairs, 6 based on Foata normal form. 53/2205 useless extension candidates. Maximal degree in co-relation 7486. Up to 976 conditions per place. [2021-03-26 08:29:17,789 INFO L142 LiptonReduction]: Number of co-enabled transitions 2340 [2021-03-26 08:29:17,795 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:17,795 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:17,795 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 235 [2021-03-26 08:29:17,795 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 163 transitions, 2299 flow [2021-03-26 08:29:17,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.54545454545453) internal successors, (2074), 11 states have internal predecessors, (2074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:17,796 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:17,796 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:17,796 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-03-26 08:29:17,796 INFO L428 AbstractCegarLoop]: === Iteration 39 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:17,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:17,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1265588041, now seen corresponding path program 1 times [2021-03-26 08:29:17,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:17,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843730518] [2021-03-26 08:29:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:17,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 08:29:17,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 08:29:17,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-26 08:29:17,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 08:29:17,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:29:17,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:17,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:17,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:17,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:17,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:18,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:18,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:18,019 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-26 08:29:18,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-26 08:29:18,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:18,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:18,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:18,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:18,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843730518] [2021-03-26 08:29:18,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:18,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-26 08:29:18,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389781435] [2021-03-26 08:29:18,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-26 08:29:18,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:18,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-26 08:29:18,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-26 08:29:18,046 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 348 [2021-03-26 08:29:18,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 163 transitions, 2299 flow. Second operand has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:18,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:18,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 348 [2021-03-26 08:29:18,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:19,484 INFO L129 PetriNetUnfolder]: 7033/10572 cut-off events. [2021-03-26 08:29:19,484 INFO L130 PetriNetUnfolder]: For 126235/126252 co-relation queries the response was YES. [2021-03-26 08:29:19,544 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50941 conditions, 10572 events. 7033/10572 cut-off events. For 126235/126252 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 65336 event pairs, 364 based on Foata normal form. 114/8147 useless extension candidates. Maximal degree in co-relation 46944. Up to 5290 conditions per place. [2021-03-26 08:29:19,579 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 167 selfloop transitions, 52 changer transitions 19/265 dead transitions. [2021-03-26 08:29:19,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 265 transitions, 4092 flow [2021-03-26 08:29:19,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-26 08:29:19,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-26 08:29:19,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1951 transitions. [2021-03-26 08:29:19,581 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5606321839080459 [2021-03-26 08:29:19,581 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1951 transitions. [2021-03-26 08:29:19,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1951 transitions. [2021-03-26 08:29:19,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:19,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1951 transitions. [2021-03-26 08:29:19,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.1) internal successors, (1951), 10 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:19,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:19,586 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 348.0) internal successors, (3828), 11 states have internal predecessors, (3828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:19,586 INFO L185 Difference]: Start difference. First operand has 141 places, 163 transitions, 2299 flow. Second operand 10 states and 1951 transitions. [2021-03-26 08:29:19,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 265 transitions, 4092 flow [2021-03-26 08:29:19,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 265 transitions, 4024 flow, removed 27 selfloop flow, removed 3 redundant places. [2021-03-26 08:29:19,856 INFO L241 Difference]: Finished difference. Result has 150 places, 187 transitions, 2824 flow [2021-03-26 08:29:19,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2824, PETRI_PLACES=150, PETRI_TRANSITIONS=187} [2021-03-26 08:29:19,856 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 86 predicate places. [2021-03-26 08:29:19,856 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:19,856 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 187 transitions, 2824 flow [2021-03-26 08:29:19,857 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 187 transitions, 2824 flow [2021-03-26 08:29:19,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 187 transitions, 2824 flow [2021-03-26 08:29:20,092 INFO L129 PetriNetUnfolder]: 2105/3932 cut-off events. [2021-03-26 08:29:20,093 INFO L130 PetriNetUnfolder]: For 16794/16841 co-relation queries the response was YES. [2021-03-26 08:29:20,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10311 conditions, 3932 events. 2105/3932 cut-off events. For 16794/16841 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 28336 event pairs, 4 based on Foata normal form. 36/2667 useless extension candidates. Maximal degree in co-relation 9886. Up to 1136 conditions per place. [2021-03-26 08:29:20,139 INFO L142 LiptonReduction]: Number of co-enabled transitions 2600 [2021-03-26 08:29:20,145 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:20,145 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:20,145 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 289 [2021-03-26 08:29:20,145 INFO L480 AbstractCegarLoop]: Abstraction has has 148 places, 187 transitions, 2824 flow [2021-03-26 08:29:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 186.30769230769232) internal successors, (2422), 13 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:20,146 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:20,146 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:20,146 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-03-26 08:29:20,146 INFO L428 AbstractCegarLoop]: === Iteration 40 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -26725849, now seen corresponding path program 1 times [2021-03-26 08:29:20,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:20,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411526143] [2021-03-26 08:29:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:20,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:29:20,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 08:29:20,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:20,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:29:20,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:29:20,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:20,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:29:20,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:20,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:20,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:20,237 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411526143] [2021-03-26 08:29:20,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:20,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:29:20,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129690624] [2021-03-26 08:29:20,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:29:20,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:20,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:29:20,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:29:20,239 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-26 08:29:20,240 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 187 transitions, 2824 flow. Second operand has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:20,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:20,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-26 08:29:20,240 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:21,256 INFO L129 PetriNetUnfolder]: 6818/10093 cut-off events. [2021-03-26 08:29:21,256 INFO L130 PetriNetUnfolder]: For 156433/156524 co-relation queries the response was YES. [2021-03-26 08:29:21,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52419 conditions, 10093 events. 6818/10093 cut-off events. For 156433/156524 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 59923 event pairs, 1446 based on Foata normal form. 72/7519 useless extension candidates. Maximal degree in co-relation 51111. Up to 7235 conditions per place. [2021-03-26 08:29:21,332 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 161 selfloop transitions, 10 changer transitions 20/219 dead transitions. [2021-03-26 08:29:21,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 219 transitions, 3654 flow [2021-03-26 08:29:21,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:29:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:29:21,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1373 transitions. [2021-03-26 08:29:21,334 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5636288998357963 [2021-03-26 08:29:21,334 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1373 transitions. [2021-03-26 08:29:21,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1373 transitions. [2021-03-26 08:29:21,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:21,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1373 transitions. [2021-03-26 08:29:21,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.14285714285714) internal successors, (1373), 7 states have internal predecessors, (1373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:21,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:21,336 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:21,336 INFO L185 Difference]: Start difference. First operand has 148 places, 187 transitions, 2824 flow. Second operand 7 states and 1373 transitions. [2021-03-26 08:29:21,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 219 transitions, 3654 flow [2021-03-26 08:29:21,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 219 transitions, 3593 flow, removed 26 selfloop flow, removed 3 redundant places. [2021-03-26 08:29:21,576 INFO L241 Difference]: Finished difference. Result has 153 places, 187 transitions, 2791 flow [2021-03-26 08:29:21,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2753, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2791, PETRI_PLACES=153, PETRI_TRANSITIONS=187} [2021-03-26 08:29:21,576 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 89 predicate places. [2021-03-26 08:29:21,576 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:21,576 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 187 transitions, 2791 flow [2021-03-26 08:29:21,576 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 187 transitions, 2791 flow [2021-03-26 08:29:21,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 153 places, 187 transitions, 2791 flow [2021-03-26 08:29:21,800 INFO L129 PetriNetUnfolder]: 2080/3897 cut-off events. [2021-03-26 08:29:21,800 INFO L130 PetriNetUnfolder]: For 15956/16022 co-relation queries the response was YES. [2021-03-26 08:29:21,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10004 conditions, 3897 events. 2080/3897 cut-off events. For 15956/16022 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 28120 event pairs, 4 based on Foata normal form. 45/2628 useless extension candidates. Maximal degree in co-relation 9745. Up to 1128 conditions per place. [2021-03-26 08:29:21,849 INFO L142 LiptonReduction]: Number of co-enabled transitions 2558 [2021-03-26 08:29:21,855 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:21,855 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:21,855 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 279 [2021-03-26 08:29:21,855 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 187 transitions, 2791 flow [2021-03-26 08:29:21,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:21,856 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:21,856 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:21,856 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-03-26 08:29:21,856 INFO L428 AbstractCegarLoop]: === Iteration 41 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:21,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash 416897403, now seen corresponding path program 1 times [2021-03-26 08:29:21,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:21,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119767795] [2021-03-26 08:29:21,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:21,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:29:21,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 08:29:21,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:21,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:29:21,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 08:29:21,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:21,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:29:21,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:21,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:21,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:21,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119767795] [2021-03-26 08:29:21,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:21,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:29:21,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752789968] [2021-03-26 08:29:21,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:29:21,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:21,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:29:21,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:29:21,957 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-26 08:29:21,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 187 transitions, 2791 flow. Second operand has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:21,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:21,958 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-26 08:29:21,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:22,964 INFO L129 PetriNetUnfolder]: 6326/9517 cut-off events. [2021-03-26 08:29:22,964 INFO L130 PetriNetUnfolder]: For 138432/138453 co-relation queries the response was YES. [2021-03-26 08:29:23,014 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49467 conditions, 9517 events. 6326/9517 cut-off events. For 138432/138453 co-relation queries the response was YES. Maximal size of possible extension queue 597. Compared 57934 event pairs, 1455 based on Foata normal form. 38/7115 useless extension candidates. Maximal degree in co-relation 48438. Up to 6873 conditions per place. [2021-03-26 08:29:23,044 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 150 selfloop transitions, 5 changer transitions 35/217 dead transitions. [2021-03-26 08:29:23,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 217 transitions, 3609 flow [2021-03-26 08:29:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:29:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:29:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1372 transitions. [2021-03-26 08:29:23,045 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2021-03-26 08:29:23,046 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1372 transitions. [2021-03-26 08:29:23,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1372 transitions. [2021-03-26 08:29:23,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:23,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1372 transitions. [2021-03-26 08:29:23,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.0) internal successors, (1372), 7 states have internal predecessors, (1372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:23,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:23,048 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 348.0) internal successors, (2784), 8 states have internal predecessors, (2784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:23,048 INFO L185 Difference]: Start difference. First operand has 153 places, 187 transitions, 2791 flow. Second operand 7 states and 1372 transitions. [2021-03-26 08:29:23,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 217 transitions, 3609 flow [2021-03-26 08:29:23,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 217 transitions, 3590 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 08:29:23,248 INFO L241 Difference]: Finished difference. Result has 156 places, 181 transitions, 2706 flow [2021-03-26 08:29:23,248 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2737, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2706, PETRI_PLACES=156, PETRI_TRANSITIONS=181} [2021-03-26 08:29:23,248 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 92 predicate places. [2021-03-26 08:29:23,248 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:23,248 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 181 transitions, 2706 flow [2021-03-26 08:29:23,248 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 181 transitions, 2706 flow [2021-03-26 08:29:23,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 150 places, 181 transitions, 2706 flow [2021-03-26 08:29:23,442 INFO L129 PetriNetUnfolder]: 1924/3607 cut-off events. [2021-03-26 08:29:23,442 INFO L130 PetriNetUnfolder]: For 15015/15092 co-relation queries the response was YES. [2021-03-26 08:29:23,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9495 conditions, 3607 events. 1924/3607 cut-off events. For 15015/15092 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25772 event pairs, 4 based on Foata normal form. 38/2405 useless extension candidates. Maximal degree in co-relation 8638. Up to 1040 conditions per place. [2021-03-26 08:29:23,496 INFO L142 LiptonReduction]: Number of co-enabled transitions 2468 [2021-03-26 08:29:23,502 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:23,503 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:23,503 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 255 [2021-03-26 08:29:23,503 INFO L480 AbstractCegarLoop]: Abstraction has has 150 places, 181 transitions, 2706 flow [2021-03-26 08:29:23,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:23,503 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:23,503 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:23,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-03-26 08:29:23,503 INFO L428 AbstractCegarLoop]: === Iteration 42 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1960449529, now seen corresponding path program 2 times [2021-03-26 08:29:23,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:23,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419023432] [2021-03-26 08:29:23,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:23,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:29:23,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:29:23,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:29:23,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:23,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:23,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:23,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:29:23,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:23,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:23,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:23,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:23,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419023432] [2021-03-26 08:29:23,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:23,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:29:23,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767421597] [2021-03-26 08:29:23,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:29:23,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:29:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:29:23,649 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-26 08:29:23,649 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 181 transitions, 2706 flow. Second operand has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:23,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:23,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-26 08:29:23,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:24,923 INFO L129 PetriNetUnfolder]: 7194/10658 cut-off events. [2021-03-26 08:29:24,923 INFO L130 PetriNetUnfolder]: For 163560/163649 co-relation queries the response was YES. [2021-03-26 08:29:24,976 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55703 conditions, 10658 events. 7194/10658 cut-off events. For 163560/163649 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 64025 event pairs, 1539 based on Foata normal form. 119/7980 useless extension candidates. Maximal degree in co-relation 51881. Up to 7267 conditions per place. [2021-03-26 08:29:25,008 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 169 selfloop transitions, 25 changer transitions 2/224 dead transitions. [2021-03-26 08:29:25,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 224 transitions, 3726 flow [2021-03-26 08:29:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 08:29:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 08:29:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2120 transitions. [2021-03-26 08:29:25,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5538140020898642 [2021-03-26 08:29:25,010 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2120 transitions. [2021-03-26 08:29:25,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2120 transitions. [2021-03-26 08:29:25,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:25,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2120 transitions. [2021-03-26 08:29:25,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 192.72727272727272) internal successors, (2120), 11 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:25,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:25,013 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:25,013 INFO L185 Difference]: Start difference. First operand has 150 places, 181 transitions, 2706 flow. Second operand 11 states and 2120 transitions. [2021-03-26 08:29:25,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 224 transitions, 3726 flow [2021-03-26 08:29:25,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 224 transitions, 3657 flow, removed 9 selfloop flow, removed 10 redundant places. [2021-03-26 08:29:25,223 INFO L241 Difference]: Finished difference. Result has 153 places, 188 transitions, 2837 flow [2021-03-26 08:29:25,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2651, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2837, PETRI_PLACES=153, PETRI_TRANSITIONS=188} [2021-03-26 08:29:25,224 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 89 predicate places. [2021-03-26 08:29:25,224 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:25,224 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 188 transitions, 2837 flow [2021-03-26 08:29:25,224 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 188 transitions, 2837 flow [2021-03-26 08:29:25,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 153 places, 188 transitions, 2837 flow [2021-03-26 08:29:25,532 INFO L129 PetriNetUnfolder]: 2241/4179 cut-off events. [2021-03-26 08:29:25,532 INFO L130 PetriNetUnfolder]: For 16363/16444 co-relation queries the response was YES. [2021-03-26 08:29:25,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10479 conditions, 4179 events. 2241/4179 cut-off events. For 16363/16444 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 30554 event pairs, 5 based on Foata normal form. 49/2807 useless extension candidates. Maximal degree in co-relation 9528. Up to 1228 conditions per place. [2021-03-26 08:29:25,585 INFO L142 LiptonReduction]: Number of co-enabled transitions 2648 [2021-03-26 08:29:25,591 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:25,592 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:25,592 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 368 [2021-03-26 08:29:25,592 INFO L480 AbstractCegarLoop]: Abstraction has has 153 places, 188 transitions, 2837 flow [2021-03-26 08:29:25,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:25,592 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:25,592 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:25,593 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-03-26 08:29:25,593 INFO L428 AbstractCegarLoop]: === Iteration 43 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:25,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:25,593 INFO L82 PathProgramCache]: Analyzing trace with hash -956384849, now seen corresponding path program 2 times [2021-03-26 08:29:25,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:25,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014614393] [2021-03-26 08:29:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:25,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:29:25,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-26 08:29:25,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-26 08:29:25,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:25,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:25,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:25,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:29:25,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:25,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:25,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:25,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:25,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014614393] [2021-03-26 08:29:25,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:25,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-26 08:29:25,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737912069] [2021-03-26 08:29:25,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-26 08:29:25,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-26 08:29:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-26 08:29:25,720 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-26 08:29:25,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 188 transitions, 2837 flow. Second operand has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:25,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:25,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-26 08:29:25,721 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:26,939 INFO L129 PetriNetUnfolder]: 6582/9929 cut-off events. [2021-03-26 08:29:26,939 INFO L130 PetriNetUnfolder]: For 143216/143217 co-relation queries the response was YES. [2021-03-26 08:29:26,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51233 conditions, 9929 events. 6582/9929 cut-off events. For 143216/143217 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 61183 event pairs, 1500 based on Foata normal form. 63/7431 useless extension candidates. Maximal degree in co-relation 47532. Up to 6835 conditions per place. [2021-03-26 08:29:27,128 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 137 selfloop transitions, 16 changer transitions 40/220 dead transitions. [2021-03-26 08:29:27,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 220 transitions, 3679 flow [2021-03-26 08:29:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 08:29:27,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 08:29:27,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2119 transitions. [2021-03-26 08:29:27,130 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5535527690700105 [2021-03-26 08:29:27,130 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2119 transitions. [2021-03-26 08:29:27,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2119 transitions. [2021-03-26 08:29:27,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:27,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2119 transitions. [2021-03-26 08:29:27,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 192.63636363636363) internal successors, (2119), 11 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:27,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:27,133 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 348.0) internal successors, (4176), 12 states have internal predecessors, (4176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:27,134 INFO L185 Difference]: Start difference. First operand has 153 places, 188 transitions, 2837 flow. Second operand 11 states and 2119 transitions. [2021-03-26 08:29:27,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 220 transitions, 3679 flow [2021-03-26 08:29:27,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 220 transitions, 3638 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-26 08:29:27,312 INFO L241 Difference]: Finished difference. Result has 161 places, 178 transitions, 2673 flow [2021-03-26 08:29:27,312 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2718, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2673, PETRI_PLACES=161, PETRI_TRANSITIONS=178} [2021-03-26 08:29:27,312 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 97 predicate places. [2021-03-26 08:29:27,312 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:27,312 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 178 transitions, 2673 flow [2021-03-26 08:29:27,312 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 178 transitions, 2673 flow [2021-03-26 08:29:27,313 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 155 places, 178 transitions, 2673 flow [2021-03-26 08:29:27,511 INFO L129 PetriNetUnfolder]: 1920/3581 cut-off events. [2021-03-26 08:29:27,512 INFO L130 PetriNetUnfolder]: For 14898/14968 co-relation queries the response was YES. [2021-03-26 08:29:27,530 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 3581 events. 1920/3581 cut-off events. For 14898/14968 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25404 event pairs, 5 based on Foata normal form. 49/2423 useless extension candidates. Maximal degree in co-relation 8474. Up to 1044 conditions per place. [2021-03-26 08:29:27,558 INFO L142 LiptonReduction]: Number of co-enabled transitions 2468 [2021-03-26 08:29:27,564 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:27,565 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:27,565 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 253 [2021-03-26 08:29:27,565 INFO L480 AbstractCegarLoop]: Abstraction has has 155 places, 178 transitions, 2673 flow [2021-03-26 08:29:27,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 188.8) internal successors, (1888), 10 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:27,565 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:27,565 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:27,565 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-03-26 08:29:27,565 INFO L428 AbstractCegarLoop]: === Iteration 44 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:27,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:27,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1349041989, now seen corresponding path program 3 times [2021-03-26 08:29:27,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:27,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201620206] [2021-03-26 08:29:27,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:27,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:29:27,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:27,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:27,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 08:29:27,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:27,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:27,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:29:27,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:29:27,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:29:27,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:27,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:27,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:27,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201620206] [2021-03-26 08:29:27,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:27,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-26 08:29:27,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236307580] [2021-03-26 08:29:27,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 08:29:27,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 08:29:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-26 08:29:27,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-26 08:29:27,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 178 transitions, 2673 flow. Second operand has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:27,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:27,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-26 08:29:27,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:28,657 INFO L129 PetriNetUnfolder]: 5322/7952 cut-off events. [2021-03-26 08:29:28,657 INFO L130 PetriNetUnfolder]: For 123654/123717 co-relation queries the response was YES. [2021-03-26 08:29:28,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40240 conditions, 7952 events. 5322/7952 cut-off events. For 123654/123717 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 45516 event pairs, 1094 based on Foata normal form. 243/6165 useless extension candidates. Maximal degree in co-relation 40197. Up to 2759 conditions per place. [2021-03-26 08:29:28,706 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 127 selfloop transitions, 33 changer transitions 37/222 dead transitions. [2021-03-26 08:29:28,707 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 222 transitions, 3719 flow [2021-03-26 08:29:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 08:29:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 08:29:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1569 transitions. [2021-03-26 08:29:28,709 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5635775862068966 [2021-03-26 08:29:28,709 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1569 transitions. [2021-03-26 08:29:28,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1569 transitions. [2021-03-26 08:29:28,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:28,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1569 transitions. [2021-03-26 08:29:28,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 196.125) internal successors, (1569), 8 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:28,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:28,712 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 348.0) internal successors, (3132), 9 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:28,712 INFO L185 Difference]: Start difference. First operand has 155 places, 178 transitions, 2673 flow. Second operand 8 states and 1569 transitions. [2021-03-26 08:29:28,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 222 transitions, 3719 flow [2021-03-26 08:29:28,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 222 transitions, 3560 flow, removed 30 selfloop flow, removed 17 redundant places. [2021-03-26 08:29:28,856 INFO L241 Difference]: Finished difference. Result has 144 places, 129 transitions, 1780 flow [2021-03-26 08:29:28,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1780, PETRI_PLACES=144, PETRI_TRANSITIONS=129} [2021-03-26 08:29:28,856 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 80 predicate places. [2021-03-26 08:29:28,856 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:28,856 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 129 transitions, 1780 flow [2021-03-26 08:29:28,857 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 129 transitions, 1780 flow [2021-03-26 08:29:28,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 129 transitions, 1780 flow [2021-03-26 08:29:28,973 INFO L129 PetriNetUnfolder]: 1314/2550 cut-off events. [2021-03-26 08:29:28,974 INFO L130 PetriNetUnfolder]: For 8218/8249 co-relation queries the response was YES. [2021-03-26 08:29:28,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6059 conditions, 2550 events. 1314/2550 cut-off events. For 8218/8249 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 17638 event pairs, 3 based on Foata normal form. 9/1653 useless extension candidates. Maximal degree in co-relation 5603. Up to 804 conditions per place. [2021-03-26 08:29:29,000 INFO L142 LiptonReduction]: Number of co-enabled transitions 1524 [2021-03-26 08:29:29,980 INFO L154 LiptonReduction]: Checked pairs total: 120 [2021-03-26 08:29:29,980 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 08:29:29,980 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1124 [2021-03-26 08:29:29,981 INFO L480 AbstractCegarLoop]: Abstraction has has 143 places, 129 transitions, 1788 flow [2021-03-26 08:29:29,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:29,981 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:29,981 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:29,981 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-03-26 08:29:29,981 INFO L428 AbstractCegarLoop]: === Iteration 45 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:29,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:29,984 INFO L82 PathProgramCache]: Analyzing trace with hash 2005765651, now seen corresponding path program 1 times [2021-03-26 08:29:29,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:29,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230189949] [2021-03-26 08:29:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:30,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 08:29:30,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 08:29:30,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 08:29:30,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:29:30,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:30,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-26 08:29:30,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-26 08:29:30,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 08:29:30,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:30,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:30,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:30,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:30,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:30,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230189949] [2021-03-26 08:29:30,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:30,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-26 08:29:30,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117302113] [2021-03-26 08:29:30,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-26 08:29:30,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:30,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-26 08:29:30,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-03-26 08:29:30,172 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 353 [2021-03-26 08:29:30,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 129 transitions, 1788 flow. Second operand has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:30,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:30,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 353 [2021-03-26 08:29:30,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:31,186 INFO L129 PetriNetUnfolder]: 4340/6911 cut-off events. [2021-03-26 08:29:31,186 INFO L130 PetriNetUnfolder]: For 86750/86770 co-relation queries the response was YES. [2021-03-26 08:29:31,221 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32485 conditions, 6911 events. 4340/6911 cut-off events. For 86750/86770 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 44256 event pairs, 1069 based on Foata normal form. 79/5219 useless extension candidates. Maximal degree in co-relation 29946. Up to 4276 conditions per place. [2021-03-26 08:29:31,230 INFO L132 encePairwiseOnDemand]: 342/353 looper letters, 63 selfloop transitions, 25 changer transitions 51/167 dead transitions. [2021-03-26 08:29:31,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 2649 flow [2021-03-26 08:29:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-03-26 08:29:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2021-03-26 08:29:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2299 transitions. [2021-03-26 08:29:31,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5427289896128423 [2021-03-26 08:29:31,232 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2299 transitions. [2021-03-26 08:29:31,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2299 transitions. [2021-03-26 08:29:31,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:31,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2299 transitions. [2021-03-26 08:29:31,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 191.58333333333334) internal successors, (2299), 12 states have internal predecessors, (2299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:31,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:31,236 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 353.0) internal successors, (4589), 13 states have internal predecessors, (4589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:31,236 INFO L185 Difference]: Start difference. First operand has 143 places, 129 transitions, 1788 flow. Second operand 12 states and 2299 transitions. [2021-03-26 08:29:31,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 2649 flow [2021-03-26 08:29:31,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 167 transitions, 2530 flow, removed 27 selfloop flow, removed 6 redundant places. [2021-03-26 08:29:31,331 INFO L241 Difference]: Finished difference. Result has 151 places, 114 transitions, 1538 flow [2021-03-26 08:29:31,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1693, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1538, PETRI_PLACES=151, PETRI_TRANSITIONS=114} [2021-03-26 08:29:31,331 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 87 predicate places. [2021-03-26 08:29:31,331 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:31,331 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 114 transitions, 1538 flow [2021-03-26 08:29:31,332 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 114 transitions, 1538 flow [2021-03-26 08:29:31,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 114 transitions, 1538 flow [2021-03-26 08:29:31,402 INFO L129 PetriNetUnfolder]: 689/1393 cut-off events. [2021-03-26 08:29:31,402 INFO L130 PetriNetUnfolder]: For 6195/6214 co-relation queries the response was YES. [2021-03-26 08:29:31,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4103 conditions, 1393 events. 689/1393 cut-off events. For 6195/6214 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 8718 event pairs, 0 based on Foata normal form. 12/954 useless extension candidates. Maximal degree in co-relation 3995. Up to 388 conditions per place. [2021-03-26 08:29:31,418 INFO L142 LiptonReduction]: Number of co-enabled transitions 1420 [2021-03-26 08:29:31,588 INFO L154 LiptonReduction]: Checked pairs total: 23 [2021-03-26 08:29:31,588 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 08:29:31,589 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 258 [2021-03-26 08:29:31,589 INFO L480 AbstractCegarLoop]: Abstraction has has 146 places, 113 transitions, 1524 flow [2021-03-26 08:29:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 187.63636363636363) internal successors, (2064), 11 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:31,589 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:31,589 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:31,589 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-03-26 08:29:31,590 INFO L428 AbstractCegarLoop]: === Iteration 46 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:31,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1939492427, now seen corresponding path program 3 times [2021-03-26 08:29:31,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:31,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373296374] [2021-03-26 08:29:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:31,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:29:31,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-26 08:29:31,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-26 08:29:31,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-26 08:29:31,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 08:29:31,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:31,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:31,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:29:31,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 08:29:31,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 08:29:31,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:31,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:31,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:31,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373296374] [2021-03-26 08:29:31,809 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:31,809 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 08:29:31,809 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975934546] [2021-03-26 08:29:31,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 08:29:31,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 08:29:31,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-26 08:29:31,812 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 354 [2021-03-26 08:29:31,813 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 113 transitions, 1524 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:31,813 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:31,813 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 354 [2021-03-26 08:29:31,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:32,430 INFO L129 PetriNetUnfolder]: 2723/4363 cut-off events. [2021-03-26 08:29:32,430 INFO L130 PetriNetUnfolder]: For 50335/50342 co-relation queries the response was YES. [2021-03-26 08:29:32,451 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22155 conditions, 4363 events. 2723/4363 cut-off events. For 50335/50342 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 26912 event pairs, 606 based on Foata normal form. 49/3417 useless extension candidates. Maximal degree in co-relation 21776. Up to 2365 conditions per place. [2021-03-26 08:29:32,458 INFO L132 encePairwiseOnDemand]: 341/354 looper letters, 77 selfloop transitions, 11 changer transitions 30/146 dead transitions. [2021-03-26 08:29:32,458 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 146 transitions, 2209 flow [2021-03-26 08:29:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 08:29:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 08:29:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1155 transitions. [2021-03-26 08:29:32,459 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5437853107344632 [2021-03-26 08:29:32,460 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1155 transitions. [2021-03-26 08:29:32,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1155 transitions. [2021-03-26 08:29:32,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:32,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1155 transitions. [2021-03-26 08:29:32,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:32,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 354.0) internal successors, (2478), 7 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:32,461 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 354.0) internal successors, (2478), 7 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:32,462 INFO L185 Difference]: Start difference. First operand has 146 places, 113 transitions, 1524 flow. Second operand 6 states and 1155 transitions. [2021-03-26 08:29:32,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 146 transitions, 2209 flow [2021-03-26 08:29:32,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 146 transitions, 1971 flow, removed 18 selfloop flow, removed 11 redundant places. [2021-03-26 08:29:32,522 INFO L241 Difference]: Finished difference. Result has 142 places, 108 transitions, 1298 flow [2021-03-26 08:29:32,522 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=1338, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1298, PETRI_PLACES=142, PETRI_TRANSITIONS=108} [2021-03-26 08:29:32,522 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 78 predicate places. [2021-03-26 08:29:32,522 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:32,523 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 108 transitions, 1298 flow [2021-03-26 08:29:32,523 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 108 transitions, 1298 flow [2021-03-26 08:29:32,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 139 places, 108 transitions, 1298 flow [2021-03-26 08:29:32,595 INFO L129 PetriNetUnfolder]: 772/1567 cut-off events. [2021-03-26 08:29:32,595 INFO L130 PetriNetUnfolder]: For 4546/4548 co-relation queries the response was YES. [2021-03-26 08:29:32,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 1567 events. 772/1567 cut-off events. For 4546/4548 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 10126 event pairs, 2 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 3393. Up to 456 conditions per place. [2021-03-26 08:29:32,612 INFO L142 LiptonReduction]: Number of co-enabled transitions 1264 [2021-03-26 08:29:32,615 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:32,615 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:32,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 93 [2021-03-26 08:29:32,615 INFO L480 AbstractCegarLoop]: Abstraction has has 139 places, 108 transitions, 1298 flow [2021-03-26 08:29:32,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:32,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 08:29:32,616 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 08:29:32,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-03-26 08:29:32,616 INFO L428 AbstractCegarLoop]: === Iteration 47 === [thread0Err1INUSE_VIOLATION, thread0Thread1of1ForFork4Err0INUSE_VIOLATION, thread0Err6INUSE_VIOLATION, thread0Err5INUSE_VIOLATION, thread0Thread1of1ForFork4Err10INUSE_VIOLATION, thread0Thread1of1ForFork4Err3INUSE_VIOLATION, thread0Thread1of1ForFork4Err9INUSE_VIOLATION, thread0Err8INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, thread0Thread1of1ForFork4Err7INUSE_VIOLATION, thread0Err2INUSE_VIOLATION, ULTIMATE.startErr4INUSE_VIOLATION]=== [2021-03-26 08:29:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 08:29:32,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1291727909, now seen corresponding path program 2 times [2021-03-26 08:29:32,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 08:29:32,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465953351] [2021-03-26 08:29:32,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 08:29:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 08:29:32,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 08:29:32,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 08:29:32,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-26 08:29:32,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 08:29:32,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 08:29:32,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-26 08:29:32,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 08:29:32,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 08:29:32,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 08:29:32,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 08:29:32,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 08:29:32,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 08:29:32,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 08:29:32,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 08:29:32,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465953351] [2021-03-26 08:29:32,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 08:29:32,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-26 08:29:32,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571356125] [2021-03-26 08:29:32,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-26 08:29:32,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 08:29:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-26 08:29:32,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2021-03-26 08:29:32,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 354 [2021-03-26 08:29:32,784 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 108 transitions, 1298 flow. Second operand has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:32,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 08:29:32,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 354 [2021-03-26 08:29:32,784 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 08:29:33,142 INFO L129 PetriNetUnfolder]: 1295/2324 cut-off events. [2021-03-26 08:29:33,142 INFO L130 PetriNetUnfolder]: For 18281/18288 co-relation queries the response was YES. [2021-03-26 08:29:33,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10131 conditions, 2324 events. 1295/2324 cut-off events. For 18281/18288 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 14285 event pairs, 270 based on Foata normal form. 243/2030 useless extension candidates. Maximal degree in co-relation 10100. Up to 1038 conditions per place. [2021-03-26 08:29:33,152 INFO L132 encePairwiseOnDemand]: 347/354 looper letters, 0 selfloop transitions, 0 changer transitions 117/117 dead transitions. [2021-03-26 08:29:33,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 117 transitions, 1591 flow [2021-03-26 08:29:33,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 08:29:33,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 08:29:33,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1325 transitions. [2021-03-26 08:29:33,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5347054075867635 [2021-03-26 08:29:33,153 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1325 transitions. [2021-03-26 08:29:33,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1325 transitions. [2021-03-26 08:29:33,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 08:29:33,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1325 transitions. [2021-03-26 08:29:33,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 189.28571428571428) internal successors, (1325), 7 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:33,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 354.0) internal successors, (2832), 8 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:33,155 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 354.0) internal successors, (2832), 8 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:33,155 INFO L185 Difference]: Start difference. First operand has 139 places, 108 transitions, 1298 flow. Second operand 7 states and 1325 transitions. [2021-03-26 08:29:33,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 117 transitions, 1591 flow [2021-03-26 08:29:33,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 117 transitions, 1406 flow, removed 25 selfloop flow, removed 11 redundant places. [2021-03-26 08:29:33,175 INFO L241 Difference]: Finished difference. Result has 128 places, 0 transitions, 0 flow [2021-03-26 08:29:33,175 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=354, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=128, PETRI_TRANSITIONS=0} [2021-03-26 08:29:33,175 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 64 predicate places. [2021-03-26 08:29:33,175 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 08:29:33,175 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 0 transitions, 0 flow [2021-03-26 08:29:33,176 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 0 transitions, 0 flow [2021-03-26 08:29:33,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-26 08:29:33,176 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-26 08:29:33,176 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 08:29:33,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2021-03-26 08:29:33,176 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-26 08:29:33,176 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 08:29:33,176 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 08:29:33,176 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-03-26 08:29:33,176 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-26 08:29:33,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 185.5) internal successors, (2226), 12 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 08:29:33,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-03-26 08:29:33,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 08:29:33 BasicIcfg [2021-03-26 08:29:33,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 08:29:33,180 INFO L168 Benchmark]: Toolchain (without parser) took 151132.09 ms. Allocated memory was 255.9 MB in the beginning and 15.6 GB in the end (delta: 15.4 GB). Free memory was 236.3 MB in the beginning and 6.5 GB in the end (delta: -6.3 GB). Peak memory consumption was 9.1 GB. Max. memory is 16.0 GB. [2021-03-26 08:29:33,180 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 08:29:33,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 776.50 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 236.3 MB in the beginning and 328.7 MB in the end (delta: -92.4 MB). Peak memory consumption was 56.3 MB. Max. memory is 16.0 GB. [2021-03-26 08:29:33,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.99 ms. Allocated memory is still 350.2 MB. Free memory was 328.7 MB in the beginning and 326.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 08:29:33,181 INFO L168 Benchmark]: Boogie Preprocessor took 33.81 ms. Allocated memory is still 350.2 MB. Free memory was 326.7 MB in the beginning and 324.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 08:29:33,181 INFO L168 Benchmark]: RCFGBuilder took 528.36 ms. Allocated memory is still 350.2 MB. Free memory was 324.6 MB in the beginning and 297.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2021-03-26 08:29:33,181 INFO L168 Benchmark]: TraceAbstraction took 149727.94 ms. Allocated memory was 350.2 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 296.3 MB in the beginning and 6.5 GB in the end (delta: -6.2 GB). Peak memory consumption was 9.0 GB. Max. memory is 16.0 GB. [2021-03-26 08:29:33,181 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 776.50 ms. Allocated memory was 255.9 MB in the beginning and 350.2 MB in the end (delta: 94.4 MB). Free memory was 236.3 MB in the beginning and 328.7 MB in the end (delta: -92.4 MB). Peak memory consumption was 56.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 59.99 ms. Allocated memory is still 350.2 MB. Free memory was 328.7 MB in the beginning and 326.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 33.81 ms. Allocated memory is still 350.2 MB. Free memory was 326.7 MB in the beginning and 324.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 528.36 ms. Allocated memory is still 350.2 MB. Free memory was 324.6 MB in the beginning and 297.4 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 149727.94 ms. Allocated memory was 350.2 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 296.3 MB in the beginning and 6.5 GB in the end (delta: -6.2 GB). Peak memory consumption was 9.0 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2188.4ms, 125 PlacesBefore, 64 PlacesAfterwards, 147 TransitionsBefore, 85 TransitionsAfterwards, 4982 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, 2660 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2309, positive: 2302, positive conditional: 2302, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2309, positive: 2302, positive conditional: 0, positive unconditional: 2302, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2309, positive: 2302, positive conditional: 0, positive unconditional: 2302, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2161, positive: 2154, positive conditional: 0, positive unconditional: 2154, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2161, positive: 2152, positive conditional: 0, positive unconditional: 2152, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2309, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2161, unknown conditional: 0, unknown unconditional: 2161] , Statistics on independence cache: Total cache size (in pairs): 2161, Positive cache size: 2154, Positive conditional cache size: 0, Positive unconditional cache size: 2154, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1373.3ms, 62 PlacesBefore, 50 PlacesAfterwards, 86 TransitionsBefore, 75 TransitionsAfterwards, 1484 CoEnabledTransitionPairs, 4 FixpointIterations, 2 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 323 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, positive: 244, positive conditional: 244, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, positive: 244, positive conditional: 2, positive unconditional: 242, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 244, positive conditional: 2, positive unconditional: 242, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 207, positive: 206, positive conditional: 2, positive unconditional: 204, 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: 207, positive: 206, positive conditional: 0, positive unconditional: 206, 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: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 207, unknown conditional: 2, unknown unconditional: 205] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.6ms, 54 PlacesBefore, 54 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.9ms, 61 PlacesBefore, 61 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 1222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 263.0ms, 67 PlacesBefore, 67 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 1914 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 276.4ms, 74 PlacesBefore, 74 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 1910 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 231.8ms, 79 PlacesBefore, 79 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 1902 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 230.6ms, 83 PlacesBefore, 81 PlacesAfterwards, 115 TransitionsBefore, 115 TransitionsAfterwards, 2076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 273.6ms, 82 PlacesBefore, 82 PlacesAfterwards, 124 TransitionsBefore, 124 TransitionsAfterwards, 2306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 229.0ms, 90 PlacesBefore, 88 PlacesAfterwards, 113 TransitionsBefore, 113 TransitionsAfterwards, 2216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 310.2ms, 92 PlacesBefore, 92 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 2482 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 282.6ms, 95 PlacesBefore, 95 PlacesAfterwards, 133 TransitionsBefore, 133 TransitionsAfterwards, 2512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 361.3ms, 102 PlacesBefore, 102 PlacesAfterwards, 151 TransitionsBefore, 151 TransitionsAfterwards, 2734 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 388.1ms, 116 PlacesBefore, 116 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 2894 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 430.7ms, 127 PlacesBefore, 127 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 2534 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 657.1ms, 128 PlacesBefore, 128 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 2660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 603.5ms, 133 PlacesBefore, 133 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 2778 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 750.3ms, 137 PlacesBefore, 137 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 2762 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 639.1ms, 142 PlacesBefore, 142 PlacesAfterwards, 183 TransitionsBefore, 183 TransitionsAfterwards, 2688 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 765.2ms, 147 PlacesBefore, 147 PlacesAfterwards, 216 TransitionsBefore, 216 TransitionsAfterwards, 3576 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 914.3ms, 156 PlacesBefore, 156 PlacesAfterwards, 229 TransitionsBefore, 229 TransitionsAfterwards, 3876 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 985.0ms, 162 PlacesBefore, 162 PlacesAfterwards, 228 TransitionsBefore, 228 TransitionsAfterwards, 3864 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 984.1ms, 166 PlacesBefore, 166 PlacesAfterwards, 233 TransitionsBefore, 233 TransitionsAfterwards, 4012 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1043.1ms, 171 PlacesBefore, 171 PlacesAfterwards, 247 TransitionsBefore, 247 TransitionsAfterwards, 4228 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1039.3ms, 175 PlacesBefore, 175 PlacesAfterwards, 251 TransitionsBefore, 251 TransitionsAfterwards, 4244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1126.0ms, 182 PlacesBefore, 182 PlacesAfterwards, 264 TransitionsBefore, 264 TransitionsAfterwards, 4438 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 965.7ms, 188 PlacesBefore, 188 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 4392 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1048.5ms, 193 PlacesBefore, 193 PlacesAfterwards, 253 TransitionsBefore, 253 TransitionsAfterwards, 4176 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1019.8ms, 192 PlacesBefore, 192 PlacesAfterwards, 250 TransitionsBefore, 250 TransitionsAfterwards, 4018 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 938.4ms, 197 PlacesBefore, 197 PlacesAfterwards, 254 TransitionsBefore, 254 TransitionsAfterwards, 3818 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 935.2ms, 203 PlacesBefore, 203 PlacesAfterwards, 256 TransitionsBefore, 256 TransitionsAfterwards, 3754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1061.4ms, 210 PlacesBefore, 210 PlacesAfterwards, 261 TransitionsBefore, 261 TransitionsAfterwards, 3834 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 957.7ms, 204 PlacesBefore, 204 PlacesAfterwards, 244 TransitionsBefore, 244 TransitionsAfterwards, 3356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 888.0ms, 206 PlacesBefore, 206 PlacesAfterwards, 235 TransitionsBefore, 235 TransitionsAfterwards, 3084 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 473.3ms, 196 PlacesBefore, 180 PlacesAfterwards, 214 TransitionsBefore, 214 TransitionsAfterwards, 2804 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 351.2ms, 174 PlacesBefore, 166 PlacesAfterwards, 194 TransitionsBefore, 194 TransitionsAfterwards, 2616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 284.7ms, 163 PlacesBefore, 156 PlacesAfterwards, 172 TransitionsBefore, 172 TransitionsAfterwards, 2428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 194.5ms, 155 PlacesBefore, 145 PlacesAfterwards, 157 TransitionsBefore, 157 TransitionsAfterwards, 2242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 235.1ms, 143 PlacesBefore, 141 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 2340 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 288.2ms, 150 PlacesBefore, 148 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 2600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 278.7ms, 153 PlacesBefore, 153 PlacesAfterwards, 187 TransitionsBefore, 187 TransitionsAfterwards, 2558 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 254.2ms, 156 PlacesBefore, 150 PlacesAfterwards, 181 TransitionsBefore, 181 TransitionsAfterwards, 2468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 367.3ms, 153 PlacesBefore, 153 PlacesAfterwards, 188 TransitionsBefore, 188 TransitionsAfterwards, 2648 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 252.1ms, 161 PlacesBefore, 155 PlacesAfterwards, 178 TransitionsBefore, 178 TransitionsAfterwards, 2468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2368, Positive cache size: 2360, Positive conditional cache size: 2, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1123.4ms, 144 PlacesBefore, 143 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1524 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 120 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 120, positive conditional: 120, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, positive: 48, positive conditional: 48, 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: 48, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, positive: 51, positive conditional: 51, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 72, positive conditional: 72, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 48, unknown conditional: 48, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2416, Positive cache size: 2408, Positive conditional cache size: 50, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 256.9ms, 151 PlacesBefore, 146 PlacesAfterwards, 114 TransitionsBefore, 113 TransitionsAfterwards, 1420 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 23 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 23, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 23, positive: 23, positive conditional: 23, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 23, positive: 23, positive conditional: 23, 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): 2416, Positive cache size: 2408, Positive conditional cache size: 50, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.2ms, 142 PlacesBefore, 139 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 1264 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2416, Positive cache size: 2408, Positive conditional cache size: 50, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5ms, 128 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2416, Positive cache size: 2408, Positive conditional cache size: 50, Positive unconditional cache size: 2358, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Eliminated conditions: 0 - PositiveResult [Line: 1123]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 149497.9ms, OverallIterations: 47, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 114423.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2334.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1252 SDtfs, 2414 SDslu, 2747 SDs, 0 SdLazy, 10553 SolverSat, 998 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5837.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 592 GetRequests, 49 SyntacticMatches, 17 SemanticMatches, 526 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 9375.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5123occurred in iteration=31, InterpolantAutomatonStates: 381, 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: 79.0ms SsaConstructionTime, 378.3ms SatisfiabilityAnalysisTime, 5315.3ms InterpolantComputationTime, 900 NumberOfCodeBlocks, 900 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 853 ConstructedInterpolants, 0 QuantifiedInterpolants, 12624 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 47 InterpolantComputations, 47 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...