/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-RepeatedVariableLbe.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-25 03:07:32,336 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 03:07:32,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 03:07:32,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 03:07:32,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 03:07:32,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 03:07:32,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 03:07:32,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 03:07:32,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 03:07:32,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 03:07:32,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 03:07:32,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 03:07:32,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 03:07:32,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 03:07:32,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 03:07:32,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 03:07:32,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 03:07:32,404 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 03:07:32,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 03:07:32,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 03:07:32,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 03:07:32,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 03:07:32,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 03:07:32,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 03:07:32,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 03:07:32,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 03:07:32,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 03:07:32,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 03:07:32,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 03:07:32,427 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 03:07:32,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 03:07:32,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 03:07:32,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 03:07:32,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 03:07:32,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 03:07:32,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 03:07:32,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 03:07:32,432 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 03:07:32,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 03:07:32,433 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 03:07:32,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 03:07:32,437 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-RepeatedVariableLbe.epf [2021-03-25 03:07:32,471 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 03:07:32,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 03:07:32,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 03:07:32,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 03:07:32,476 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 03:07:32,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 03:07:32,476 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 03:07:32,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 03:07:32,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 03:07:32,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 03:07:32,478 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 03:07:32,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 03:07:32,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 03:07:32,478 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 03:07:32,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 03:07:32,478 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 03:07:32,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 03:07:32,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 03:07:32,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 03:07:32,479 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 03:07:32,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 03:07:32,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 03:07:32,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 03:07:32,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 03:07:32,480 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 03:07:32,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 03:07:32,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 03:07:32,481 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 03:07:32,481 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 03:07:32,481 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 03:07:32,481 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-25 03:07:32,798 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 03:07:32,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 03:07:32,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 03:07:32,818 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 03:07:32,818 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 03:07:32,819 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-25 03:07:32,875 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b4f8cd1/1d61963d9333402e8a9875cf1c65b52a/FLAG7cdd8c697 [2021-03-25 03:07:33,423 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 03:07:33,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2021-03-25 03:07:33,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b4f8cd1/1d61963d9333402e8a9875cf1c65b52a/FLAG7cdd8c697 [2021-03-25 03:07:33,893 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42b4f8cd1/1d61963d9333402e8a9875cf1c65b52a [2021-03-25 03:07:33,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 03:07:33,897 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 03:07:33,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 03:07:33,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 03:07:33,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 03:07:33,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:07:33" (1/1) ... [2021-03-25 03:07:33,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@478a3901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:33, skipping insertion in model container [2021-03-25 03:07:33,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:07:33" (1/1) ... [2021-03-25 03:07:33,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 03:07:33,958 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 03:07:34,104 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 03:07:34,264 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-25 03:07:34,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 03:07:34,318 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 03:07:34,331 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-03-25 03:07:34,352 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-25 03:07:34,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 03:07:34,524 INFO L208 MainTranslator]: Completed translation [2021-03-25 03:07:34,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34 WrapperNode [2021-03-25 03:07:34,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 03:07:34,525 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 03:07:34,525 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 03:07:34,525 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 03:07:34,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 03:07:34,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 03:07:34,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 03:07:34,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 03:07:34,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... [2021-03-25 03:07:34,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 03:07:34,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 03:07:34,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 03:07:34,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 03:07:34,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 03:07:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 03:07:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 03:07:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 03:07:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 03:07:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-25 03:07:34,649 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2021-03-25 03:07:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2021-03-25 03:07:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 03:07:34,650 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 03:07:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 03:07:34,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 03:07:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 03:07:34,651 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 03:07:34,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 03:07:34,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-03-25 03:07:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 03:07:34,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 03:07:34,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 03:07:34,657 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 03:07:35,091 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 03:07:35,092 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-03-25 03:07:35,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:07:35 BoogieIcfgContainer [2021-03-25 03:07:35,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 03:07:35,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 03:07:35,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 03:07:35,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 03:07:35,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:07:33" (1/3) ... [2021-03-25 03:07:35,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c23079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:07:35, skipping insertion in model container [2021-03-25 03:07:35,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:07:34" (2/3) ... [2021-03-25 03:07:35,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c23079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:07:35, skipping insertion in model container [2021-03-25 03:07:35,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:07:35" (3/3) ... [2021-03-25 03:07:35,100 INFO L111 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2021-03-25 03:07:35,105 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 03:07:35,109 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 03:07:35,109 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 03:07:35,178 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,179 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,179 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,179 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,179 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,179 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,179 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,180 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,180 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,180 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,180 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,180 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,180 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,181 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,181 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,181 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,181 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,181 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,181 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,181 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,182 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,183 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,183 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,183 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,183 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,183 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,183 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,184 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,184 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,184 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,184 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,184 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,184 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,185 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,186 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,187 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,188 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,189 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,190 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,191 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,192 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,193 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,194 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,195 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,198 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,199 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,203 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,203 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,204 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,205 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,206 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,207 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,207 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,207 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,207 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,208 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,209 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,209 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,210 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,212 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,213 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,213 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,213 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,213 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,214 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,215 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,216 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,216 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,219 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,220 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,220 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,220 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,220 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,220 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,220 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,221 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,221 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,221 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,221 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,221 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,221 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,221 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,222 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,224 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,224 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,224 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,225 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,229 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,230 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,230 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,230 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,231 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,231 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,232 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,232 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,234 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,234 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,236 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,245 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,246 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t4~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t3~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t1~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe thread0Thread1of1ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,247 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t2~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,248 WARN L313 ript$VariableManager]: TermVariabe |thread0Thread1of1ForFork4_~#t5~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,253 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,253 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,254 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,254 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,254 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,255 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,255 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,255 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~malloc6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,256 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,257 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,260 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,260 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,260 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,261 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,262 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,263 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,263 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,263 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,272 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,273 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 03:07:35,362 INFO L149 ThreadInstanceAdder]: Constructed 121 joinOtherThreadTransitions. [2021-03-25 03:07:35,378 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2021-03-25 03:07:35,395 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 03:07:35,395 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 03:07:35,395 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 03:07:35,395 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 03:07:35,395 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 03:07:35,395 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 03:07:35,395 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 03:07:35,396 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 03:07:35,409 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 173 places, 255 transitions, 890 flow [2021-03-25 03:07:35,523 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-25 03:07:35,523 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 03:07:35,537 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-25 03:07:35,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 255 transitions, 890 flow [2021-03-25 03:07:35,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 147 transitions, 447 flow [2021-03-25 03:07:35,545 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:35,553 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-25 03:07:35,556 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 147 transitions, 447 flow [2021-03-25 03:07:35,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 147 transitions, 447 flow [2021-03-25 03:07:35,620 INFO L129 PetriNetUnfolder]: 67/316 cut-off events. [2021-03-25 03:07:35,620 INFO L130 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2021-03-25 03:07:35,623 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-25 03:07:35,634 INFO L142 LiptonReduction]: Number of co-enabled transitions 4982 [2021-03-25 03:07:37,692 INFO L154 LiptonReduction]: Checked pairs total: 2660 [2021-03-25 03:07:37,692 INFO L156 LiptonReduction]: Total number of compositions: 70 [2021-03-25 03:07:37,694 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2150 [2021-03-25 03:07:37,710 INFO L129 PetriNetUnfolder]: 2/21 cut-off events. [2021-03-25 03:07:37,711 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 03:07:37,711 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:37,711 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:37,712 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-25 03:07:37,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1880774221, now seen corresponding path program 1 times [2021-03-25 03:07:37,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:37,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476468390] [2021-03-25 03:07:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:37,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:37,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:37,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:37,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:07:37,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:37,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:07:37,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:37,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:37,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:37,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:38,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:38,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:38,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:38,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:38,010 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-25 03:07:38,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476468390] [2021-03-25 03:07:38,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:38,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:07:38,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956293358] [2021-03-25 03:07:38,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:07:38,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:38,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:07:38,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:07:38,032 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 336 [2021-03-25 03:07:38,036 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-25 03:07:38,037 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:38,037 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 336 [2021-03-25 03:07:38,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:38,779 INFO L129 PetriNetUnfolder]: 3307/4976 cut-off events. [2021-03-25 03:07:38,780 INFO L130 PetriNetUnfolder]: For 1440/1445 co-relation queries the response was YES. [2021-03-25 03:07:38,797 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-25 03:07:38,829 INFO L132 encePairwiseOnDemand]: 325/336 looper letters, 69 selfloop transitions, 7 changer transitions 4/121 dead transitions. [2021-03-25 03:07:38,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 121 transitions, 588 flow [2021-03-25 03:07:38,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:07:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:07:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1620 transitions. [2021-03-25 03:07:38,848 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6026785714285714 [2021-03-25 03:07:38,849 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1620 transitions. [2021-03-25 03:07:38,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1620 transitions. [2021-03-25 03:07:38,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:38,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1620 transitions. [2021-03-25 03:07:38,862 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-25 03:07:38,873 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-25 03:07:38,875 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-25 03:07:38,877 INFO L185 Difference]: Start difference. First operand has 64 places, 85 transitions, 323 flow. Second operand 8 states and 1620 transitions. [2021-03-25 03:07:38,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 121 transitions, 588 flow [2021-03-25 03:07:38,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 121 transitions, 464 flow, removed 0 selfloop flow, removed 12 redundant places. [2021-03-25 03:07:38,897 INFO L241 Difference]: Finished difference. Result has 62 places, 86 transitions, 256 flow [2021-03-25 03:07:38,899 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-25 03:07:38,899 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -2 predicate places. [2021-03-25 03:07:38,899 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:38,900 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-25 03:07:38,901 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 86 transitions, 256 flow [2021-03-25 03:07:38,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 86 transitions, 256 flow [2021-03-25 03:07:38,921 INFO L129 PetriNetUnfolder]: 115/277 cut-off events. [2021-03-25 03:07:38,922 INFO L130 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2021-03-25 03:07:38,923 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-25 03:07:38,926 INFO L142 LiptonReduction]: Number of co-enabled transitions 1484 [2021-03-25 03:07:39,689 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-25 03:07:39,838 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-03-25 03:07:40,102 INFO L154 LiptonReduction]: Checked pairs total: 323 [2021-03-25 03:07:40,102 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 03:07:40,103 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1204 [2021-03-25 03:07:40,103 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 75 transitions, 234 flow [2021-03-25 03:07:40,105 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-25 03:07:40,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:40,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:40,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 03:07:40,105 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-25 03:07:40,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1911423025, now seen corresponding path program 1 times [2021-03-25 03:07:40,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:40,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174715796] [2021-03-25 03:07:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:40,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:40,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:40,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:40,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:40,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:40,197 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-25 03:07:40,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174715796] [2021-03-25 03:07:40,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:40,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:07:40,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024753163] [2021-03-25 03:07:40,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:07:40,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:40,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:07:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:07:40,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-25 03:07:40,202 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-25 03:07:40,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:40,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-25 03:07:40,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:40,729 INFO L129 PetriNetUnfolder]: 4056/5694 cut-off events. [2021-03-25 03:07:40,730 INFO L130 PetriNetUnfolder]: For 1025/1025 co-relation queries the response was YES. [2021-03-25 03:07:40,743 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-25 03:07:40,769 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 58 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2021-03-25 03:07:40,770 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 103 transitions, 442 flow [2021-03-25 03:07:40,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 03:07:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 03:07:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1473 transitions. [2021-03-25 03:07:40,773 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7054597701149425 [2021-03-25 03:07:40,773 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1473 transitions. [2021-03-25 03:07:40,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1473 transitions. [2021-03-25 03:07:40,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:40,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1473 transitions. [2021-03-25 03:07:40,777 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-25 03:07:40,780 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-25 03:07:40,781 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-25 03:07:40,781 INFO L185 Difference]: Start difference. First operand has 50 places, 75 transitions, 234 flow. Second operand 6 states and 1473 transitions. [2021-03-25 03:07:40,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 103 transitions, 442 flow [2021-03-25 03:07:40,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 103 transitions, 429 flow, removed 1 selfloop flow, removed 4 redundant places. [2021-03-25 03:07:40,790 INFO L241 Difference]: Finished difference. Result has 54 places, 79 transitions, 269 flow [2021-03-25 03:07:40,790 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-25 03:07:40,791 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -10 predicate places. [2021-03-25 03:07:40,791 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:40,791 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-25 03:07:40,791 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 79 transitions, 269 flow [2021-03-25 03:07:40,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 79 transitions, 269 flow [2021-03-25 03:07:40,820 INFO L129 PetriNetUnfolder]: 223/447 cut-off events. [2021-03-25 03:07:40,820 INFO L130 PetriNetUnfolder]: For 22/23 co-relation queries the response was YES. [2021-03-25 03:07:40,822 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-25 03:07:40,825 INFO L142 LiptonReduction]: Number of co-enabled transitions 1154 [2021-03-25 03:07:40,828 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:40,829 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:40,829 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 03:07:40,829 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 79 transitions, 269 flow [2021-03-25 03:07:40,830 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-25 03:07:40,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:40,830 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:40,830 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 03:07:40,831 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-25 03:07:40,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1741067560, now seen corresponding path program 1 times [2021-03-25 03:07:40,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:40,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533864160] [2021-03-25 03:07:40,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:40,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:07:40,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:40,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:40,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,921 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:40,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:40,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:40,925 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-25 03:07:40,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533864160] [2021-03-25 03:07:40,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:40,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:07:40,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394497506] [2021-03-25 03:07:40,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:07:40,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:07:40,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:07:40,929 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 348 [2021-03-25 03:07:40,930 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-25 03:07:40,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:40,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 348 [2021-03-25 03:07:40,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:41,485 INFO L129 PetriNetUnfolder]: 4974/6927 cut-off events. [2021-03-25 03:07:41,486 INFO L130 PetriNetUnfolder]: For 1741/1741 co-relation queries the response was YES. [2021-03-25 03:07:41,505 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-25 03:07:41,542 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 82 selfloop transitions, 12 changer transitions 0/131 dead transitions. [2021-03-25 03:07:41,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 131 transitions, 588 flow [2021-03-25 03:07:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:07:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:07:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1457 transitions. [2021-03-25 03:07:41,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5981116584564861 [2021-03-25 03:07:41,546 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1457 transitions. [2021-03-25 03:07:41,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1457 transitions. [2021-03-25 03:07:41,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:41,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1457 transitions. [2021-03-25 03:07:41,549 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-25 03:07:41,607 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-25 03:07:41,608 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-25 03:07:41,608 INFO L185 Difference]: Start difference. First operand has 54 places, 79 transitions, 269 flow. Second operand 7 states and 1457 transitions. [2021-03-25 03:07:41,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 131 transitions, 588 flow [2021-03-25 03:07:41,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 131 transitions, 577 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 03:07:41,615 INFO L241 Difference]: Finished difference. Result has 61 places, 81 transitions, 311 flow [2021-03-25 03:07:41,616 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-25 03:07:41,616 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, -3 predicate places. [2021-03-25 03:07:41,616 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:41,616 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-25 03:07:41,616 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 81 transitions, 311 flow [2021-03-25 03:07:41,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 81 transitions, 311 flow [2021-03-25 03:07:41,642 INFO L129 PetriNetUnfolder]: 230/457 cut-off events. [2021-03-25 03:07:41,642 INFO L130 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2021-03-25 03:07:41,644 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-25 03:07:41,648 INFO L142 LiptonReduction]: Number of co-enabled transitions 1222 [2021-03-25 03:07:41,651 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:41,651 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:41,652 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-25 03:07:41,652 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 81 transitions, 311 flow [2021-03-25 03:07:41,653 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-25 03:07:41,653 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:41,653 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:41,653 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 03:07:41,653 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-25 03:07:41,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:41,654 INFO L82 PathProgramCache]: Analyzing trace with hash -742337810, now seen corresponding path program 1 times [2021-03-25 03:07:41,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:41,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998944476] [2021-03-25 03:07:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:41,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:41,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:41,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:41,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:41,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:41,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:41,748 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-25 03:07:41,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998944476] [2021-03-25 03:07:41,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:41,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 03:07:41,749 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084919390] [2021-03-25 03:07:41,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 03:07:41,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:41,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 03:07:41,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 03:07:41,751 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 348 [2021-03-25 03:07:41,752 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 81 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 260.25) internal successors, (1041), 4 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:41,752 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:41,752 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 348 [2021-03-25 03:07:41,752 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:42,373 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,374 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,374 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,374 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,374 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,374 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,374 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,374 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,374 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,375 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,375 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,375 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,375 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,375 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,375 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,375 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,376 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,376 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,376 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,376 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,376 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,376 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,376 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,376 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,377 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,377 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,377 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,377 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,377 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,377 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:42,378 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,378 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,378 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,378 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,378 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,379 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:42,379 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,379 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,379 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,379 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is not cut-off event [2021-03-25 03:07:42,381 INFO L129 PetriNetUnfolder]: 5344/7964 cut-off events. [2021-03-25 03:07:42,381 INFO L130 PetriNetUnfolder]: For 6145/6145 co-relation queries the response was YES. [2021-03-25 03:07:42,403 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-25 03:07:42,439 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 48 selfloop transitions, 20 changer transitions 2/122 dead transitions. [2021-03-25 03:07:42,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 122 transitions, 561 flow [2021-03-25 03:07:42,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 03:07:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 03:07:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1350 transitions. [2021-03-25 03:07:42,442 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7758620689655172 [2021-03-25 03:07:42,442 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1350 transitions. [2021-03-25 03:07:42,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1350 transitions. [2021-03-25 03:07:42,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:42,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1350 transitions. [2021-03-25 03:07:42,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:42,448 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-25 03:07:42,449 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-25 03:07:42,450 INFO L185 Difference]: Start difference. First operand has 61 places, 81 transitions, 311 flow. Second operand 5 states and 1350 transitions. [2021-03-25 03:07:42,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 122 transitions, 561 flow [2021-03-25 03:07:42,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 122 transitions, 540 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-03-25 03:07:42,460 INFO L241 Difference]: Finished difference. Result has 67 places, 101 transitions, 476 flow [2021-03-25 03:07:42,461 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-25 03:07:42,461 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2021-03-25 03:07:42,461 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:42,461 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-25 03:07:42,461 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 101 transitions, 476 flow [2021-03-25 03:07:42,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 101 transitions, 476 flow [2021-03-25 03:07:42,639 INFO L129 PetriNetUnfolder]: 1882/3330 cut-off events. [2021-03-25 03:07:42,639 INFO L130 PetriNetUnfolder]: For 2071/2091 co-relation queries the response was YES. [2021-03-25 03:07:42,653 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-25 03:07:42,682 INFO L142 LiptonReduction]: Number of co-enabled transitions 1914 [2021-03-25 03:07:42,687 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:42,687 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:42,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 227 [2021-03-25 03:07:42,690 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 476 flow [2021-03-25 03:07:42,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 260.25) internal successors, (1041), 4 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:42,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:42,690 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:42,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 03:07:42,691 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-25 03:07:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1604078752, now seen corresponding path program 1 times [2021-03-25 03:07:42,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:42,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987750966] [2021-03-25 03:07:42,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:42,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:42,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:42,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:42,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:42,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:42,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:42,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:42,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:42,740 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-25 03:07:42,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987750966] [2021-03-25 03:07:42,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:42,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 03:07:42,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619738848] [2021-03-25 03:07:42,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:07:42,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:42,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:07:42,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:07:42,746 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-25 03:07:42,747 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-25 03:07:42,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:42,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-25 03:07:42,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:43,789 INFO L129 PetriNetUnfolder]: 9107/12595 cut-off events. [2021-03-25 03:07:43,790 INFO L130 PetriNetUnfolder]: For 15561/15783 co-relation queries the response was YES. [2021-03-25 03:07:43,829 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-25 03:07:43,876 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 95 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2021-03-25 03:07:43,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 827 flow [2021-03-25 03:07:43,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 03:07:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 03:07:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1475 transitions. [2021-03-25 03:07:43,880 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7064176245210728 [2021-03-25 03:07:43,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1475 transitions. [2021-03-25 03:07:43,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1475 transitions. [2021-03-25 03:07:43,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:43,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1475 transitions. [2021-03-25 03:07:43,884 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-25 03:07:43,887 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-25 03:07:43,887 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-25 03:07:43,887 INFO L185 Difference]: Start difference. First operand has 67 places, 101 transitions, 476 flow. Second operand 6 states and 1475 transitions. [2021-03-25 03:07:43,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 827 flow [2021-03-25 03:07:43,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 03:07:43,908 INFO L241 Difference]: Finished difference. Result has 74 places, 102 transitions, 504 flow [2021-03-25 03:07:43,908 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-25 03:07:43,908 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 10 predicate places. [2021-03-25 03:07:43,909 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:43,909 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 102 transitions, 504 flow [2021-03-25 03:07:43,909 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 102 transitions, 504 flow [2021-03-25 03:07:43,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 102 transitions, 504 flow [2021-03-25 03:07:44,124 INFO L129 PetriNetUnfolder]: 1910/3387 cut-off events. [2021-03-25 03:07:44,124 INFO L130 PetriNetUnfolder]: For 2203/2227 co-relation queries the response was YES. [2021-03-25 03:07:44,137 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-25 03:07:44,161 INFO L142 LiptonReduction]: Number of co-enabled transitions 1910 [2021-03-25 03:07:44,165 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:44,165 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:44,165 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 257 [2021-03-25 03:07:44,166 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 102 transitions, 504 flow [2021-03-25 03:07:44,166 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-25 03:07:44,167 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:44,167 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:44,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 03:07:44,167 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-25 03:07:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:44,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1535794226, now seen corresponding path program 2 times [2021-03-25 03:07:44,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:44,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844234914] [2021-03-25 03:07:44,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:44,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:44,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:07:44,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:44,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:07:44,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:44,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:44,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:44,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:44,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:44,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:44,210 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-25 03:07:44,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844234914] [2021-03-25 03:07:44,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:44,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:07:44,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104495532] [2021-03-25 03:07:44,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:07:44,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:44,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:07:44,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:07:44,213 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 03:07:44,214 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-25 03:07:44,214 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:44,214 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 03:07:44,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:45,185 INFO L129 PetriNetUnfolder]: 8856/12256 cut-off events. [2021-03-25 03:07:45,186 INFO L130 PetriNetUnfolder]: For 16838/17054 co-relation queries the response was YES. [2021-03-25 03:07:45,211 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-25 03:07:45,251 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 90 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2021-03-25 03:07:45,251 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 139 transitions, 864 flow [2021-03-25 03:07:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:07:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:07:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1613 transitions. [2021-03-25 03:07:45,255 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.579382183908046 [2021-03-25 03:07:45,255 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1613 transitions. [2021-03-25 03:07:45,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1613 transitions. [2021-03-25 03:07:45,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:45,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1613 transitions. [2021-03-25 03:07:45,259 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-25 03:07:45,262 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-25 03:07:45,263 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-25 03:07:45,263 INFO L185 Difference]: Start difference. First operand has 74 places, 102 transitions, 504 flow. Second operand 8 states and 1613 transitions. [2021-03-25 03:07:45,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 139 transitions, 864 flow [2021-03-25 03:07:45,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 139 transitions, 852 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 03:07:45,281 INFO L241 Difference]: Finished difference. Result has 79 places, 103 transitions, 549 flow [2021-03-25 03:07:45,281 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-25 03:07:45,281 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 15 predicate places. [2021-03-25 03:07:45,281 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:45,281 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 103 transitions, 549 flow [2021-03-25 03:07:45,282 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 103 transitions, 549 flow [2021-03-25 03:07:45,282 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 103 transitions, 549 flow [2021-03-25 03:07:45,540 INFO L129 PetriNetUnfolder]: 1786/3207 cut-off events. [2021-03-25 03:07:45,541 INFO L130 PetriNetUnfolder]: For 2415/2435 co-relation queries the response was YES. [2021-03-25 03:07:45,552 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-25 03:07:45,574 INFO L142 LiptonReduction]: Number of co-enabled transitions 1902 [2021-03-25 03:07:45,579 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:45,579 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:45,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 298 [2021-03-25 03:07:45,581 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 103 transitions, 549 flow [2021-03-25 03:07:45,582 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-25 03:07:45,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:45,582 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:45,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 03:07:45,582 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-25 03:07:45,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:45,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1516767050, now seen corresponding path program 3 times [2021-03-25 03:07:45,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:45,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626252701] [2021-03-25 03:07:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:45,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:45,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:45,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:45,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:07:45,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:45,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:45,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:45,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:07:45,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:45,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:45,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:45,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:45,632 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-25 03:07:45,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626252701] [2021-03-25 03:07:45,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:45,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:07:45,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609418534] [2021-03-25 03:07:45,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:07:45,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:07:45,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:07:45,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 348 [2021-03-25 03:07:45,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 103 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:45,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:45,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 348 [2021-03-25 03:07:45,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:46,276 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:46,276 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,276 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,276 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,276 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,291 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:46,291 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,291 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,291 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,291 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:46,309 INFO L129 PetriNetUnfolder]: 5329/8061 cut-off events. [2021-03-25 03:07:46,309 INFO L130 PetriNetUnfolder]: For 15980/16324 co-relation queries the response was YES. [2021-03-25 03:07:46,349 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-25 03:07:46,391 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 56 selfloop transitions, 34 changer transitions 10/152 dead transitions. [2021-03-25 03:07:46,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 152 transitions, 1040 flow [2021-03-25 03:07:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:07:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:07:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2187 transitions. [2021-03-25 03:07:46,398 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6982758620689655 [2021-03-25 03:07:46,398 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2187 transitions. [2021-03-25 03:07:46,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2187 transitions. [2021-03-25 03:07:46,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:46,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2187 transitions. [2021-03-25 03:07:46,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 243.0) internal successors, (2187), 9 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:46,407 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-25 03:07:46,408 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-25 03:07:46,408 INFO L185 Difference]: Start difference. First operand has 79 places, 103 transitions, 549 flow. Second operand 9 states and 2187 transitions. [2021-03-25 03:07:46,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 152 transitions, 1040 flow [2021-03-25 03:07:46,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 995 flow, removed 3 selfloop flow, removed 7 redundant places. [2021-03-25 03:07:46,426 INFO L241 Difference]: Finished difference. Result has 83 places, 115 transitions, 726 flow [2021-03-25 03:07:46,426 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-25 03:07:46,426 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 19 predicate places. [2021-03-25 03:07:46,427 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:46,427 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 115 transitions, 726 flow [2021-03-25 03:07:46,427 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 115 transitions, 726 flow [2021-03-25 03:07:46,427 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 115 transitions, 726 flow [2021-03-25 03:07:46,655 INFO L129 PetriNetUnfolder]: 1947/3603 cut-off events. [2021-03-25 03:07:46,656 INFO L130 PetriNetUnfolder]: For 4715/4757 co-relation queries the response was YES. [2021-03-25 03:07:46,668 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-25 03:07:46,697 INFO L142 LiptonReduction]: Number of co-enabled transitions 2076 [2021-03-25 03:07:46,702 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:46,702 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:46,702 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 276 [2021-03-25 03:07:46,703 INFO L480 AbstractCegarLoop]: Abstraction has has 81 places, 115 transitions, 726 flow [2021-03-25 03:07:46,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 236.57142857142858) internal successors, (1656), 7 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:46,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:46,704 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:46,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 03:07:46,704 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-25 03:07:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash -739810455, now seen corresponding path program 1 times [2021-03-25 03:07:46,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:46,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691008862] [2021-03-25 03:07:46,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:46,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:46,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:46,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:46,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:46,726 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-25 03:07:46,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691008862] [2021-03-25 03:07:46,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:46,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 03:07:46,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203038168] [2021-03-25 03:07:46,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 03:07:46,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:46,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 03:07:46,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 03:07:46,729 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 348 [2021-03-25 03:07:46,729 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-25 03:07:46,729 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:46,729 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 348 [2021-03-25 03:07:46,730 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:47,427 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:47,427 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,427 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,427 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,427 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,428 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:47,428 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,428 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,428 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,428 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:47,434 INFO L129 PetriNetUnfolder]: 6059/9083 cut-off events. [2021-03-25 03:07:47,434 INFO L130 PetriNetUnfolder]: For 34721/35262 co-relation queries the response was YES. [2021-03-25 03:07:47,457 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-25 03:07:47,492 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 67 selfloop transitions, 16 changer transitions 1/137 dead transitions. [2021-03-25 03:07:47,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 1067 flow [2021-03-25 03:07:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 03:07:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 03:07:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2021-03-25 03:07:47,494 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8132183908045977 [2021-03-25 03:07:47,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 849 transitions. [2021-03-25 03:07:47,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 849 transitions. [2021-03-25 03:07:47,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:47,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 849 transitions. [2021-03-25 03:07:47,496 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-25 03:07:47,498 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-25 03:07:47,498 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-25 03:07:47,498 INFO L185 Difference]: Start difference. First operand has 81 places, 115 transitions, 726 flow. Second operand 3 states and 849 transitions. [2021-03-25 03:07:47,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 1067 flow [2021-03-25 03:07:47,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 137 transitions, 1061 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 03:07:47,540 INFO L241 Difference]: Finished difference. Result has 82 places, 124 transitions, 880 flow [2021-03-25 03:07:47,540 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-25 03:07:47,540 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places. [2021-03-25 03:07:47,541 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:47,541 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 124 transitions, 880 flow [2021-03-25 03:07:47,541 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 124 transitions, 880 flow [2021-03-25 03:07:47,542 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 124 transitions, 880 flow [2021-03-25 03:07:47,768 INFO L129 PetriNetUnfolder]: 2136/3904 cut-off events. [2021-03-25 03:07:47,768 INFO L130 PetriNetUnfolder]: For 7108/7218 co-relation queries the response was YES. [2021-03-25 03:07:47,787 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-25 03:07:47,822 INFO L142 LiptonReduction]: Number of co-enabled transitions 2306 [2021-03-25 03:07:47,828 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:47,829 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:47,829 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 288 [2021-03-25 03:07:47,829 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 124 transitions, 880 flow [2021-03-25 03:07:47,841 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-25 03:07:47,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:47,841 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:47,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 03:07:47,842 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-25 03:07:47,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:47,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1459289047, now seen corresponding path program 1 times [2021-03-25 03:07:47,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:47,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43598695] [2021-03-25 03:07:47,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:47,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:47,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:07:47,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:47,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:07:47,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:47,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:47,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:47,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:47,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:47,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:47,906 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-25 03:07:47,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43598695] [2021-03-25 03:07:47,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:47,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:07:47,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722469308] [2021-03-25 03:07:47,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:07:47,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:47,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:07:47,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:07:47,909 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 03:07:47,910 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-25 03:07:47,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:47,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 03:07:47,911 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:48,808 INFO L129 PetriNetUnfolder]: 8862/12412 cut-off events. [2021-03-25 03:07:48,808 INFO L130 PetriNetUnfolder]: For 50299/51113 co-relation queries the response was YES. [2021-03-25 03:07:48,849 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-25 03:07:48,876 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 104 selfloop transitions, 16 changer transitions 18/166 dead transitions. [2021-03-25 03:07:48,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 166 transitions, 1413 flow [2021-03-25 03:07:48,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:07:48,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:07:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1610 transitions. [2021-03-25 03:07:48,881 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5783045977011494 [2021-03-25 03:07:48,881 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1610 transitions. [2021-03-25 03:07:48,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1610 transitions. [2021-03-25 03:07:48,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:48,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1610 transitions. [2021-03-25 03:07:48,885 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-25 03:07:48,888 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-25 03:07:48,888 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-25 03:07:48,889 INFO L185 Difference]: Start difference. First operand has 82 places, 124 transitions, 880 flow. Second operand 8 states and 1610 transitions. [2021-03-25 03:07:48,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 166 transitions, 1413 flow [2021-03-25 03:07:48,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 166 transitions, 1389 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 03:07:48,985 INFO L241 Difference]: Finished difference. Result has 90 places, 113 transitions, 852 flow [2021-03-25 03:07:48,985 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-25 03:07:48,985 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 26 predicate places. [2021-03-25 03:07:48,985 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:48,985 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 113 transitions, 852 flow [2021-03-25 03:07:48,985 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 113 transitions, 852 flow [2021-03-25 03:07:48,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 113 transitions, 852 flow [2021-03-25 03:07:49,175 INFO L129 PetriNetUnfolder]: 2030/3789 cut-off events. [2021-03-25 03:07:49,175 INFO L130 PetriNetUnfolder]: For 6954/7347 co-relation queries the response was YES. [2021-03-25 03:07:49,188 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-25 03:07:49,217 INFO L142 LiptonReduction]: Number of co-enabled transitions 2216 [2021-03-25 03:07:49,223 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:49,223 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:49,223 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 238 [2021-03-25 03:07:49,224 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 113 transitions, 852 flow [2021-03-25 03:07:49,224 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-25 03:07:49,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:49,224 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:49,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 03:07:49,225 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-25 03:07:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:49,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1370679130, now seen corresponding path program 1 times [2021-03-25 03:07:49,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:49,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822681706] [2021-03-25 03:07:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:49,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:49,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:49,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:49,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:07:49,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:49,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:49,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:49,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:07:49,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:49,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:49,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:49,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:49,272 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-25 03:07:49,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822681706] [2021-03-25 03:07:49,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:49,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:07:49,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099306545] [2021-03-25 03:07:49,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:07:49,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:49,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:07:49,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:07:49,276 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-25 03:07:49,277 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 113 transitions, 852 flow. Second operand has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:49,277 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:49,277 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-25 03:07:49,277 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:49,943 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:49,943 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,943 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,943 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,943 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,948 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:49,948 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,948 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,949 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,949 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:49,950 INFO L129 PetriNetUnfolder]: 5708/8764 cut-off events. [2021-03-25 03:07:49,950 INFO L130 PetriNetUnfolder]: For 40617/41301 co-relation queries the response was YES. [2021-03-25 03:07:50,044 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-25 03:07:50,068 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 64 selfloop transitions, 46 changer transitions 2/156 dead transitions. [2021-03-25 03:07:50,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 156 transitions, 1398 flow [2021-03-25 03:07:50,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:07:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:07:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1702 transitions. [2021-03-25 03:07:50,072 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6986863711001642 [2021-03-25 03:07:50,072 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1702 transitions. [2021-03-25 03:07:50,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1702 transitions. [2021-03-25 03:07:50,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:50,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1702 transitions. [2021-03-25 03:07:50,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 243.14285714285714) internal successors, (1702), 7 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:50,079 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-25 03:07:50,079 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-25 03:07:50,079 INFO L185 Difference]: Start difference. First operand has 88 places, 113 transitions, 852 flow. Second operand 7 states and 1702 transitions. [2021-03-25 03:07:50,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 156 transitions, 1398 flow [2021-03-25 03:07:50,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 156 transitions, 1366 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 03:07:50,127 INFO L241 Difference]: Finished difference. Result has 92 places, 129 transitions, 1193 flow [2021-03-25 03:07:50,127 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-25 03:07:50,127 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 28 predicate places. [2021-03-25 03:07:50,128 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:50,128 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 129 transitions, 1193 flow [2021-03-25 03:07:50,128 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 129 transitions, 1193 flow [2021-03-25 03:07:50,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 129 transitions, 1193 flow [2021-03-25 03:07:50,344 INFO L129 PetriNetUnfolder]: 2221/4150 cut-off events. [2021-03-25 03:07:50,345 INFO L130 PetriNetUnfolder]: For 14244/15019 co-relation queries the response was YES. [2021-03-25 03:07:50,361 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-25 03:07:50,388 INFO L142 LiptonReduction]: Number of co-enabled transitions 2482 [2021-03-25 03:07:50,395 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:50,396 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:50,396 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 268 [2021-03-25 03:07:50,396 INFO L480 AbstractCegarLoop]: Abstraction has has 92 places, 129 transitions, 1193 flow [2021-03-25 03:07:50,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:50,397 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:50,397 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:50,397 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 03:07:50,397 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-25 03:07:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:50,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1940270885, now seen corresponding path program 1 times [2021-03-25 03:07:50,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:50,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221134595] [2021-03-25 03:07:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:50,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:50,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:50,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:50,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 03:07:50,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:50,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:50,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:50,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:07:50,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:50,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:50,435 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-25 03:07:50,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221134595] [2021-03-25 03:07:50,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:50,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:07:50,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392492219] [2021-03-25 03:07:50,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:07:50,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:50,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:07:50,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:07:50,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 348 [2021-03-25 03:07:50,438 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-25 03:07:50,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:50,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 348 [2021-03-25 03:07:50,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:51,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:51,053 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,053 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,053 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,053 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:51,054 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,054 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,054 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,054 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:51,060 INFO L129 PetriNetUnfolder]: 5711/8738 cut-off events. [2021-03-25 03:07:51,060 INFO L130 PetriNetUnfolder]: For 64111/65081 co-relation queries the response was YES. [2021-03-25 03:07:51,091 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-25 03:07:51,120 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 80 selfloop transitions, 24 changer transitions 0/148 dead transitions. [2021-03-25 03:07:51,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 148 transitions, 1579 flow [2021-03-25 03:07:51,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 03:07:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 03:07:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1272 transitions. [2021-03-25 03:07:51,123 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7310344827586207 [2021-03-25 03:07:51,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1272 transitions. [2021-03-25 03:07:51,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1272 transitions. [2021-03-25 03:07:51,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:51,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1272 transitions. [2021-03-25 03:07:51,126 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-25 03:07:51,128 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-25 03:07:51,129 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-25 03:07:51,129 INFO L185 Difference]: Start difference. First operand has 92 places, 129 transitions, 1193 flow. Second operand 5 states and 1272 transitions. [2021-03-25 03:07:51,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 148 transitions, 1579 flow [2021-03-25 03:07:51,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 148 transitions, 1574 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 03:07:51,203 INFO L241 Difference]: Finished difference. Result has 95 places, 133 transitions, 1325 flow [2021-03-25 03:07:51,204 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-25 03:07:51,204 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 31 predicate places. [2021-03-25 03:07:51,204 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:51,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 133 transitions, 1325 flow [2021-03-25 03:07:51,204 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 133 transitions, 1325 flow [2021-03-25 03:07:51,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 133 transitions, 1325 flow [2021-03-25 03:07:51,427 INFO L129 PetriNetUnfolder]: 2182/4096 cut-off events. [2021-03-25 03:07:51,427 INFO L130 PetriNetUnfolder]: For 14632/14924 co-relation queries the response was YES. [2021-03-25 03:07:51,442 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-25 03:07:51,469 INFO L142 LiptonReduction]: Number of co-enabled transitions 2512 [2021-03-25 03:07:51,474 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:51,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:51,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 271 [2021-03-25 03:07:51,475 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 133 transitions, 1325 flow [2021-03-25 03:07:51,475 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-25 03:07:51,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:51,476 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:51,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 03:07:51,476 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-25 03:07:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:51,476 INFO L82 PathProgramCache]: Analyzing trace with hash -414745382, now seen corresponding path program 2 times [2021-03-25 03:07:51,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:51,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813889117] [2021-03-25 03:07:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:51,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:51,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:51,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:51,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 03:07:51,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:51,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:07:51,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:51,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:07:51,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:51,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:07:51,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:51,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:51,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:51,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:51,534 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-25 03:07:51,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813889117] [2021-03-25 03:07:51,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:51,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:07:51,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68568333] [2021-03-25 03:07:51,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:07:51,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:07:51,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:07:51,537 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 348 [2021-03-25 03:07:51,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 133 transitions, 1325 flow. Second operand has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:51,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:51,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 348 [2021-03-25 03:07:51,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:52,293 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:52,294 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,294 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,294 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,294 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,304 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:07:52,304 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,304 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,304 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,304 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:07:52,307 INFO L129 PetriNetUnfolder]: 5948/9107 cut-off events. [2021-03-25 03:07:52,307 INFO L130 PetriNetUnfolder]: For 80833/81720 co-relation queries the response was YES. [2021-03-25 03:07:52,344 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-25 03:07:52,376 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 65 selfloop transitions, 66 changer transitions 2/177 dead transitions. [2021-03-25 03:07:52,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 177 transitions, 2051 flow [2021-03-25 03:07:52,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:07:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:07:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1681 transitions. [2021-03-25 03:07:52,379 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6900656814449918 [2021-03-25 03:07:52,379 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1681 transitions. [2021-03-25 03:07:52,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1681 transitions. [2021-03-25 03:07:52,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:52,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1681 transitions. [2021-03-25 03:07:52,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 240.14285714285714) internal successors, (1681), 7 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:52,386 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-25 03:07:52,386 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-25 03:07:52,386 INFO L185 Difference]: Start difference. First operand has 95 places, 133 transitions, 1325 flow. Second operand 7 states and 1681 transitions. [2021-03-25 03:07:52,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 177 transitions, 2051 flow [2021-03-25 03:07:52,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 177 transitions, 2016 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 03:07:52,497 INFO L241 Difference]: Finished difference. Result has 102 places, 151 transitions, 1856 flow [2021-03-25 03:07:52,498 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-25 03:07:52,498 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 38 predicate places. [2021-03-25 03:07:52,498 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:52,498 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 151 transitions, 1856 flow [2021-03-25 03:07:52,498 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 151 transitions, 1856 flow [2021-03-25 03:07:52,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 151 transitions, 1856 flow [2021-03-25 03:07:52,728 INFO L129 PetriNetUnfolder]: 2215/4146 cut-off events. [2021-03-25 03:07:52,728 INFO L130 PetriNetUnfolder]: For 23389/23894 co-relation queries the response was YES. [2021-03-25 03:07:52,744 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-25 03:07:52,773 INFO L142 LiptonReduction]: Number of co-enabled transitions 2734 [2021-03-25 03:07:52,779 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:52,779 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:52,779 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 281 [2021-03-25 03:07:52,780 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 151 transitions, 1856 flow [2021-03-25 03:07:52,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:07:52,780 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:52,780 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:52,780 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 03:07:52,780 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-25 03:07:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1940269459, now seen corresponding path program 1 times [2021-03-25 03:07:52,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:52,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329865758] [2021-03-25 03:07:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:52,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:07:52,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 03:07:52,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 03:07:52,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:07:52,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:07:52,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:07:52,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:07:52,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,920 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 03:07:52,941 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:52,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:52,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:52,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-25 03:07:52,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329865758] [2021-03-25 03:07:52,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:52,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:07:52,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707222889] [2021-03-25 03:07:52,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:07:52,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:52,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:07:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:07:52,952 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 03:07:52,953 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-25 03:07:52,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:52,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 03:07:52,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:54,434 INFO L129 PetriNetUnfolder]: 10702/15056 cut-off events. [2021-03-25 03:07:54,434 INFO L130 PetriNetUnfolder]: For 179343/180230 co-relation queries the response was YES. [2021-03-25 03:07:54,495 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-25 03:07:54,532 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 173 selfloop transitions, 42 changer transitions 3/246 dead transitions. [2021-03-25 03:07:54,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 246 transitions, 3502 flow [2021-03-25 03:07:54,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:07:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:07:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2173 transitions. [2021-03-25 03:07:54,536 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5676593521421107 [2021-03-25 03:07:54,536 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2173 transitions. [2021-03-25 03:07:54,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2173 transitions. [2021-03-25 03:07:54,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:54,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2173 transitions. [2021-03-25 03:07:54,541 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-25 03:07:54,544 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-25 03:07:54,545 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-25 03:07:54,545 INFO L185 Difference]: Start difference. First operand has 102 places, 151 transitions, 1856 flow. Second operand 11 states and 2173 transitions. [2021-03-25 03:07:54,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 246 transitions, 3502 flow [2021-03-25 03:07:54,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 246 transitions, 3497 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 03:07:54,711 INFO L241 Difference]: Finished difference. Result has 116 places, 186 transitions, 2570 flow [2021-03-25 03:07:54,712 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-25 03:07:54,712 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 52 predicate places. [2021-03-25 03:07:54,712 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:54,712 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 186 transitions, 2570 flow [2021-03-25 03:07:54,712 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 186 transitions, 2570 flow [2021-03-25 03:07:54,714 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 186 transitions, 2570 flow [2021-03-25 03:07:55,005 INFO L129 PetriNetUnfolder]: 2704/5029 cut-off events. [2021-03-25 03:07:55,005 INFO L130 PetriNetUnfolder]: For 31755/32358 co-relation queries the response was YES. [2021-03-25 03:07:55,029 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-25 03:07:55,068 INFO L142 LiptonReduction]: Number of co-enabled transitions 2894 [2021-03-25 03:07:55,074 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:55,074 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:55,075 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 363 [2021-03-25 03:07:55,075 INFO L480 AbstractCegarLoop]: Abstraction has has 116 places, 186 transitions, 2570 flow [2021-03-25 03:07:55,075 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-25 03:07:55,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:55,075 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:07:55,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 03:07:55,076 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-25 03:07:55,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:55,076 INFO L82 PathProgramCache]: Analyzing trace with hash 2068052205, now seen corresponding path program 2 times [2021-03-25 03:07:55,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:55,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308586772] [2021-03-25 03:07:55,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:55,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:07:55,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:07:55,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:07:55,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:07:55,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:07:55,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:07:55,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:55,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:55,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 03:07:55,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308586772] [2021-03-25 03:07:55,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:55,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:07:55,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693566715] [2021-03-25 03:07:55,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:07:55,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:55,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:07:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:07:55,145 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 03:07:55,146 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-25 03:07:55,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:55,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 03:07:55,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:56,767 INFO L129 PetriNetUnfolder]: 13896/19275 cut-off events. [2021-03-25 03:07:56,767 INFO L130 PetriNetUnfolder]: For 258894/259968 co-relation queries the response was YES. [2021-03-25 03:07:56,872 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-25 03:07:56,919 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 164 selfloop transitions, 34 changer transitions 66/292 dead transitions. [2021-03-25 03:07:56,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 292 transitions, 4478 flow [2021-03-25 03:07:56,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:07:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:07:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1815 transitions. [2021-03-25 03:07:56,923 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5795019157088123 [2021-03-25 03:07:56,923 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1815 transitions. [2021-03-25 03:07:56,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1815 transitions. [2021-03-25 03:07:56,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:56,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1815 transitions. [2021-03-25 03:07:56,927 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-25 03:07:56,930 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-25 03:07:56,930 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-25 03:07:56,930 INFO L185 Difference]: Start difference. First operand has 116 places, 186 transitions, 2570 flow. Second operand 9 states and 1815 transitions. [2021-03-25 03:07:56,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 292 transitions, 4478 flow [2021-03-25 03:07:57,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 292 transitions, 4299 flow, removed 88 selfloop flow, removed 1 redundant places. [2021-03-25 03:07:57,169 INFO L241 Difference]: Finished difference. Result has 127 places, 146 transitions, 1817 flow [2021-03-25 03:07:57,169 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-25 03:07:57,169 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 63 predicate places. [2021-03-25 03:07:57,169 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:07:57,169 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 146 transitions, 1817 flow [2021-03-25 03:07:57,170 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 146 transitions, 1817 flow [2021-03-25 03:07:57,170 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 146 transitions, 1817 flow [2021-03-25 03:07:57,474 INFO L129 PetriNetUnfolder]: 2963/5511 cut-off events. [2021-03-25 03:07:57,474 INFO L130 PetriNetUnfolder]: For 35743/36357 co-relation queries the response was YES. [2021-03-25 03:07:57,503 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-25 03:07:57,548 INFO L142 LiptonReduction]: Number of co-enabled transitions 2534 [2021-03-25 03:07:57,553 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:07:57,553 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:07:57,554 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 385 [2021-03-25 03:07:57,554 INFO L480 AbstractCegarLoop]: Abstraction has has 127 places, 146 transitions, 1817 flow [2021-03-25 03:07:57,554 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-25 03:07:57,554 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:07:57,554 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-25 03:07:57,555 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 03:07:57,555 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-25 03:07:57,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:07:57,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1101121893, now seen corresponding path program 1 times [2021-03-25 03:07:57,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:07:57,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749331968] [2021-03-25 03:07:57,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:07:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:07:57,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:07:57,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:07:57,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:07:57,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:07:57,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:07:57,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:07:57,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:07:57,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:07:57,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:07:57,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:07:57,692 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-25 03:07:57,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749331968] [2021-03-25 03:07:57,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:07:57,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:07:57,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986954889] [2021-03-25 03:07:57,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:07:57,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:07:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:07:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:07:57,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 03:07:57,695 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-25 03:07:57,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:07:57,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 03:07:57,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:07:59,625 INFO L129 PetriNetUnfolder]: 14848/20634 cut-off events. [2021-03-25 03:07:59,625 INFO L130 PetriNetUnfolder]: For 271659/271696 co-relation queries the response was YES. [2021-03-25 03:07:59,751 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-25 03:07:59,798 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 123 selfloop transitions, 32 changer transitions 3/186 dead transitions. [2021-03-25 03:07:59,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 186 transitions, 2646 flow [2021-03-25 03:07:59,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:07:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:07:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1780 transitions. [2021-03-25 03:07:59,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5683269476372924 [2021-03-25 03:07:59,802 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1780 transitions. [2021-03-25 03:07:59,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1780 transitions. [2021-03-25 03:07:59,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:07:59,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1780 transitions. [2021-03-25 03:07:59,806 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-25 03:07:59,809 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-25 03:07:59,809 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-25 03:07:59,809 INFO L185 Difference]: Start difference. First operand has 127 places, 146 transitions, 1817 flow. Second operand 9 states and 1780 transitions. [2021-03-25 03:07:59,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 186 transitions, 2646 flow [2021-03-25 03:08:00,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 2473 flow, removed 34 selfloop flow, removed 10 redundant places. [2021-03-25 03:08:00,063 INFO L241 Difference]: Finished difference. Result has 128 places, 157 transitions, 2001 flow [2021-03-25 03:08:00,063 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-25 03:08:00,063 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 64 predicate places. [2021-03-25 03:08:00,063 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:00,063 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 157 transitions, 2001 flow [2021-03-25 03:08:00,063 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 157 transitions, 2001 flow [2021-03-25 03:08:00,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 157 transitions, 2001 flow [2021-03-25 03:08:00,482 INFO L129 PetriNetUnfolder]: 3311/6092 cut-off events. [2021-03-25 03:08:00,482 INFO L130 PetriNetUnfolder]: For 33986/34356 co-relation queries the response was YES. [2021-03-25 03:08:00,519 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-25 03:08:00,578 INFO L142 LiptonReduction]: Number of co-enabled transitions 2660 [2021-03-25 03:08:00,583 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:00,583 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:00,583 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 520 [2021-03-25 03:08:00,584 INFO L480 AbstractCegarLoop]: Abstraction has has 128 places, 157 transitions, 2001 flow [2021-03-25 03:08:00,584 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-25 03:08:00,584 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:00,584 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-25 03:08:00,585 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 03:08:00,585 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-25 03:08:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash 505804647, now seen corresponding path program 2 times [2021-03-25 03:08:00,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:00,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663702358] [2021-03-25 03:08:00,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:00,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:08:00,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 03:08:00,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:08:00,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:08:00,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:08:00,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:00,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 03:08:00,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:08:00,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:08:00,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:00,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:00,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:00,783 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-25 03:08:00,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663702358] [2021-03-25 03:08:00,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:00,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:08:00,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158952569] [2021-03-25 03:08:00,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:08:00,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:00,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:08:00,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:08:00,787 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 03:08:00,788 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-25 03:08:00,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:00,789 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 03:08:00,789 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:02,977 INFO L129 PetriNetUnfolder]: 16084/22173 cut-off events. [2021-03-25 03:08:02,977 INFO L130 PetriNetUnfolder]: For 277670/278352 co-relation queries the response was YES. [2021-03-25 03:08:03,121 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-25 03:08:03,190 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 177 selfloop transitions, 53 changer transitions 4/262 dead transitions. [2021-03-25 03:08:03,190 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 262 transitions, 3980 flow [2021-03-25 03:08:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:08:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:08:03,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1582 transitions. [2021-03-25 03:08:03,192 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5682471264367817 [2021-03-25 03:08:03,192 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1582 transitions. [2021-03-25 03:08:03,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1582 transitions. [2021-03-25 03:08:03,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:03,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1582 transitions. [2021-03-25 03:08:03,194 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-25 03:08:03,197 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-25 03:08:03,197 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-25 03:08:03,197 INFO L185 Difference]: Start difference. First operand has 128 places, 157 transitions, 2001 flow. Second operand 8 states and 1582 transitions. [2021-03-25 03:08:03,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 262 transitions, 3980 flow [2021-03-25 03:08:03,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 262 transitions, 3754 flow, removed 89 selfloop flow, removed 5 redundant places. [2021-03-25 03:08:03,499 INFO L241 Difference]: Finished difference. Result has 133 places, 182 transitions, 2469 flow [2021-03-25 03:08:03,499 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-25 03:08:03,499 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 69 predicate places. [2021-03-25 03:08:03,499 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:03,499 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 182 transitions, 2469 flow [2021-03-25 03:08:03,499 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 182 transitions, 2469 flow [2021-03-25 03:08:03,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 182 transitions, 2469 flow [2021-03-25 03:08:03,941 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= |v_#memory_int_71| (store |v_#memory_int_72| |v_thread0Thread1of1ForFork4_~#t5~0.base_21| (store (select |v_#memory_int_72| |v_thread0Thread1of1ForFork4_~#t5~0.base_21|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_17| 4))) InVars {#memory_int=|v_#memory_int_72|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_21|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_17|} OutVars{#memory_int=|v_#memory_int_71|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_21|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_17|} 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-25 03:08:03,941 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:08:03,941 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:08:03,941 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:08:03,942 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:08:04,153 INFO L129 PetriNetUnfolder]: 3638/6661 cut-off events. [2021-03-25 03:08:04,153 INFO L130 PetriNetUnfolder]: For 42093/42457 co-relation queries the response was YES. [2021-03-25 03:08:04,192 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-25 03:08:04,251 INFO L142 LiptonReduction]: Number of co-enabled transitions 2778 [2021-03-25 03:08:04,259 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:04,260 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:04,260 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 761 [2021-03-25 03:08:04,260 INFO L480 AbstractCegarLoop]: Abstraction has has 133 places, 182 transitions, 2469 flow [2021-03-25 03:08:04,261 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-25 03:08:04,261 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:04,261 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-25 03:08:04,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 03:08:04,261 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-25 03:08:04,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:04,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1501503079, now seen corresponding path program 1 times [2021-03-25 03:08:04,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:04,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824432953] [2021-03-25 03:08:04,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:04,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:04,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:08:04,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:04,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:08:04,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:04,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:04,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:04,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 03:08:04,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824432953] [2021-03-25 03:08:04,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:04,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 03:08:04,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497408532] [2021-03-25 03:08:04,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 03:08:04,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:04,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 03:08:04,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-25 03:08:04,290 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 348 [2021-03-25 03:08:04,291 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-25 03:08:04,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:04,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 348 [2021-03-25 03:08:04,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:06,085 INFO L129 PetriNetUnfolder]: 15379/21530 cut-off events. [2021-03-25 03:08:06,086 INFO L130 PetriNetUnfolder]: For 278881/279268 co-relation queries the response was YES. [2021-03-25 03:08:06,290 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-25 03:08:06,338 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 180 selfloop transitions, 7 changer transitions 20/242 dead transitions. [2021-03-25 03:08:06,338 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 242 transitions, 3709 flow [2021-03-25 03:08:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 03:08:06,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 03:08:06,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1467 transitions. [2021-03-25 03:08:06,349 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7025862068965517 [2021-03-25 03:08:06,349 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1467 transitions. [2021-03-25 03:08:06,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1467 transitions. [2021-03-25 03:08:06,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:06,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1467 transitions. [2021-03-25 03:08:06,351 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-25 03:08:06,353 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-25 03:08:06,353 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-25 03:08:06,353 INFO L185 Difference]: Start difference. First operand has 133 places, 182 transitions, 2469 flow. Second operand 6 states and 1467 transitions. [2021-03-25 03:08:06,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 242 transitions, 3709 flow [2021-03-25 03:08:06,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 242 transitions, 3648 flow, removed 24 selfloop flow, removed 3 redundant places. [2021-03-25 03:08:06,766 INFO L241 Difference]: Finished difference. Result has 137 places, 183 transitions, 2436 flow [2021-03-25 03:08:06,767 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-25 03:08:06,767 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 73 predicate places. [2021-03-25 03:08:06,767 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:06,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 183 transitions, 2436 flow [2021-03-25 03:08:06,767 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 183 transitions, 2436 flow [2021-03-25 03:08:06,769 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 137 places, 183 transitions, 2436 flow [2021-03-25 03:08:06,957 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= |v_#memory_int_71| (store |v_#memory_int_72| |v_thread0Thread1of1ForFork4_~#t5~0.base_21| (store (select |v_#memory_int_72| |v_thread0Thread1of1ForFork4_~#t5~0.base_21|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_17| 4))) InVars {#memory_int=|v_#memory_int_72|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_21|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_17|} OutVars{#memory_int=|v_#memory_int_71|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_21|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_17|} 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-25 03:08:06,958 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 03:08:06,958 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:08:06,958 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:08:06,958 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 03:08:07,180 INFO L129 PetriNetUnfolder]: 3646/6675 cut-off events. [2021-03-25 03:08:07,181 INFO L130 PetriNetUnfolder]: For 39016/39374 co-relation queries the response was YES. [2021-03-25 03:08:07,221 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-25 03:08:07,284 INFO L142 LiptonReduction]: Number of co-enabled transitions 2762 [2021-03-25 03:08:07,292 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:07,292 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:07,292 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 525 [2021-03-25 03:08:07,293 INFO L480 AbstractCegarLoop]: Abstraction has has 137 places, 183 transitions, 2436 flow [2021-03-25 03:08:07,293 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-25 03:08:07,293 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:07,293 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-25 03:08:07,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 03:08:07,293 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-25 03:08:07,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash -848365179, now seen corresponding path program 2 times [2021-03-25 03:08:07,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:07,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876669823] [2021-03-25 03:08:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:07,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:07,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:08:07,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:07,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:08:07,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:07,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:08:07,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:07,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:07,753 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 4 [2021-03-25 03:08:07,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:07,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:07,754 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-25 03:08:07,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876669823] [2021-03-25 03:08:07,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:07,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:08:07,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112430956] [2021-03-25 03:08:07,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:08:07,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:07,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:08:07,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:08:07,756 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 03:08:07,757 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-25 03:08:07,757 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:07,757 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 03:08:07,757 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:10,052 INFO L129 PetriNetUnfolder]: 14866/20885 cut-off events. [2021-03-25 03:08:10,052 INFO L130 PetriNetUnfolder]: For 263855/264172 co-relation queries the response was YES. [2021-03-25 03:08:10,184 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-25 03:08:10,230 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 172 selfloop transitions, 17 changer transitions 21/243 dead transitions. [2021-03-25 03:08:10,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 243 transitions, 3679 flow [2021-03-25 03:08:10,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:08:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:08:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1603 transitions. [2021-03-25 03:08:10,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5757902298850575 [2021-03-25 03:08:10,232 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1603 transitions. [2021-03-25 03:08:10,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1603 transitions. [2021-03-25 03:08:10,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:10,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1603 transitions. [2021-03-25 03:08:10,235 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-25 03:08:10,236 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-25 03:08:10,236 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-25 03:08:10,236 INFO L185 Difference]: Start difference. First operand has 137 places, 183 transitions, 2436 flow. Second operand 8 states and 1603 transitions. [2021-03-25 03:08:10,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 243 transitions, 3679 flow [2021-03-25 03:08:10,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 243 transitions, 3659 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-25 03:08:10,477 INFO L241 Difference]: Finished difference. Result has 142 places, 183 transitions, 2456 flow [2021-03-25 03:08:10,477 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-25 03:08:10,477 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 78 predicate places. [2021-03-25 03:08:10,477 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:10,477 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 183 transitions, 2456 flow [2021-03-25 03:08:10,477 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 183 transitions, 2456 flow [2021-03-25 03:08:10,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 142 places, 183 transitions, 2456 flow [2021-03-25 03:08:10,822 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([464] L1151-2-->L1152-1: Formula: (= |v_#memory_int_71| (store |v_#memory_int_72| |v_thread0Thread1of1ForFork4_~#t5~0.base_21| (store (select |v_#memory_int_72| |v_thread0Thread1of1ForFork4_~#t5~0.base_21|) |v_thread0Thread1of1ForFork4_~#t5~0.offset_17| 4))) InVars {#memory_int=|v_#memory_int_72|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_21|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_17|} OutVars{#memory_int=|v_#memory_int_71|, thread0Thread1of1ForFork4_#t~nondet11=|v_thread0Thread1of1ForFork4_#t~nondet11_5|, thread0Thread1of1ForFork4_~#t5~0.base=|v_thread0Thread1of1ForFork4_~#t5~0.base_21|, thread0Thread1of1ForFork4_~#t5~0.offset=|v_thread0Thread1of1ForFork4_~#t5~0.offset_17|} 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-25 03:08:10,822 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-03-25 03:08:10,822 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:08:10,823 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:08:10,823 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-03-25 03:08:10,995 INFO L129 PetriNetUnfolder]: 3550/6544 cut-off events. [2021-03-25 03:08:10,996 INFO L130 PetriNetUnfolder]: For 37989/38430 co-relation queries the response was YES. [2021-03-25 03:08:11,035 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-25 03:08:11,092 INFO L142 LiptonReduction]: Number of co-enabled transitions 2688 [2021-03-25 03:08:11,098 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:11,098 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:11,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 621 [2021-03-25 03:08:11,099 INFO L480 AbstractCegarLoop]: Abstraction has has 142 places, 183 transitions, 2456 flow [2021-03-25 03:08:11,099 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-25 03:08:11,099 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:11,099 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-25 03:08:11,099 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 03:08:11,099 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-25 03:08:11,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -751820630, now seen corresponding path program 1 times [2021-03-25 03:08:11,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:11,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799012021] [2021-03-25 03:08:11,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:11,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:11,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:11,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:11,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 03:08:11,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:11,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:08:11,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:11,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:11,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:11,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:08:11,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:11,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:08:11,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:11,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:11,157 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-25 03:08:11,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799012021] [2021-03-25 03:08:11,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:11,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:08:11,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324028611] [2021-03-25 03:08:11,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:08:11,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:11,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:08:11,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:08:11,160 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 348 [2021-03-25 03:08:11,161 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 183 transitions, 2456 flow. Second operand has 8 states, 8 states have (on average 214.625) internal successors, (1717), 8 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:08:11,161 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:11,161 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 348 [2021-03-25 03:08:11,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:12,785 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:08:12,785 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,785 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,785 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,785 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,786 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:08:12,787 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,787 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,787 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,787 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:12,801 INFO L129 PetriNetUnfolder]: 9517/14461 cut-off events. [2021-03-25 03:08:12,801 INFO L130 PetriNetUnfolder]: For 221989/223381 co-relation queries the response was YES. [2021-03-25 03:08:12,875 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-25 03:08:12,931 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 123 selfloop transitions, 79 changer transitions 4/256 dead transitions. [2021-03-25 03:08:12,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 256 transitions, 3877 flow [2021-03-25 03:08:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:08:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:08:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1994 transitions. [2021-03-25 03:08:12,933 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6366538952745849 [2021-03-25 03:08:12,933 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1994 transitions. [2021-03-25 03:08:12,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1994 transitions. [2021-03-25 03:08:12,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:12,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1994 transitions. [2021-03-25 03:08:12,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 221.55555555555554) internal successors, (1994), 9 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:08:12,936 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-25 03:08:12,936 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-25 03:08:12,937 INFO L185 Difference]: Start difference. First operand has 142 places, 183 transitions, 2456 flow. Second operand 9 states and 1994 transitions. [2021-03-25 03:08:12,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 256 transitions, 3877 flow [2021-03-25 03:08:13,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 256 transitions, 3838 flow, removed 2 selfloop flow, removed 7 redundant places. [2021-03-25 03:08:13,135 INFO L241 Difference]: Finished difference. Result has 147 places, 216 transitions, 3423 flow [2021-03-25 03:08:13,136 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-25 03:08:13,136 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 83 predicate places. [2021-03-25 03:08:13,136 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:13,136 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 216 transitions, 3423 flow [2021-03-25 03:08:13,136 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 216 transitions, 3423 flow [2021-03-25 03:08:13,138 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 216 transitions, 3423 flow [2021-03-25 03:08:13,745 INFO L129 PetriNetUnfolder]: 4085/7572 cut-off events. [2021-03-25 03:08:13,746 INFO L130 PetriNetUnfolder]: For 61169/62186 co-relation queries the response was YES. [2021-03-25 03:08:13,796 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-25 03:08:13,973 INFO L142 LiptonReduction]: Number of co-enabled transitions 3576 [2021-03-25 03:08:13,983 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:13,983 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:13,984 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 848 [2021-03-25 03:08:13,984 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 216 transitions, 3423 flow [2021-03-25 03:08:13,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 214.625) internal successors, (1717), 8 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:08:13,984 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:13,984 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-25 03:08:13,984 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 03:08:13,985 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-25 03:08:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1471250094, now seen corresponding path program 2 times [2021-03-25 03:08:13,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:13,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315632690] [2021-03-25 03:08:13,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:14,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:14,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:08:14,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:14,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:14,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:14,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:08:14,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:14,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:08:14,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:14,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:08:14,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:14,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:14,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:14,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:14,036 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-25 03:08:14,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315632690] [2021-03-25 03:08:14,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:14,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:08:14,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990870316] [2021-03-25 03:08:14,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:08:14,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:14,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:08:14,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:08:14,039 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 03:08:14,040 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-25 03:08:14,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:14,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 03:08:14,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:17,137 INFO L129 PetriNetUnfolder]: 18370/25861 cut-off events. [2021-03-25 03:08:17,137 INFO L130 PetriNetUnfolder]: For 443940/444615 co-relation queries the response was YES. [2021-03-25 03:08:17,376 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-25 03:08:17,471 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 278 selfloop transitions, 28 changer transitions 4/343 dead transitions. [2021-03-25 03:08:17,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 343 transitions, 6035 flow [2021-03-25 03:08:17,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:08:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:08:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1816 transitions. [2021-03-25 03:08:17,473 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5798212005108557 [2021-03-25 03:08:17,473 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1816 transitions. [2021-03-25 03:08:17,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1816 transitions. [2021-03-25 03:08:17,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:17,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1816 transitions. [2021-03-25 03:08:17,475 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-25 03:08:17,477 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-25 03:08:17,477 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-25 03:08:17,477 INFO L185 Difference]: Start difference. First operand has 147 places, 216 transitions, 3423 flow. Second operand 9 states and 1816 transitions. [2021-03-25 03:08:17,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 343 transitions, 6035 flow [2021-03-25 03:08:18,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 343 transitions, 5883 flow, removed 23 selfloop flow, removed 3 redundant places. [2021-03-25 03:08:18,585 INFO L241 Difference]: Finished difference. Result has 156 places, 229 transitions, 3670 flow [2021-03-25 03:08:18,586 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-25 03:08:18,586 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 92 predicate places. [2021-03-25 03:08:18,586 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:18,586 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 229 transitions, 3670 flow [2021-03-25 03:08:18,586 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 229 transitions, 3670 flow [2021-03-25 03:08:18,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 156 places, 229 transitions, 3670 flow [2021-03-25 03:08:19,257 INFO L129 PetriNetUnfolder]: 4791/8891 cut-off events. [2021-03-25 03:08:19,257 INFO L130 PetriNetUnfolder]: For 62545/63213 co-relation queries the response was YES. [2021-03-25 03:08:19,314 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-25 03:08:19,394 INFO L142 LiptonReduction]: Number of co-enabled transitions 3876 [2021-03-25 03:08:19,403 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:19,403 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:19,403 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 817 [2021-03-25 03:08:19,403 INFO L480 AbstractCegarLoop]: Abstraction has has 156 places, 229 transitions, 3670 flow [2021-03-25 03:08:19,403 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-25 03:08:19,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:19,404 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-25 03:08:19,404 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-03-25 03:08:19,404 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-25 03:08:19,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash 290202358, now seen corresponding path program 3 times [2021-03-25 03:08:19,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:19,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534582742] [2021-03-25 03:08:19,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:19,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:19,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:08:19,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:19,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:19,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:19,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:08:19,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:19,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:08:19,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:19,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:08:19,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:19,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:19,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:19,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:19,454 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-25 03:08:19,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534582742] [2021-03-25 03:08:19,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:19,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:08:19,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874059168] [2021-03-25 03:08:19,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:08:19,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:08:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:08:19,457 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 03:08:19,458 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-25 03:08:19,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:19,458 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 03:08:19,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:22,512 INFO L129 PetriNetUnfolder]: 17939/25437 cut-off events. [2021-03-25 03:08:22,512 INFO L130 PetriNetUnfolder]: For 402935/403973 co-relation queries the response was YES. [2021-03-25 03:08:22,666 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-25 03:08:22,715 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 219 selfloop transitions, 17 changer transitions 16/285 dead transitions. [2021-03-25 03:08:22,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 285 transitions, 5034 flow [2021-03-25 03:08:22,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:08:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:08:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1404 transitions. [2021-03-25 03:08:22,716 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5763546798029556 [2021-03-25 03:08:22,716 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1404 transitions. [2021-03-25 03:08:22,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1404 transitions. [2021-03-25 03:08:22,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:22,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1404 transitions. [2021-03-25 03:08:22,718 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-25 03:08:22,719 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-25 03:08:22,719 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-25 03:08:22,719 INFO L185 Difference]: Start difference. First operand has 156 places, 229 transitions, 3670 flow. Second operand 7 states and 1404 transitions. [2021-03-25 03:08:22,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 285 transitions, 5034 flow [2021-03-25 03:08:23,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 285 transitions, 4997 flow, removed 16 selfloop flow, removed 2 redundant places. [2021-03-25 03:08:23,536 INFO L241 Difference]: Finished difference. Result has 162 places, 228 transitions, 3660 flow [2021-03-25 03:08:23,537 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-25 03:08:23,537 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 98 predicate places. [2021-03-25 03:08:23,537 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:23,537 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 228 transitions, 3660 flow [2021-03-25 03:08:23,537 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 228 transitions, 3660 flow [2021-03-25 03:08:23,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 162 places, 228 transitions, 3660 flow [2021-03-25 03:08:24,257 INFO L129 PetriNetUnfolder]: 4765/8869 cut-off events. [2021-03-25 03:08:24,257 INFO L130 PetriNetUnfolder]: For 60810/61461 co-relation queries the response was YES. [2021-03-25 03:08:24,320 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-25 03:08:24,586 INFO L142 LiptonReduction]: Number of co-enabled transitions 3864 [2021-03-25 03:08:24,595 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:24,595 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:24,595 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1058 [2021-03-25 03:08:24,595 INFO L480 AbstractCegarLoop]: Abstraction has has 162 places, 228 transitions, 3660 flow [2021-03-25 03:08:24,595 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-25 03:08:24,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:24,596 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-25 03:08:24,596 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-03-25 03:08:24,596 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-25 03:08:24,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:24,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1195912476, now seen corresponding path program 1 times [2021-03-25 03:08:24,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:24,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016627553] [2021-03-25 03:08:24,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:24,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:08:24,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 03:08:24,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:08:24,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:24,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:08:24,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:08:24,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:08:24,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:24,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:24,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:24,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-25 03:08:24,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016627553] [2021-03-25 03:08:24,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:24,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:08:24,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676313352] [2021-03-25 03:08:24,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:08:24,690 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:24,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:08:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:08:24,693 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 03:08:24,694 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-25 03:08:24,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:24,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 03:08:24,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:28,207 INFO L129 PetriNetUnfolder]: 19146/27056 cut-off events. [2021-03-25 03:08:28,207 INFO L130 PetriNetUnfolder]: For 440684/441791 co-relation queries the response was YES. [2021-03-25 03:08:28,401 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-25 03:08:28,474 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 228 selfloop transitions, 20 changer transitions 8/289 dead transitions. [2021-03-25 03:08:28,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 289 transitions, 5156 flow [2021-03-25 03:08:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:08:28,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:08:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1385 transitions. [2021-03-25 03:08:28,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5685550082101807 [2021-03-25 03:08:28,476 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1385 transitions. [2021-03-25 03:08:28,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1385 transitions. [2021-03-25 03:08:28,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:28,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1385 transitions. [2021-03-25 03:08:28,477 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-25 03:08:28,478 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-25 03:08:28,479 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-25 03:08:28,479 INFO L185 Difference]: Start difference. First operand has 162 places, 228 transitions, 3660 flow. Second operand 7 states and 1385 transitions. [2021-03-25 03:08:28,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 289 transitions, 5156 flow [2021-03-25 03:08:29,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 289 transitions, 5055 flow, removed 2 selfloop flow, removed 5 redundant places. [2021-03-25 03:08:29,597 INFO L241 Difference]: Finished difference. Result has 166 places, 233 transitions, 3781 flow [2021-03-25 03:08:29,598 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-25 03:08:29,598 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 102 predicate places. [2021-03-25 03:08:29,598 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:29,598 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 233 transitions, 3781 flow [2021-03-25 03:08:29,598 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 233 transitions, 3781 flow [2021-03-25 03:08:29,600 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 166 places, 233 transitions, 3781 flow [2021-03-25 03:08:30,477 INFO L129 PetriNetUnfolder]: 4946/9156 cut-off events. [2021-03-25 03:08:30,477 INFO L130 PetriNetUnfolder]: For 62289/63031 co-relation queries the response was YES. [2021-03-25 03:08:30,530 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-25 03:08:30,606 INFO L142 LiptonReduction]: Number of co-enabled transitions 4012 [2021-03-25 03:08:30,615 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:30,615 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:30,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1017 [2021-03-25 03:08:30,615 INFO L480 AbstractCegarLoop]: Abstraction has has 166 places, 233 transitions, 3781 flow [2021-03-25 03:08:30,616 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-25 03:08:30,616 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:30,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] [2021-03-25 03:08:30,616 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-03-25 03:08:30,616 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-25 03:08:30,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:30,616 INFO L82 PathProgramCache]: Analyzing trace with hash 120244828, now seen corresponding path program 2 times [2021-03-25 03:08:30,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:30,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323281997] [2021-03-25 03:08:30,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:30,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:30,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:08:30,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:08:30,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:08:30,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:30,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:08:30,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:08:30,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:30,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:30,685 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-25 03:08:30,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323281997] [2021-03-25 03:08:30,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:30,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:08:30,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610579675] [2021-03-25 03:08:30,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:08:30,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:30,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:08:30,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:08:30,688 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 348 [2021-03-25 03:08:30,689 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 233 transitions, 3781 flow. Second operand has 9 states, 9 states have (on average 229.44444444444446) internal successors, (2065), 9 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:08:30,689 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:30,689 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 348 [2021-03-25 03:08:30,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:32,814 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:08:32,814 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:08:32,814 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:32,815 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:32,815 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:32,839 INFO L129 PetriNetUnfolder]: 11450/17555 cut-off events. [2021-03-25 03:08:32,839 INFO L130 PetriNetUnfolder]: For 325356/328166 co-relation queries the response was YES. [2021-03-25 03:08:32,978 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-25 03:08:33,048 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 128 selfloop transitions, 93 changer transitions 2/274 dead transitions. [2021-03-25 03:08:33,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 274 transitions, 4812 flow [2021-03-25 03:08:33,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:08:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:08:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1654 transitions. [2021-03-25 03:08:33,050 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6789819376026273 [2021-03-25 03:08:33,050 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1654 transitions. [2021-03-25 03:08:33,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1654 transitions. [2021-03-25 03:08:33,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:33,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1654 transitions. [2021-03-25 03:08:33,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 236.28571428571428) internal successors, (1654), 7 states have internal predecessors, (1654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:08:33,053 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-25 03:08:33,053 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-25 03:08:33,053 INFO L185 Difference]: Start difference. First operand has 166 places, 233 transitions, 3781 flow. Second operand 7 states and 1654 transitions. [2021-03-25 03:08:33,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 274 transitions, 4812 flow [2021-03-25 03:08:33,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 274 transitions, 4754 flow, removed 15 selfloop flow, removed 4 redundant places. [2021-03-25 03:08:33,944 INFO L241 Difference]: Finished difference. Result has 171 places, 247 transitions, 4422 flow [2021-03-25 03:08:33,944 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-25 03:08:33,944 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 107 predicate places. [2021-03-25 03:08:33,944 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:33,944 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 247 transitions, 4422 flow [2021-03-25 03:08:33,944 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 247 transitions, 4422 flow [2021-03-25 03:08:33,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 247 transitions, 4422 flow [2021-03-25 03:08:34,728 INFO L129 PetriNetUnfolder]: 4884/9076 cut-off events. [2021-03-25 03:08:34,728 INFO L130 PetriNetUnfolder]: For 76443/76880 co-relation queries the response was YES. [2021-03-25 03:08:34,993 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-25 03:08:35,064 INFO L142 LiptonReduction]: Number of co-enabled transitions 4228 [2021-03-25 03:08:35,074 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:35,074 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:35,074 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1130 [2021-03-25 03:08:35,074 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 247 transitions, 4422 flow [2021-03-25 03:08:35,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 229.44444444444446) internal successors, (2065), 9 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:08:35,075 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:35,075 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-25 03:08:35,075 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 03:08:35,075 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-25 03:08:35,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:35,075 INFO L82 PathProgramCache]: Analyzing trace with hash -2125628681, now seen corresponding path program 1 times [2021-03-25 03:08:35,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:35,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047699080] [2021-03-25 03:08:35,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:35,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:35,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:35,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:35,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 03:08:35,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:35,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 03:08:35,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:35,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:35,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:35,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:08:35,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:35,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:08:35,122 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-25 03:08:35,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047699080] [2021-03-25 03:08:35,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:35,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 03:08:35,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509100432] [2021-03-25 03:08:35,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 03:08:35,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:35,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 03:08:35,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 03:08:35,124 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 348 [2021-03-25 03:08:35,125 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-25 03:08:35,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:35,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 348 [2021-03-25 03:08:35,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:37,421 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:08:37,421 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,421 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,421 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,421 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,443 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([488] L1163-2-->L1164-2: Formula: (and (= |v_ULTIMATE.start_main_#t~mem19_15| (select (select |v_#memory_int_107| v_~v~0.base_35) v_~v~0.offset_35)) (let ((.cse0 (= 88 |v_ULTIMATE.start_main_#t~mem19_15|))) (or (and (not |v_ULTIMATE.start_main_#t~short21_30|) (not .cse0)) (and .cse0 |v_ULTIMATE.start_main_#t~short21_30|)))) InVars {~v~0.offset=v_~v~0.offset_35, #memory_int=|v_#memory_int_107|, ~v~0.base=v_~v~0.base_35} OutVars{~v~0.offset=v_~v~0.offset_35, ULTIMATE.start_main_#t~mem19=|v_ULTIMATE.start_main_#t~mem19_15|, #memory_int=|v_#memory_int_107|, ULTIMATE.start_main_#t~mem18=|v_ULTIMATE.start_main_#t~mem18_34|, ULTIMATE.start_main_#t~short21=|v_ULTIMATE.start_main_#t~short21_30|, ~v~0.base=v_~v~0.base_35} 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-25 03:08:37,443 INFO L384 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,444 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,444 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,444 INFO L387 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2021-03-25 03:08:37,447 INFO L129 PetriNetUnfolder]: 11130/17017 cut-off events. [2021-03-25 03:08:37,448 INFO L130 PetriNetUnfolder]: For 385062/388198 co-relation queries the response was YES. [2021-03-25 03:08:37,556 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-25 03:08:37,629 INFO L132 encePairwiseOnDemand]: 340/348 looper letters, 161 selfloop transitions, 61 changer transitions 2/275 dead transitions. [2021-03-25 03:08:37,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 275 transitions, 5184 flow [2021-03-25 03:08:37,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:08:37,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:08:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1630 transitions. [2021-03-25 03:08:37,631 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6691297208538588 [2021-03-25 03:08:37,631 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1630 transitions. [2021-03-25 03:08:37,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1630 transitions. [2021-03-25 03:08:37,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:37,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1630 transitions. [2021-03-25 03:08:37,633 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-25 03:08:37,634 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-25 03:08:37,634 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-25 03:08:37,634 INFO L185 Difference]: Start difference. First operand has 171 places, 247 transitions, 4422 flow. Second operand 7 states and 1630 transitions. [2021-03-25 03:08:37,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 275 transitions, 5184 flow [2021-03-25 03:08:38,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 275 transitions, 5098 flow, removed 21 selfloop flow, removed 3 redundant places. [2021-03-25 03:08:38,669 INFO L241 Difference]: Finished difference. Result has 175 places, 251 transitions, 4626 flow [2021-03-25 03:08:38,669 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-25 03:08:38,670 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 111 predicate places. [2021-03-25 03:08:38,670 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:38,670 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 251 transitions, 4626 flow [2021-03-25 03:08:38,670 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 251 transitions, 4626 flow [2021-03-25 03:08:38,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 175 places, 251 transitions, 4626 flow [2021-03-25 03:08:39,567 INFO L129 PetriNetUnfolder]: 4894/9078 cut-off events. [2021-03-25 03:08:39,567 INFO L130 PetriNetUnfolder]: For 82947/83893 co-relation queries the response was YES. [2021-03-25 03:08:39,644 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-25 03:08:39,760 INFO L142 LiptonReduction]: Number of co-enabled transitions 4244 [2021-03-25 03:08:39,770 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:39,771 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:39,771 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1101 [2021-03-25 03:08:39,771 INFO L480 AbstractCegarLoop]: Abstraction has has 175 places, 251 transitions, 4626 flow [2021-03-25 03:08:39,771 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-25 03:08:39,771 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:39,771 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-25 03:08:39,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-03-25 03:08:39,771 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-25 03:08:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1621581695, now seen corresponding path program 1 times [2021-03-25 03:08:39,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:39,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226523178] [2021-03-25 03:08:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:39,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:08:39,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:08:39,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:08:39,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:08:39,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:08:39,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:08:39,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:08:39,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:08:39,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:39,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:39,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:39,925 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-25 03:08:39,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226523178] [2021-03-25 03:08:39,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:39,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:08:39,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057074540] [2021-03-25 03:08:39,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:08:39,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:39,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:08:39,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:08:39,928 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 03:08:39,929 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-25 03:08:39,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:39,929 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 03:08:39,929 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:40,281 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2021-03-25 03:08:43,975 INFO L129 PetriNetUnfolder]: 19955/28159 cut-off events. [2021-03-25 03:08:43,975 INFO L130 PetriNetUnfolder]: For 607182/607990 co-relation queries the response was YES. [2021-03-25 03:08:44,191 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-25 03:08:44,287 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 243 selfloop transitions, 58 changer transitions 3/337 dead transitions. [2021-03-25 03:08:44,287 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 337 transitions, 6924 flow [2021-03-25 03:08:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:08:44,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:08:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1953 transitions. [2021-03-25 03:08:44,289 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5612068965517242 [2021-03-25 03:08:44,289 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1953 transitions. [2021-03-25 03:08:44,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1953 transitions. [2021-03-25 03:08:44,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:44,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1953 transitions. [2021-03-25 03:08:44,290 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-25 03:08:44,292 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-25 03:08:44,292 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-25 03:08:44,292 INFO L185 Difference]: Start difference. First operand has 175 places, 251 transitions, 4626 flow. Second operand 10 states and 1953 transitions. [2021-03-25 03:08:44,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 337 transitions, 6924 flow [2021-03-25 03:08:45,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 337 transitions, 6728 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-03-25 03:08:45,521 INFO L241 Difference]: Finished difference. Result has 182 places, 264 transitions, 4958 flow [2021-03-25 03:08:45,521 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-25 03:08:45,521 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 118 predicate places. [2021-03-25 03:08:45,521 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:45,521 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 264 transitions, 4958 flow [2021-03-25 03:08:45,521 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 264 transitions, 4958 flow [2021-03-25 03:08:45,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 182 places, 264 transitions, 4958 flow [2021-03-25 03:08:46,460 INFO L129 PetriNetUnfolder]: 5208/9668 cut-off events. [2021-03-25 03:08:46,460 INFO L130 PetriNetUnfolder]: For 81515/82343 co-relation queries the response was YES. [2021-03-25 03:08:46,541 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-25 03:08:46,652 INFO L142 LiptonReduction]: Number of co-enabled transitions 4438 [2021-03-25 03:08:46,664 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:46,664 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:46,664 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1143 [2021-03-25 03:08:46,664 INFO L480 AbstractCegarLoop]: Abstraction has has 182 places, 264 transitions, 4958 flow [2021-03-25 03:08:46,665 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-25 03:08:46,665 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:46,665 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-25 03:08:46,665 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-03-25 03:08:46,665 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-25 03:08:46,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:46,665 INFO L82 PathProgramCache]: Analyzing trace with hash 644705952, now seen corresponding path program 1 times [2021-03-25 03:08:46,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:46,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916289211] [2021-03-25 03:08:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:46,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:08:46,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:08:46,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 03:08:46,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:08:46,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:46,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:08:46,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:08:46,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:08:46,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:46,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:46,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 03:08:46,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916289211] [2021-03-25 03:08:46,769 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:46,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:08:46,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319784937] [2021-03-25 03:08:46,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:08:46,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:08:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:08:46,773 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 03:08:46,773 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-25 03:08:46,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:46,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 03:08:46,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:50,425 INFO L129 PetriNetUnfolder]: 20148/28129 cut-off events. [2021-03-25 03:08:50,425 INFO L130 PetriNetUnfolder]: For 590738/591089 co-relation queries the response was YES. [2021-03-25 03:08:50,662 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-25 03:08:50,997 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 264 selfloop transitions, 79 changer transitions 6/380 dead transitions. [2021-03-25 03:08:50,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 380 transitions, 7697 flow [2021-03-25 03:08:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:08:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:08:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2156 transitions. [2021-03-25 03:08:50,999 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2021-03-25 03:08:50,999 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2156 transitions. [2021-03-25 03:08:50,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2156 transitions. [2021-03-25 03:08:50,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:50,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2156 transitions. [2021-03-25 03:08:51,001 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-25 03:08:51,002 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-25 03:08:51,002 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-25 03:08:51,002 INFO L185 Difference]: Start difference. First operand has 182 places, 264 transitions, 4958 flow. Second operand 11 states and 2156 transitions. [2021-03-25 03:08:51,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 380 transitions, 7697 flow [2021-03-25 03:08:52,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 380 transitions, 7513 flow, removed 56 selfloop flow, removed 7 redundant places. [2021-03-25 03:08:52,131 INFO L241 Difference]: Finished difference. Result has 188 places, 271 transitions, 5080 flow [2021-03-25 03:08:52,132 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-25 03:08:52,132 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 124 predicate places. [2021-03-25 03:08:52,132 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:52,132 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 271 transitions, 5080 flow [2021-03-25 03:08:52,132 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 271 transitions, 5080 flow [2021-03-25 03:08:52,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 271 transitions, 5080 flow [2021-03-25 03:08:53,069 INFO L129 PetriNetUnfolder]: 5107/9508 cut-off events. [2021-03-25 03:08:53,069 INFO L130 PetriNetUnfolder]: For 77426/78077 co-relation queries the response was YES. [2021-03-25 03:08:53,145 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-25 03:08:53,255 INFO L142 LiptonReduction]: Number of co-enabled transitions 4392 [2021-03-25 03:08:53,266 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:53,266 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:53,267 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1135 [2021-03-25 03:08:53,267 INFO L480 AbstractCegarLoop]: Abstraction has has 188 places, 271 transitions, 5080 flow [2021-03-25 03:08:53,267 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-25 03:08:53,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:53,267 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-25 03:08:53,268 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-03-25 03:08:53,268 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-25 03:08:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1522625699, now seen corresponding path program 2 times [2021-03-25 03:08:53,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:53,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545429543] [2021-03-25 03:08:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:53,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:08:53,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:08:53,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:08:53,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:08:53,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:08:53,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:08:53,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:08:53,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:08:53,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:08:53,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:08:53,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:53,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:53,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:53,476 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-25 03:08:53,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545429543] [2021-03-25 03:08:53,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:53,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:08:53,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828935291] [2021-03-25 03:08:53,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:08:53,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:53,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:08:53,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:08:53,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 03:08:53,479 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-25 03:08:53,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:53,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 03:08:53,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:57,165 INFO L129 PetriNetUnfolder]: 18946/26878 cut-off events. [2021-03-25 03:08:57,165 INFO L130 PetriNetUnfolder]: For 548368/549175 co-relation queries the response was YES. [2021-03-25 03:08:57,390 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-25 03:08:57,438 INFO L132 encePairwiseOnDemand]: 336/348 looper letters, 218 selfloop transitions, 60 changer transitions 20/332 dead transitions. [2021-03-25 03:08:57,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 332 transitions, 6825 flow [2021-03-25 03:08:57,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:08:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:08:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1944 transitions. [2021-03-25 03:08:57,440 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5586206896551724 [2021-03-25 03:08:57,440 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1944 transitions. [2021-03-25 03:08:57,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1944 transitions. [2021-03-25 03:08:57,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:08:57,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1944 transitions. [2021-03-25 03:08:57,442 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-25 03:08:57,444 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-25 03:08:57,444 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-25 03:08:57,444 INFO L185 Difference]: Start difference. First operand has 188 places, 271 transitions, 5080 flow. Second operand 10 states and 1944 transitions. [2021-03-25 03:08:57,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 332 transitions, 6825 flow [2021-03-25 03:08:58,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 332 transitions, 6613 flow, removed 46 selfloop flow, removed 6 redundant places. [2021-03-25 03:08:58,562 INFO L241 Difference]: Finished difference. Result has 193 places, 253 transitions, 4718 flow [2021-03-25 03:08:58,563 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-25 03:08:58,563 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 129 predicate places. [2021-03-25 03:08:58,563 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:08:58,563 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 253 transitions, 4718 flow [2021-03-25 03:08:58,563 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 253 transitions, 4718 flow [2021-03-25 03:08:58,565 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 193 places, 253 transitions, 4718 flow [2021-03-25 03:08:59,221 INFO L129 PetriNetUnfolder]: 4836/8999 cut-off events. [2021-03-25 03:08:59,222 INFO L130 PetriNetUnfolder]: For 74580/75958 co-relation queries the response was YES. [2021-03-25 03:08:59,294 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-25 03:08:59,387 INFO L142 LiptonReduction]: Number of co-enabled transitions 4176 [2021-03-25 03:08:59,402 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:08:59,402 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:08:59,402 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 839 [2021-03-25 03:08:59,402 INFO L480 AbstractCegarLoop]: Abstraction has has 193 places, 253 transitions, 4718 flow [2021-03-25 03:08:59,403 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-25 03:08:59,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:08:59,403 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-25 03:08:59,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-03-25 03:08:59,403 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-25 03:08:59,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:08:59,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1469979140, now seen corresponding path program 1 times [2021-03-25 03:08:59,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:08:59,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394178215] [2021-03-25 03:08:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:08:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:08:59,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:08:59,464 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.6 percent of original size [2021-03-25 03:08:59,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:08:59,483 INFO L142 QuantifierPusher]: treesize reduction 4, result has 92.0 percent of original size [2021-03-25 03:08:59,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:08:59,500 INFO L142 QuantifierPusher]: treesize reduction 4, result has 91.8 percent of original size [2021-03-25 03:08:59,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:08:59,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:08:59,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:08:59,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:08:59,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:08:59,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:08:59,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:08:59,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:08:59,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:08:59,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:08:59,633 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-25 03:08:59,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394178215] [2021-03-25 03:08:59,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:08:59,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:08:59,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205711010] [2021-03-25 03:08:59,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:08:59,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:08:59,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:08:59,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:08:59,635 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 03:08:59,636 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-25 03:08:59,636 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:08:59,636 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 03:08:59,636 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:08:59,805 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2021-03-25 03:09:03,531 INFO L129 PetriNetUnfolder]: 18685/26386 cut-off events. [2021-03-25 03:09:03,532 INFO L130 PetriNetUnfolder]: For 538205/538638 co-relation queries the response was YES. [2021-03-25 03:09:03,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159053 conditions, 26386 events. 18685/26386 cut-off events. For 538205/538638 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 161922 event pairs, 3131 based on Foata normal form. 204/20338 useless extension candidates. Maximal degree in co-relation 145331. Up to 13803 conditions per place. [2021-03-25 03:09:04,089 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 220 selfloop transitions, 82 changer transitions 11/344 dead transitions. [2021-03-25 03:09:04,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 344 transitions, 6866 flow [2021-03-25 03:09:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:09:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:09:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2119 transitions. [2021-03-25 03:09:04,092 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5535527690700105 [2021-03-25 03:09:04,093 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2119 transitions. [2021-03-25 03:09:04,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2119 transitions. [2021-03-25 03:09:04,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:04,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2119 transitions. [2021-03-25 03:09:04,095 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-25 03:09:04,097 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-25 03:09:04,097 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-25 03:09:04,097 INFO L185 Difference]: Start difference. First operand has 193 places, 253 transitions, 4718 flow. Second operand 11 states and 2119 transitions. [2021-03-25 03:09:04,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 344 transitions, 6866 flow [2021-03-25 03:09:05,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 344 transitions, 6667 flow, removed 32 selfloop flow, removed 9 redundant places. [2021-03-25 03:09:05,027 INFO L241 Difference]: Finished difference. Result has 197 places, 269 transitions, 5178 flow [2021-03-25 03:09:05,027 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=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5178, PETRI_PLACES=197, PETRI_TRANSITIONS=269} [2021-03-25 03:09:05,027 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 133 predicate places. [2021-03-25 03:09:05,028 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:05,028 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 269 transitions, 5178 flow [2021-03-25 03:09:05,028 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 269 transitions, 5178 flow [2021-03-25 03:09:05,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 269 transitions, 5178 flow [2021-03-25 03:09:05,893 INFO L129 PetriNetUnfolder]: 4947/9250 cut-off events. [2021-03-25 03:09:05,893 INFO L130 PetriNetUnfolder]: For 79761/81150 co-relation queries the response was YES. [2021-03-25 03:09:05,951 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31189 conditions, 9250 events. 4947/9250 cut-off events. For 79761/81150 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 77419 event pairs, 16 based on Foata normal form. 274/6639 useless extension candidates. Maximal degree in co-relation 29707. Up to 2448 conditions per place. [2021-03-25 03:09:06,029 INFO L142 LiptonReduction]: Number of co-enabled transitions 4196 [2021-03-25 03:09:06,042 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:06,042 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:06,042 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1014 [2021-03-25 03:09:06,042 INFO L480 AbstractCegarLoop]: Abstraction has has 197 places, 269 transitions, 5178 flow [2021-03-25 03:09:06,043 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-25 03:09:06,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:06,043 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-25 03:09:06,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-03-25 03:09:06,043 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-25 03:09:06,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash 253186649, now seen corresponding path program 1 times [2021-03-25 03:09:06,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:06,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123596381] [2021-03-25 03:09:06,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:06,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:09:06,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:09:06,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:06,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:09:06,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:09:06,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:06,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:09:06,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:06,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:06,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 03:09:06,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123596381] [2021-03-25 03:09:06,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:06,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:09:06,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427374651] [2021-03-25 03:09:06,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:09:06,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:06,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:09:06,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:09:06,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 03:09:06,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 269 transitions, 5178 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-25 03:09:06,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:06,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 03:09:06,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:09,713 INFO L129 PetriNetUnfolder]: 17110/24788 cut-off events. [2021-03-25 03:09:09,713 INFO L130 PetriNetUnfolder]: For 531445/531462 co-relation queries the response was YES. [2021-03-25 03:09:09,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149343 conditions, 24788 events. 17110/24788 cut-off events. For 531445/531462 co-relation queries the response was YES. Maximal size of possible extension queue 1304. Compared 159672 event pairs, 3552 based on Foata normal form. 433/19327 useless extension candidates. Maximal degree in co-relation 138948. Up to 10694 conditions per place. [2021-03-25 03:09:09,922 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 248 selfloop transitions, 64 changer transitions 27/374 dead transitions. [2021-03-25 03:09:09,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 374 transitions, 7632 flow [2021-03-25 03:09:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:09:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:09:09,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1802 transitions. [2021-03-25 03:09:09,925 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5753512132822478 [2021-03-25 03:09:09,925 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1802 transitions. [2021-03-25 03:09:09,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1802 transitions. [2021-03-25 03:09:09,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:09,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1802 transitions. [2021-03-25 03:09:09,927 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-25 03:09:09,929 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-25 03:09:09,929 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-25 03:09:09,929 INFO L185 Difference]: Start difference. First operand has 197 places, 269 transitions, 5178 flow. Second operand 9 states and 1802 transitions. [2021-03-25 03:09:09,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 374 transitions, 7632 flow [2021-03-25 03:09:10,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 374 transitions, 7518 flow, removed 25 selfloop flow, removed 8 redundant places. [2021-03-25 03:09:10,797 INFO L241 Difference]: Finished difference. Result has 200 places, 274 transitions, 5300 flow [2021-03-25 03:09:10,798 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4895, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5300, PETRI_PLACES=200, PETRI_TRANSITIONS=274} [2021-03-25 03:09:10,798 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 136 predicate places. [2021-03-25 03:09:10,798 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:10,798 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 274 transitions, 5300 flow [2021-03-25 03:09:10,798 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 274 transitions, 5300 flow [2021-03-25 03:09:10,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 274 transitions, 5300 flow [2021-03-25 03:09:11,645 INFO L129 PetriNetUnfolder]: 4880/9155 cut-off events. [2021-03-25 03:09:11,645 INFO L130 PetriNetUnfolder]: For 71518/72967 co-relation queries the response was YES. [2021-03-25 03:09:11,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29432 conditions, 9155 events. 4880/9155 cut-off events. For 71518/72967 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 76777 event pairs, 17 based on Foata normal form. 237/6444 useless extension candidates. Maximal degree in co-relation 27932. Up to 2512 conditions per place. [2021-03-25 03:09:11,791 INFO L142 LiptonReduction]: Number of co-enabled transitions 3998 [2021-03-25 03:09:11,802 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:11,802 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:11,802 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1004 [2021-03-25 03:09:11,803 INFO L480 AbstractCegarLoop]: Abstraction has has 200 places, 274 transitions, 5300 flow [2021-03-25 03:09:11,803 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-25 03:09:11,803 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:11,803 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-25 03:09:11,803 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-03-25 03:09:11,803 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-25 03:09:11,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:11,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1642776239, now seen corresponding path program 2 times [2021-03-25 03:09:11,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:11,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491191781] [2021-03-25 03:09:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:11,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:09:11,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:09:11,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:11,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:09:11,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:09:11,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:11,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:09:11,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:11,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:11,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:11,883 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-25 03:09:11,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491191781] [2021-03-25 03:09:11,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:11,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:09:11,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269637894] [2021-03-25 03:09:11,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:09:11,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:09:11,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:09:11,886 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 03:09:11,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 274 transitions, 5300 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-25 03:09:11,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:11,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 03:09:11,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:14,915 INFO L129 PetriNetUnfolder]: 16122/23401 cut-off events. [2021-03-25 03:09:14,915 INFO L130 PetriNetUnfolder]: For 467703/467781 co-relation queries the response was YES. [2021-03-25 03:09:15,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137643 conditions, 23401 events. 16122/23401 cut-off events. For 467703/467781 co-relation queries the response was YES. Maximal size of possible extension queue 1253. Compared 150172 event pairs, 3633 based on Foata normal form. 100/17808 useless extension candidates. Maximal degree in co-relation 128931. Up to 17600 conditions per place. [2021-03-25 03:09:15,460 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 232 selfloop transitions, 38 changer transitions 3/308 dead transitions. [2021-03-25 03:09:15,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 308 transitions, 6394 flow [2021-03-25 03:09:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:09:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:09:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1392 transitions. [2021-03-25 03:09:15,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2021-03-25 03:09:15,462 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1392 transitions. [2021-03-25 03:09:15,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1392 transitions. [2021-03-25 03:09:15,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:15,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1392 transitions. [2021-03-25 03:09:15,464 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-25 03:09:15,465 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-25 03:09:15,466 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-25 03:09:15,466 INFO L185 Difference]: Start difference. First operand has 200 places, 274 transitions, 5300 flow. Second operand 7 states and 1392 transitions. [2021-03-25 03:09:15,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 308 transitions, 6394 flow [2021-03-25 03:09:16,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 308 transitions, 6363 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 03:09:16,277 INFO L241 Difference]: Finished difference. Result has 206 places, 276 transitions, 5409 flow [2021-03-25 03:09:16,277 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5179, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5409, PETRI_PLACES=206, PETRI_TRANSITIONS=276} [2021-03-25 03:09:16,278 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 142 predicate places. [2021-03-25 03:09:16,278 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:16,278 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 276 transitions, 5409 flow [2021-03-25 03:09:16,278 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 276 transitions, 5409 flow [2021-03-25 03:09:16,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 206 places, 276 transitions, 5409 flow [2021-03-25 03:09:17,176 INFO L129 PetriNetUnfolder]: 4834/9070 cut-off events. [2021-03-25 03:09:17,176 INFO L130 PetriNetUnfolder]: For 71914/73379 co-relation queries the response was YES. [2021-03-25 03:09:17,239 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29073 conditions, 9070 events. 4834/9070 cut-off events. For 71914/73379 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 75999 event pairs, 15 based on Foata normal form. 269/6441 useless extension candidates. Maximal degree in co-relation 27234. Up to 2492 conditions per place. [2021-03-25 03:09:17,320 INFO L142 LiptonReduction]: Number of co-enabled transitions 3934 [2021-03-25 03:09:17,331 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:17,331 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:17,332 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1054 [2021-03-25 03:09:17,332 INFO L480 AbstractCegarLoop]: Abstraction has has 206 places, 276 transitions, 5409 flow [2021-03-25 03:09:17,332 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-25 03:09:17,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:17,332 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-25 03:09:17,332 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-03-25 03:09:17,332 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-25 03:09:17,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1762518449, now seen corresponding path program 3 times [2021-03-25 03:09:17,333 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:17,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340210352] [2021-03-25 03:09:17,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:17,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:09:17,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 03:09:17,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:09:17,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:09:17,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:17,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:09:17,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:09:17,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,494 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:09:17,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:09:17,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:09:17,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:17,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:17,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:17,535 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-25 03:09:17,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340210352] [2021-03-25 03:09:17,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:17,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:09:17,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681479781] [2021-03-25 03:09:17,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:09:17,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:09:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:09:17,538 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 03:09:17,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 276 transitions, 5409 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-25 03:09:17,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:17,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 03:09:17,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:21,122 INFO L129 PetriNetUnfolder]: 16873/24663 cut-off events. [2021-03-25 03:09:21,122 INFO L130 PetriNetUnfolder]: For 474213/474291 co-relation queries the response was YES. [2021-03-25 03:09:21,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141309 conditions, 24663 events. 16873/24663 cut-off events. For 474213/474291 co-relation queries the response was YES. Maximal size of possible extension queue 1336. Compared 161394 event pairs, 3281 based on Foata normal form. 143/18624 useless extension candidates. Maximal degree in co-relation 132999. Up to 16456 conditions per place. [2021-03-25 03:09:21,370 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 240 selfloop transitions, 60 changer transitions 10/345 dead transitions. [2021-03-25 03:09:21,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 345 transitions, 7397 flow [2021-03-25 03:09:21,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:09:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:09:21,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1374 transitions. [2021-03-25 03:09:21,372 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5640394088669951 [2021-03-25 03:09:21,372 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1374 transitions. [2021-03-25 03:09:21,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1374 transitions. [2021-03-25 03:09:21,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:21,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1374 transitions. [2021-03-25 03:09:21,373 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-25 03:09:21,374 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-25 03:09:21,375 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-25 03:09:21,375 INFO L185 Difference]: Start difference. First operand has 206 places, 276 transitions, 5409 flow. Second operand 7 states and 1374 transitions. [2021-03-25 03:09:21,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 345 transitions, 7397 flow [2021-03-25 03:09:22,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 345 transitions, 7365 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 03:09:22,226 INFO L241 Difference]: Finished difference. Result has 213 places, 286 transitions, 5834 flow [2021-03-25 03:09:22,226 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5368, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5834, PETRI_PLACES=213, PETRI_TRANSITIONS=286} [2021-03-25 03:09:22,227 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 149 predicate places. [2021-03-25 03:09:22,227 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:22,227 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 286 transitions, 5834 flow [2021-03-25 03:09:22,227 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 286 transitions, 5834 flow [2021-03-25 03:09:22,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 213 places, 286 transitions, 5834 flow [2021-03-25 03:09:23,139 INFO L129 PetriNetUnfolder]: 5132/9616 cut-off events. [2021-03-25 03:09:23,139 INFO L130 PetriNetUnfolder]: For 74472/75915 co-relation queries the response was YES. [2021-03-25 03:09:23,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30670 conditions, 9616 events. 5132/9616 cut-off events. For 74472/75915 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 81251 event pairs, 5 based on Foata normal form. 238/6699 useless extension candidates. Maximal degree in co-relation 28605. Up to 2682 conditions per place. [2021-03-25 03:09:23,301 INFO L142 LiptonReduction]: Number of co-enabled transitions 4104 [2021-03-25 03:09:23,314 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:23,314 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:23,314 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1087 [2021-03-25 03:09:23,314 INFO L480 AbstractCegarLoop]: Abstraction has has 213 places, 286 transitions, 5834 flow [2021-03-25 03:09:23,315 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-25 03:09:23,315 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:23,315 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-25 03:09:23,315 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-03-25 03:09:23,315 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-25 03:09:23,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1816028813, now seen corresponding path program 1 times [2021-03-25 03:09:23,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:23,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529514014] [2021-03-25 03:09:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:23,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:09:23,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:09:23,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 03:09:23,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:09:23,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:09:23,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:09:23,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:09:23,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:09:23,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:09:23,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:09:23,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:09:23,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:23,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:23,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:23,550 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-25 03:09:23,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529514014] [2021-03-25 03:09:23,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:23,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:09:23,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331054925] [2021-03-25 03:09:23,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:09:23,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:09:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:09:23,553 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 03:09:23,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 286 transitions, 5834 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-25 03:09:23,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:23,554 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 03:09:23,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:27,331 INFO L129 PetriNetUnfolder]: 16619/24230 cut-off events. [2021-03-25 03:09:27,332 INFO L130 PetriNetUnfolder]: For 489320/489864 co-relation queries the response was YES. [2021-03-25 03:09:27,510 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139231 conditions, 24230 events. 16619/24230 cut-off events. For 489320/489864 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 156166 event pairs, 2650 based on Foata normal form. 161/18357 useless extension candidates. Maximal degree in co-relation 132009. Up to 16457 conditions per place. [2021-03-25 03:09:27,550 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 221 selfloop transitions, 61 changer transitions 12/333 dead transitions. [2021-03-25 03:09:27,550 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 333 transitions, 6973 flow [2021-03-25 03:09:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:09:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:09:27,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1737 transitions. [2021-03-25 03:09:27,553 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5545977011494253 [2021-03-25 03:09:27,553 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1737 transitions. [2021-03-25 03:09:27,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1737 transitions. [2021-03-25 03:09:27,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:27,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1737 transitions. [2021-03-25 03:09:27,555 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-25 03:09:27,556 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-25 03:09:27,557 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-25 03:09:27,557 INFO L185 Difference]: Start difference. First operand has 213 places, 286 transitions, 5834 flow. Second operand 9 states and 1737 transitions. [2021-03-25 03:09:27,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 333 transitions, 6973 flow [2021-03-25 03:09:28,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 333 transitions, 6783 flow, removed 3 selfloop flow, removed 14 redundant places. [2021-03-25 03:09:28,442 INFO L241 Difference]: Finished difference. Result has 207 places, 268 transitions, 5348 flow [2021-03-25 03:09:28,443 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5296, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5348, PETRI_PLACES=207, PETRI_TRANSITIONS=268} [2021-03-25 03:09:28,443 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 143 predicate places. [2021-03-25 03:09:28,443 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:28,443 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 207 places, 268 transitions, 5348 flow [2021-03-25 03:09:28,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 268 transitions, 5348 flow [2021-03-25 03:09:28,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 207 places, 268 transitions, 5348 flow [2021-03-25 03:09:29,307 INFO L129 PetriNetUnfolder]: 4847/9065 cut-off events. [2021-03-25 03:09:29,307 INFO L130 PetriNetUnfolder]: For 67960/69311 co-relation queries the response was YES. [2021-03-25 03:09:29,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27771 conditions, 9065 events. 4847/9065 cut-off events. For 67960/69311 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 75844 event pairs, 8 based on Foata normal form. 221/6250 useless extension candidates. Maximal degree in co-relation 25855. Up to 2562 conditions per place. [2021-03-25 03:09:29,453 INFO L142 LiptonReduction]: Number of co-enabled transitions 3630 [2021-03-25 03:09:29,464 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:29,464 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:29,464 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1021 [2021-03-25 03:09:29,464 INFO L480 AbstractCegarLoop]: Abstraction has has 207 places, 268 transitions, 5348 flow [2021-03-25 03:09:29,465 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-25 03:09:29,465 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:29,465 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-25 03:09:29,465 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-03-25 03:09:29,465 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-25 03:09:29,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:29,465 INFO L82 PathProgramCache]: Analyzing trace with hash 95235625, now seen corresponding path program 1 times [2021-03-25 03:09:29,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:29,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458240142] [2021-03-25 03:09:29,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:29,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:09:29,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:09:29,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 03:09:29,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:09:29,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:09:29,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:09:29,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:29,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:09:29,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:09:29,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 03:09:29,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:09:29,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:29,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:29,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:29,676 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-25 03:09:29,676 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458240142] [2021-03-25 03:09:29,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:29,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:09:29,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087976287] [2021-03-25 03:09:29,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:09:29,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:09:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:09:29,679 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 03:09:29,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 268 transitions, 5348 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-25 03:09:29,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:29,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 03:09:29,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:32,811 INFO L129 PetriNetUnfolder]: 14969/22046 cut-off events. [2021-03-25 03:09:32,811 INFO L130 PetriNetUnfolder]: For 431564/431651 co-relation queries the response was YES. [2021-03-25 03:09:32,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124264 conditions, 22046 events. 14969/22046 cut-off events. For 431564/431651 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 143935 event pairs, 2451 based on Foata normal form. 96/16585 useless extension candidates. Maximal degree in co-relation 116131. Up to 15002 conditions per place. [2021-03-25 03:09:33,311 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 206 selfloop transitions, 62 changer transitions 25/328 dead transitions. [2021-03-25 03:09:33,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 328 transitions, 6807 flow [2021-03-25 03:09:33,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:09:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:09:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1737 transitions. [2021-03-25 03:09:33,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5545977011494253 [2021-03-25 03:09:33,315 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1737 transitions. [2021-03-25 03:09:33,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1737 transitions. [2021-03-25 03:09:33,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:33,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1737 transitions. [2021-03-25 03:09:33,317 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-25 03:09:33,318 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-25 03:09:33,319 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-25 03:09:33,319 INFO L185 Difference]: Start difference. First operand has 207 places, 268 transitions, 5348 flow. Second operand 9 states and 1737 transitions. [2021-03-25 03:09:33,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 328 transitions, 6807 flow [2021-03-25 03:09:34,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 328 transitions, 6534 flow, removed 22 selfloop flow, removed 11 redundant places. [2021-03-25 03:09:34,141 INFO L241 Difference]: Finished difference. Result has 205 places, 257 transitions, 4918 flow [2021-03-25 03:09:34,141 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=5021, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4918, PETRI_PLACES=205, PETRI_TRANSITIONS=257} [2021-03-25 03:09:34,141 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 141 predicate places. [2021-03-25 03:09:34,141 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:34,141 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions, 4918 flow [2021-03-25 03:09:34,141 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 257 transitions, 4918 flow [2021-03-25 03:09:34,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions, 4918 flow [2021-03-25 03:09:34,957 INFO L129 PetriNetUnfolder]: 4607/8624 cut-off events. [2021-03-25 03:09:34,957 INFO L130 PetriNetUnfolder]: For 56100/57325 co-relation queries the response was YES. [2021-03-25 03:09:35,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24583 conditions, 8624 events. 4607/8624 cut-off events. For 56100/57325 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 71628 event pairs, 10 based on Foata normal form. 168/5857 useless extension candidates. Maximal degree in co-relation 23471. Up to 2480 conditions per place. [2021-03-25 03:09:35,077 INFO L142 LiptonReduction]: Number of co-enabled transitions 3370 [2021-03-25 03:09:35,087 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:35,088 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:35,088 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 947 [2021-03-25 03:09:35,088 INFO L480 AbstractCegarLoop]: Abstraction has has 205 places, 257 transitions, 4918 flow [2021-03-25 03:09:35,088 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-25 03:09:35,088 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:35,089 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 03:09:35,089 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-03-25 03:09:35,089 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-25 03:09:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1291294908, now seen corresponding path program 1 times [2021-03-25 03:09:35,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:35,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659816599] [2021-03-25 03:09:35,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:35,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:35,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:09:35,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:35,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:09:35,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:35,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:09:35,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:35,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:35,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:35,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:35,129 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-25 03:09:35,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659816599] [2021-03-25 03:09:35,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:35,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 03:09:35,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138763229] [2021-03-25 03:09:35,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 03:09:35,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 03:09:35,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-03-25 03:09:35,131 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 348 [2021-03-25 03:09:35,132 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 257 transitions, 4918 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-25 03:09:35,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:35,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 348 [2021-03-25 03:09:35,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:37,791 INFO L129 PetriNetUnfolder]: 13576/20399 cut-off events. [2021-03-25 03:09:37,791 INFO L130 PetriNetUnfolder]: For 405895/406007 co-relation queries the response was YES. [2021-03-25 03:09:37,939 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113247 conditions, 20399 events. 13576/20399 cut-off events. For 405895/406007 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 135833 event pairs, 3132 based on Foata normal form. 213/15568 useless extension candidates. Maximal degree in co-relation 107668. Up to 13283 conditions per place. [2021-03-25 03:09:37,991 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 198 selfloop transitions, 4 changer transitions 83/317 dead transitions. [2021-03-25 03:09:37,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 317 transitions, 6693 flow [2021-03-25 03:09:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:09:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:09:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1597 transitions. [2021-03-25 03:09:37,993 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5736350574712644 [2021-03-25 03:09:37,993 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1597 transitions. [2021-03-25 03:09:37,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1597 transitions. [2021-03-25 03:09:37,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:37,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1597 transitions. [2021-03-25 03:09:37,994 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-25 03:09:37,995 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-25 03:09:37,995 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-25 03:09:37,995 INFO L185 Difference]: Start difference. First operand has 205 places, 257 transitions, 4918 flow. Second operand 8 states and 1597 transitions. [2021-03-25 03:09:37,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 317 transitions, 6693 flow [2021-03-25 03:09:38,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 317 transitions, 6224 flow, removed 126 selfloop flow, removed 13 redundant places. [2021-03-25 03:09:38,647 INFO L241 Difference]: Finished difference. Result has 201 places, 234 transitions, 4180 flow [2021-03-25 03:09:38,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=4421, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4180, PETRI_PLACES=201, PETRI_TRANSITIONS=234} [2021-03-25 03:09:38,647 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 137 predicate places. [2021-03-25 03:09:38,647 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:38,647 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 234 transitions, 4180 flow [2021-03-25 03:09:38,647 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 234 transitions, 4180 flow [2021-03-25 03:09:38,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 184 places, 234 transitions, 4180 flow [2021-03-25 03:09:39,293 INFO L129 PetriNetUnfolder]: 3686/6853 cut-off events. [2021-03-25 03:09:39,293 INFO L130 PetriNetUnfolder]: For 32314/32418 co-relation queries the response was YES. [2021-03-25 03:09:39,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18289 conditions, 6853 events. 3686/6853 cut-off events. For 32314/32418 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 54740 event pairs, 15 based on Foata normal form. 64/4571 useless extension candidates. Maximal degree in co-relation 18197. Up to 2004 conditions per place. [2021-03-25 03:09:39,382 INFO L142 LiptonReduction]: Number of co-enabled transitions 3086 [2021-03-25 03:09:39,393 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:39,393 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:39,394 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 747 [2021-03-25 03:09:39,394 INFO L480 AbstractCegarLoop]: Abstraction has has 184 places, 234 transitions, 4180 flow [2021-03-25 03:09:39,394 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-25 03:09:39,394 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:39,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, 1, 1] [2021-03-25 03:09:39,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-03-25 03:09:39,394 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-25 03:09:39,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1251056855, now seen corresponding path program 1 times [2021-03-25 03:09:39,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:39,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745687558] [2021-03-25 03:09:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:39,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:39,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:09:39,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:39,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:39,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:39,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:39,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:39,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:09:39,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:39,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:39,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:39,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:39,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:39,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:39,461 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-25 03:09:39,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745687558] [2021-03-25 03:09:39,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:39,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-03-25 03:09:39,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462290169] [2021-03-25 03:09:39,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 03:09:39,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:39,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 03:09:39,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 03:09:39,463 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 348 [2021-03-25 03:09:39,464 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 234 transitions, 4180 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-25 03:09:39,464 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:39,464 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 348 [2021-03-25 03:09:39,464 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:41,434 INFO L129 PetriNetUnfolder]: 11376/16985 cut-off events. [2021-03-25 03:09:41,434 INFO L130 PetriNetUnfolder]: For 286788/286837 co-relation queries the response was YES. [2021-03-25 03:09:41,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 91104 conditions, 16985 events. 11376/16985 cut-off events. For 286788/286837 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 109569 event pairs, 2756 based on Foata normal form. 133/12869 useless extension candidates. Maximal degree in co-relation 90992. Up to 11465 conditions per place. [2021-03-25 03:09:41,821 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 184 selfloop transitions, 6 changer transitions 71/292 dead transitions. [2021-03-25 03:09:41,821 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 292 transitions, 5803 flow [2021-03-25 03:09:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:09:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:09:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1781 transitions. [2021-03-25 03:09:41,823 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5686462324393359 [2021-03-25 03:09:41,823 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1781 transitions. [2021-03-25 03:09:41,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1781 transitions. [2021-03-25 03:09:41,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:41,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1781 transitions. [2021-03-25 03:09:41,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 197.88888888888889) internal successors, (1781), 9 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:41,826 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-25 03:09:41,826 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-25 03:09:41,826 INFO L185 Difference]: Start difference. First operand has 184 places, 234 transitions, 4180 flow. Second operand 9 states and 1781 transitions. [2021-03-25 03:09:41,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 292 transitions, 5803 flow [2021-03-25 03:09:42,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 292 transitions, 5580 flow, removed 29 selfloop flow, removed 18 redundant places. [2021-03-25 03:09:42,316 INFO L241 Difference]: Finished difference. Result has 176 places, 220 transitions, 3758 flow [2021-03-25 03:09:42,316 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3920, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3758, PETRI_PLACES=176, PETRI_TRANSITIONS=220} [2021-03-25 03:09:42,316 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 112 predicate places. [2021-03-25 03:09:42,316 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:42,316 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 220 transitions, 3758 flow [2021-03-25 03:09:42,317 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 220 transitions, 3758 flow [2021-03-25 03:09:42,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 220 transitions, 3758 flow [2021-03-25 03:09:42,657 INFO L129 PetriNetUnfolder]: 3092/5704 cut-off events. [2021-03-25 03:09:42,657 INFO L130 PetriNetUnfolder]: For 28183/28894 co-relation queries the response was YES. [2021-03-25 03:09:42,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14523 conditions, 5704 events. 3092/5704 cut-off events. For 28183/28894 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 43853 event pairs, 14 based on Foata normal form. 146/3840 useless extension candidates. Maximal degree in co-relation 14430. Up to 1676 conditions per place. [2021-03-25 03:09:42,744 INFO L142 LiptonReduction]: Number of co-enabled transitions 2902 [2021-03-25 03:09:42,752 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:42,752 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:42,752 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 436 [2021-03-25 03:09:42,753 INFO L480 AbstractCegarLoop]: Abstraction has has 169 places, 220 transitions, 3758 flow [2021-03-25 03:09:42,753 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-25 03:09:42,753 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:42,753 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-25 03:09:42,753 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-03-25 03:09:42,753 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-25 03:09:42,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:42,753 INFO L82 PathProgramCache]: Analyzing trace with hash -395556709, now seen corresponding path program 2 times [2021-03-25 03:09:42,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:42,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864878798] [2021-03-25 03:09:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:42,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:09:42,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:09:42,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:42,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:42,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:09:42,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:42,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:42,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:42,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:42,841 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-25 03:09:42,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864878798] [2021-03-25 03:09:42,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:42,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-03-25 03:09:42,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721258589] [2021-03-25 03:09:42,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 03:09:42,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 03:09:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 03:09:42,843 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 348 [2021-03-25 03:09:42,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 220 transitions, 3758 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-25 03:09:42,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:42,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 348 [2021-03-25 03:09:42,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:44,694 INFO L129 PetriNetUnfolder]: 9734/14499 cut-off events. [2021-03-25 03:09:44,694 INFO L130 PetriNetUnfolder]: For 221271/221272 co-relation queries the response was YES. [2021-03-25 03:09:44,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75334 conditions, 14499 events. 9734/14499 cut-off events. For 221271/221272 co-relation queries the response was YES. Maximal size of possible extension queue 832. Compared 91530 event pairs, 2313 based on Foata normal form. 115/10961 useless extension candidates. Maximal degree in co-relation 75208. Up to 9708 conditions per place. [2021-03-25 03:09:44,792 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 160 selfloop transitions, 9 changer transitions 71/269 dead transitions. [2021-03-25 03:09:44,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 269 transitions, 5048 flow [2021-03-25 03:09:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:09:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:09:44,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1963 transitions. [2021-03-25 03:09:44,794 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5640804597701149 [2021-03-25 03:09:44,794 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1963 transitions. [2021-03-25 03:09:44,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1963 transitions. [2021-03-25 03:09:44,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:44,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1963 transitions. [2021-03-25 03:09:44,796 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-25 03:09:44,798 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-25 03:09:44,798 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-25 03:09:44,798 INFO L185 Difference]: Start difference. First operand has 169 places, 220 transitions, 3758 flow. Second operand 10 states and 1963 transitions. [2021-03-25 03:09:44,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 269 transitions, 5048 flow [2021-03-25 03:09:45,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 269 transitions, 4983 flow, removed 20 selfloop flow, removed 12 redundant places. [2021-03-25 03:09:45,135 INFO L241 Difference]: Finished difference. Result has 168 places, 197 transitions, 3180 flow [2021-03-25 03:09:45,135 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3605, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3180, PETRI_PLACES=168, PETRI_TRANSITIONS=197} [2021-03-25 03:09:45,135 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 104 predicate places. [2021-03-25 03:09:45,136 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:45,136 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 168 places, 197 transitions, 3180 flow [2021-03-25 03:09:45,136 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 168 places, 197 transitions, 3180 flow [2021-03-25 03:09:45,137 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 161 places, 197 transitions, 3180 flow [2021-03-25 03:09:45,397 INFO L129 PetriNetUnfolder]: 2490/4569 cut-off events. [2021-03-25 03:09:45,397 INFO L130 PetriNetUnfolder]: For 21306/21801 co-relation queries the response was YES. [2021-03-25 03:09:45,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11540 conditions, 4569 events. 2490/4569 cut-off events. For 21306/21801 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 33678 event pairs, 10 based on Foata normal form. 124/3071 useless extension candidates. Maximal degree in co-relation 11005. Up to 1344 conditions per place. [2021-03-25 03:09:45,460 INFO L142 LiptonReduction]: Number of co-enabled transitions 2704 [2021-03-25 03:09:45,466 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:45,466 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:45,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 331 [2021-03-25 03:09:45,467 INFO L480 AbstractCegarLoop]: Abstraction has has 161 places, 197 transitions, 3180 flow [2021-03-25 03:09:45,467 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-25 03:09:45,467 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:45,467 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-25 03:09:45,467 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-03-25 03:09:45,467 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-25 03:09:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 737682664, now seen corresponding path program 1 times [2021-03-25 03:09:45,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:45,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468147104] [2021-03-25 03:09:45,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:45,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:09:45,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:09:45,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:09:45,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:45,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:45,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:09:45,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:45,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:45,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:45,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:45,581 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-25 03:09:45,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468147104] [2021-03-25 03:09:45,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:45,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:09:45,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893124955] [2021-03-25 03:09:45,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:09:45,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:45,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:09:45,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:09:45,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 348 [2021-03-25 03:09:45,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 197 transitions, 3180 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-25 03:09:45,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:45,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 348 [2021-03-25 03:09:45,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:47,088 INFO L129 PetriNetUnfolder]: 8165/12120 cut-off events. [2021-03-25 03:09:47,088 INFO L130 PetriNetUnfolder]: For 178426/178443 co-relation queries the response was YES. [2021-03-25 03:09:47,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62534 conditions, 12120 events. 8165/12120 cut-off events. For 178426/178443 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 73919 event pairs, 2015 based on Foata normal form. 121/9163 useless extension candidates. Maximal degree in co-relation 60488. Up to 8012 conditions per place. [2021-03-25 03:09:47,202 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 144 selfloop transitions, 12 changer transitions 52/235 dead transitions. [2021-03-25 03:09:47,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 235 transitions, 4180 flow [2021-03-25 03:09:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 03:09:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 03:09:47,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1955 transitions. [2021-03-25 03:09:47,204 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5617816091954023 [2021-03-25 03:09:47,204 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1955 transitions. [2021-03-25 03:09:47,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1955 transitions. [2021-03-25 03:09:47,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:47,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1955 transitions. [2021-03-25 03:09:47,206 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-25 03:09:47,208 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-25 03:09:47,208 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-25 03:09:47,209 INFO L185 Difference]: Start difference. First operand has 161 places, 197 transitions, 3180 flow. Second operand 10 states and 1955 transitions. [2021-03-25 03:09:47,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 235 transitions, 4180 flow [2021-03-25 03:09:47,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 235 transitions, 4098 flow, removed 20 selfloop flow, removed 13 redundant places. [2021-03-25 03:09:47,504 INFO L241 Difference]: Finished difference. Result has 159 places, 182 transitions, 2782 flow [2021-03-25 03:09:47,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2782, PETRI_PLACES=159, PETRI_TRANSITIONS=182} [2021-03-25 03:09:47,505 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 95 predicate places. [2021-03-25 03:09:47,505 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:47,505 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 182 transitions, 2782 flow [2021-03-25 03:09:47,505 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 182 transitions, 2782 flow [2021-03-25 03:09:47,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 182 transitions, 2782 flow [2021-03-25 03:09:47,752 INFO L129 PetriNetUnfolder]: 1888/3470 cut-off events. [2021-03-25 03:09:47,752 INFO L130 PetriNetUnfolder]: For 14952/15174 co-relation queries the response was YES. [2021-03-25 03:09:47,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8811 conditions, 3470 events. 1888/3470 cut-off events. For 14952/15174 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 24165 event pairs, 7 based on Foata normal form. 69/2306 useless extension candidates. Maximal degree in co-relation 8250. Up to 1004 conditions per place. [2021-03-25 03:09:47,796 INFO L142 LiptonReduction]: Number of co-enabled transitions 2518 [2021-03-25 03:09:47,804 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:47,804 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:47,804 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 299 [2021-03-25 03:09:47,804 INFO L480 AbstractCegarLoop]: Abstraction has has 149 places, 182 transitions, 2782 flow [2021-03-25 03:09:47,804 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-25 03:09:47,804 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:47,805 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-25 03:09:47,805 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-03-25 03:09:47,805 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-25 03:09:47,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:47,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1382951140, now seen corresponding path program 2 times [2021-03-25 03:09:47,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:47,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471416615] [2021-03-25 03:09:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:47,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:09:47,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 03:09:47,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:09:47,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:47,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:09:47,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:09:47,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:47,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:09:47,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:47,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:47,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:47,900 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-25 03:09:47,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471416615] [2021-03-25 03:09:47,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:47,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:09:47,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214036650] [2021-03-25 03:09:47,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:09:47,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:09:47,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:09:47,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 03:09:47,910 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 182 transitions, 2782 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-25 03:09:47,910 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:47,910 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 03:09:47,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:49,152 INFO L129 PetriNetUnfolder]: 7519/11152 cut-off events. [2021-03-25 03:09:49,152 INFO L130 PetriNetUnfolder]: For 155588/155589 co-relation queries the response was YES. [2021-03-25 03:09:49,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56132 conditions, 11152 events. 7519/11152 cut-off events. For 155588/155589 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 67032 event pairs, 1768 based on Foata normal form. 57/8316 useless extension candidates. Maximal degree in co-relation 52698. Up to 7901 conditions per place. [2021-03-25 03:09:49,223 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 145 selfloop transitions, 16 changer transitions 23/211 dead transitions. [2021-03-25 03:09:49,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 211 transitions, 3526 flow [2021-03-25 03:09:49,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:09:49,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:09:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1376 transitions. [2021-03-25 03:09:49,225 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5648604269293924 [2021-03-25 03:09:49,225 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1376 transitions. [2021-03-25 03:09:49,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1376 transitions. [2021-03-25 03:09:49,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:49,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1376 transitions. [2021-03-25 03:09:49,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.57142857142858) internal successors, (1376), 7 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:49,227 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-25 03:09:49,227 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-25 03:09:49,228 INFO L185 Difference]: Start difference. First operand has 149 places, 182 transitions, 2782 flow. Second operand 7 states and 1376 transitions. [2021-03-25 03:09:49,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 211 transitions, 3526 flow [2021-03-25 03:09:49,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 211 transitions, 3458 flow, removed 20 selfloop flow, removed 13 redundant places. [2021-03-25 03:09:49,459 INFO L241 Difference]: Finished difference. Result has 145 places, 186 transitions, 2864 flow [2021-03-25 03:09:49,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2728, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2864, PETRI_PLACES=145, PETRI_TRANSITIONS=186} [2021-03-25 03:09:49,459 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 81 predicate places. [2021-03-25 03:09:49,459 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:49,459 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 186 transitions, 2864 flow [2021-03-25 03:09:49,460 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 186 transitions, 2864 flow [2021-03-25 03:09:49,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 186 transitions, 2864 flow [2021-03-25 03:09:49,648 INFO L129 PetriNetUnfolder]: 2049/3737 cut-off events. [2021-03-25 03:09:49,648 INFO L130 PetriNetUnfolder]: For 16602/16901 co-relation queries the response was YES. [2021-03-25 03:09:49,664 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9353 conditions, 3737 events. 2049/3737 cut-off events. For 16602/16901 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 26291 event pairs, 8 based on Foata normal form. 97/2507 useless extension candidates. Maximal degree in co-relation 8681. Up to 1092 conditions per place. [2021-03-25 03:09:49,691 INFO L142 LiptonReduction]: Number of co-enabled transitions 2510 [2021-03-25 03:09:49,697 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:49,697 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:49,698 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 239 [2021-03-25 03:09:49,698 INFO L480 AbstractCegarLoop]: Abstraction has has 143 places, 186 transitions, 2864 flow [2021-03-25 03:09:49,698 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-25 03:09:49,698 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:49,698 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-25 03:09:49,698 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-03-25 03:09:49,698 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-25 03:09:49,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:49,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1777169343, now seen corresponding path program 1 times [2021-03-25 03:09:49,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:49,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447182810] [2021-03-25 03:09:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:49,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:09:49,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 03:09:49,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:09:49,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:49,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:09:49,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:09:49,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:49,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:09:49,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:49,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:49,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:49,797 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-25 03:09:49,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447182810] [2021-03-25 03:09:49,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:49,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:09:49,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115519667] [2021-03-25 03:09:49,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:09:49,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:49,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:09:49,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:09:49,800 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 03:09:49,800 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 186 transitions, 2864 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-25 03:09:49,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:49,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 03:09:49,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:50,986 INFO L129 PetriNetUnfolder]: 7555/11201 cut-off events. [2021-03-25 03:09:50,987 INFO L130 PetriNetUnfolder]: For 157798/157813 co-relation queries the response was YES. [2021-03-25 03:09:51,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55302 conditions, 11201 events. 7555/11201 cut-off events. For 157798/157813 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 67260 event pairs, 1841 based on Foata normal form. 63/8371 useless extension candidates. Maximal degree in co-relation 49717. Up to 7911 conditions per place. [2021-03-25 03:09:51,065 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 145 selfloop transitions, 16 changer transitions 33/221 dead transitions. [2021-03-25 03:09:51,065 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 221 transitions, 3727 flow [2021-03-25 03:09:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 03:09:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 03:09:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1568 transitions. [2021-03-25 03:09:51,067 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2021-03-25 03:09:51,067 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1568 transitions. [2021-03-25 03:09:51,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1568 transitions. [2021-03-25 03:09:51,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:51,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1568 transitions. [2021-03-25 03:09:51,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 196.0) internal successors, (1568), 8 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:51,070 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-25 03:09:51,070 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-25 03:09:51,070 INFO L185 Difference]: Start difference. First operand has 143 places, 186 transitions, 2864 flow. Second operand 8 states and 1568 transitions. [2021-03-25 03:09:51,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 221 transitions, 3727 flow [2021-03-25 03:09:51,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 221 transitions, 3608 flow, removed 48 selfloop flow, removed 3 redundant places. [2021-03-25 03:09:51,282 INFO L241 Difference]: Finished difference. Result has 151 places, 186 transitions, 2856 flow [2021-03-25 03:09:51,282 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2798, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2856, PETRI_PLACES=151, PETRI_TRANSITIONS=186} [2021-03-25 03:09:51,282 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 87 predicate places. [2021-03-25 03:09:51,282 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:51,282 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 186 transitions, 2856 flow [2021-03-25 03:09:51,283 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 186 transitions, 2856 flow [2021-03-25 03:09:51,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 186 transitions, 2856 flow [2021-03-25 03:09:51,471 INFO L129 PetriNetUnfolder]: 1971/3610 cut-off events. [2021-03-25 03:09:51,471 INFO L130 PetriNetUnfolder]: For 15633/15919 co-relation queries the response was YES. [2021-03-25 03:09:51,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9083 conditions, 3610 events. 1971/3610 cut-off events. For 15633/15919 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 25175 event pairs, 3 based on Foata normal form. 94/2421 useless extension candidates. Maximal degree in co-relation 8574. Up to 1050 conditions per place. [2021-03-25 03:09:51,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 2510 [2021-03-25 03:09:51,520 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:51,520 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:51,520 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 238 [2021-03-25 03:09:51,520 INFO L480 AbstractCegarLoop]: Abstraction has has 148 places, 186 transitions, 2856 flow [2021-03-25 03:09:51,520 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-25 03:09:51,521 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:51,521 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-25 03:09:51,521 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-03-25 03:09:51,521 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-25 03:09:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1265349713, now seen corresponding path program 2 times [2021-03-25 03:09:51,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:51,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680699218] [2021-03-25 03:09:51,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:51,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:09:51,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 03:09:51,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 03:09:51,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:09:51,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:09:51,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:09:51,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:51,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:51,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:51,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:51,769 INFO L142 QuantifierPusher]: treesize reduction 16, result has 33.3 percent of original size [2021-03-25 03:09:51,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 03:09:51,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:51,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:51,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:51,789 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-25 03:09:51,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680699218] [2021-03-25 03:09:51,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:51,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-03-25 03:09:51,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123624104] [2021-03-25 03:09:51,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 03:09:51,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 03:09:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-03-25 03:09:51,792 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 348 [2021-03-25 03:09:51,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 186 transitions, 2856 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-25 03:09:51,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:51,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 348 [2021-03-25 03:09:51,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:53,293 INFO L129 PetriNetUnfolder]: 8439/12547 cut-off events. [2021-03-25 03:09:53,294 INFO L130 PetriNetUnfolder]: For 179866/179881 co-relation queries the response was YES. [2021-03-25 03:09:53,343 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63574 conditions, 12547 events. 8439/12547 cut-off events. For 179866/179881 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 78088 event pairs, 359 based on Foata normal form. 62/9590 useless extension candidates. Maximal degree in co-relation 61544. Up to 6808 conditions per place. [2021-03-25 03:09:53,365 INFO L132 encePairwiseOnDemand]: 337/348 looper letters, 185 selfloop transitions, 55 changer transitions 22/289 dead transitions. [2021-03-25 03:09:53,365 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 289 transitions, 4798 flow [2021-03-25 03:09:53,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:09:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:09:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1763 transitions. [2021-03-25 03:09:53,367 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5628991060025543 [2021-03-25 03:09:53,367 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1763 transitions. [2021-03-25 03:09:53,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1763 transitions. [2021-03-25 03:09:53,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:53,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1763 transitions. [2021-03-25 03:09:53,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 195.88888888888889) internal successors, (1763), 9 states have internal predecessors, (1763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:53,369 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-25 03:09:53,369 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-25 03:09:53,369 INFO L185 Difference]: Start difference. First operand has 148 places, 186 transitions, 2856 flow. Second operand 9 states and 1763 transitions. [2021-03-25 03:09:53,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 289 transitions, 4798 flow [2021-03-25 03:09:53,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 289 transitions, 4758 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-03-25 03:09:53,650 INFO L241 Difference]: Finished difference. Result has 154 places, 211 transitions, 3494 flow [2021-03-25 03:09:53,651 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2822, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3494, PETRI_PLACES=154, PETRI_TRANSITIONS=211} [2021-03-25 03:09:53,651 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 90 predicate places. [2021-03-25 03:09:53,651 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:53,651 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 211 transitions, 3494 flow [2021-03-25 03:09:53,651 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 211 transitions, 3494 flow [2021-03-25 03:09:53,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 154 places, 211 transitions, 3494 flow [2021-03-25 03:09:53,964 INFO L129 PetriNetUnfolder]: 2637/4901 cut-off events. [2021-03-25 03:09:53,964 INFO L130 PetriNetUnfolder]: For 25166/25291 co-relation queries the response was YES. [2021-03-25 03:09:53,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13041 conditions, 4901 events. 2637/4901 cut-off events. For 25166/25291 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 36805 event pairs, 4 based on Foata normal form. 53/3269 useless extension candidates. Maximal degree in co-relation 12554. Up to 1432 conditions per place. [2021-03-25 03:09:54,027 INFO L142 LiptonReduction]: Number of co-enabled transitions 2850 [2021-03-25 03:09:54,034 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:54,034 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:54,034 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 383 [2021-03-25 03:09:54,035 INFO L480 AbstractCegarLoop]: Abstraction has has 154 places, 211 transitions, 3494 flow [2021-03-25 03:09:54,035 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-25 03:09:54,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:54,035 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-25 03:09:54,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-03-25 03:09:54,035 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-25 03:09:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1555087405, now seen corresponding path program 1 times [2021-03-25 03:09:54,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:54,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710886950] [2021-03-25 03:09:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:54,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 03:09:54,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 03:09:54,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 03:09:54,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:09:54,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:09:54,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:54,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:54,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 03:09:54,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:54,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:54,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:54,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 03:09:54,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710886950] [2021-03-25 03:09:54,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:54,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:09:54,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747182703] [2021-03-25 03:09:54,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:09:54,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:54,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:09:54,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:09:54,201 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 03:09:54,202 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 211 transitions, 3494 flow. Second operand has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:54,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:54,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 03:09:54,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:55,872 INFO L129 PetriNetUnfolder]: 8880/13264 cut-off events. [2021-03-25 03:09:55,872 INFO L130 PetriNetUnfolder]: For 234915/234932 co-relation queries the response was YES. [2021-03-25 03:09:55,943 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69790 conditions, 13264 events. 8880/13264 cut-off events. For 234915/234932 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 83057 event pairs, 1670 based on Foata normal form. 318/10116 useless extension candidates. Maximal degree in co-relation 68284. Up to 6025 conditions per place. [2021-03-25 03:09:55,965 INFO L132 encePairwiseOnDemand]: 335/348 looper letters, 149 selfloop transitions, 72 changer transitions 54/303 dead transitions. [2021-03-25 03:09:55,965 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 303 transitions, 5537 flow [2021-03-25 03:09:55,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-03-25 03:09:55,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-03-25 03:09:55,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2543 transitions. [2021-03-25 03:09:55,967 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5621131741821397 [2021-03-25 03:09:55,967 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2543 transitions. [2021-03-25 03:09:55,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2543 transitions. [2021-03-25 03:09:55,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:55,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2543 transitions. [2021-03-25 03:09:55,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 195.6153846153846) internal successors, (2543), 13 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:55,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 348.0) internal successors, (4872), 14 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:55,972 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 348.0) internal successors, (4872), 14 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:55,972 INFO L185 Difference]: Start difference. First operand has 154 places, 211 transitions, 3494 flow. Second operand 13 states and 2543 transitions. [2021-03-25 03:09:55,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 303 transitions, 5537 flow [2021-03-25 03:09:56,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 303 transitions, 5444 flow, removed 23 selfloop flow, removed 5 redundant places. [2021-03-25 03:09:56,283 INFO L241 Difference]: Finished difference. Result has 169 places, 210 transitions, 3692 flow [2021-03-25 03:09:56,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3264, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3692, PETRI_PLACES=169, PETRI_TRANSITIONS=210} [2021-03-25 03:09:56,283 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 105 predicate places. [2021-03-25 03:09:56,283 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:56,283 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 210 transitions, 3692 flow [2021-03-25 03:09:56,284 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 210 transitions, 3692 flow [2021-03-25 03:09:56,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 169 places, 210 transitions, 3692 flow [2021-03-25 03:09:56,760 INFO L129 PetriNetUnfolder]: 2840/5295 cut-off events. [2021-03-25 03:09:56,760 INFO L130 PetriNetUnfolder]: For 28122/28184 co-relation queries the response was YES. [2021-03-25 03:09:56,788 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13947 conditions, 5295 events. 2840/5295 cut-off events. For 28122/28184 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 40608 event pairs, 10 based on Foata normal form. 17/3482 useless extension candidates. Maximal degree in co-relation 13090. Up to 1580 conditions per place. [2021-03-25 03:09:56,831 INFO L142 LiptonReduction]: Number of co-enabled transitions 2820 [2021-03-25 03:09:56,839 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:56,839 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:56,839 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 556 [2021-03-25 03:09:56,839 INFO L480 AbstractCegarLoop]: Abstraction has has 169 places, 210 transitions, 3692 flow [2021-03-25 03:09:56,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 188.5) internal successors, (2262), 12 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:09:56,840 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:56,840 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-25 03:09:56,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-03-25 03:09:56,840 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-25 03:09:56,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash 416897403, now seen corresponding path program 1 times [2021-03-25 03:09:56,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:56,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040422651] [2021-03-25 03:09:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:56,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:09:56,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 03:09:56,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:09:56,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:09:56,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:09:56,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:56,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:09:56,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:56,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:56,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:56,922 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-25 03:09:56,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040422651] [2021-03-25 03:09:56,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:56,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:09:56,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558230131] [2021-03-25 03:09:56,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:09:56,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:56,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:09:56,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:09:56,925 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 348 [2021-03-25 03:09:56,926 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 210 transitions, 3692 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-25 03:09:56,926 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:56,926 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 348 [2021-03-25 03:09:56,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:09:58,366 INFO L129 PetriNetUnfolder]: 7608/11622 cut-off events. [2021-03-25 03:09:58,367 INFO L130 PetriNetUnfolder]: For 227186/227187 co-relation queries the response was YES. [2021-03-25 03:09:58,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64421 conditions, 11622 events. 7608/11622 cut-off events. For 227186/227187 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 75259 event pairs, 1767 based on Foata normal form. 37/8603 useless extension candidates. Maximal degree in co-relation 61110. Up to 8118 conditions per place. [2021-03-25 03:09:58,438 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 172 selfloop transitions, 5 changer transitions 31/237 dead transitions. [2021-03-25 03:09:58,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 237 transitions, 4551 flow [2021-03-25 03:09:58,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:09:58,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:09:58,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1372 transitions. [2021-03-25 03:09:58,439 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2021-03-25 03:09:58,440 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1372 transitions. [2021-03-25 03:09:58,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1372 transitions. [2021-03-25 03:09:58,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:09:58,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1372 transitions. [2021-03-25 03:09:58,441 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-25 03:09:58,442 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-25 03:09:58,442 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-25 03:09:58,442 INFO L185 Difference]: Start difference. First operand has 169 places, 210 transitions, 3692 flow. Second operand 7 states and 1372 transitions. [2021-03-25 03:09:58,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 237 transitions, 4551 flow [2021-03-25 03:09:58,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 237 transitions, 4355 flow, removed 37 selfloop flow, removed 5 redundant places. [2021-03-25 03:09:58,717 INFO L241 Difference]: Finished difference. Result has 172 places, 205 transitions, 3456 flow [2021-03-25 03:09:58,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3479, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3456, PETRI_PLACES=172, PETRI_TRANSITIONS=205} [2021-03-25 03:09:58,717 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 108 predicate places. [2021-03-25 03:09:58,717 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:09:58,717 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 205 transitions, 3456 flow [2021-03-25 03:09:58,717 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 205 transitions, 3456 flow [2021-03-25 03:09:58,718 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 168 places, 205 transitions, 3456 flow [2021-03-25 03:09:59,007 INFO L129 PetriNetUnfolder]: 2703/5046 cut-off events. [2021-03-25 03:09:59,007 INFO L130 PetriNetUnfolder]: For 25367/25392 co-relation queries the response was YES. [2021-03-25 03:09:59,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13259 conditions, 5046 events. 2703/5046 cut-off events. For 25367/25392 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 38392 event pairs, 10 based on Foata normal form. 14/3331 useless extension candidates. Maximal degree in co-relation 12409. Up to 1512 conditions per place. [2021-03-25 03:09:59,075 INFO L142 LiptonReduction]: Number of co-enabled transitions 2730 [2021-03-25 03:09:59,082 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:09:59,082 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:09:59,082 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 365 [2021-03-25 03:09:59,083 INFO L480 AbstractCegarLoop]: Abstraction has has 168 places, 205 transitions, 3456 flow [2021-03-25 03:09:59,083 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-25 03:09:59,083 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:09:59,083 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-25 03:09:59,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-03-25 03:09:59,083 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-25 03:09:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:09:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash 830513335, now seen corresponding path program 2 times [2021-03-25 03:09:59,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:09:59,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386017211] [2021-03-25 03:09:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:09:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:09:59,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 03:09:59,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 03:09:59,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:09:59,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:09:59,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:59,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:09:59,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 03:09:59,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:09:59,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:09:59,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:09:59,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:09:59,222 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-25 03:09:59,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386017211] [2021-03-25 03:09:59,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:09:59,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-03-25 03:09:59,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125797856] [2021-03-25 03:09:59,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 03:09:59,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:09:59,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 03:09:59,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-25 03:09:59,224 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 03:09:59,225 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 205 transitions, 3456 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-25 03:09:59,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:09:59,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 03:09:59,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:10:00,751 INFO L129 PetriNetUnfolder]: 7861/12055 cut-off events. [2021-03-25 03:10:00,751 INFO L130 PetriNetUnfolder]: For 218094/218095 co-relation queries the response was YES. [2021-03-25 03:10:00,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65499 conditions, 12055 events. 7861/12055 cut-off events. For 218094/218095 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 78979 event pairs, 1786 based on Foata normal form. 73/8927 useless extension candidates. Maximal degree in co-relation 61575. Up to 8026 conditions per place. [2021-03-25 03:10:00,855 INFO L132 encePairwiseOnDemand]: 338/348 looper letters, 158 selfloop transitions, 16 changer transitions 34/237 dead transitions. [2021-03-25 03:10:00,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 237 transitions, 4375 flow [2021-03-25 03:10:00,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 03:10:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 03:10:00,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2119 transitions. [2021-03-25 03:10:00,866 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5535527690700105 [2021-03-25 03:10:00,866 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2119 transitions. [2021-03-25 03:10:00,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2119 transitions. [2021-03-25 03:10:00,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:10:00,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2119 transitions. [2021-03-25 03:10:00,868 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-25 03:10:00,870 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-25 03:10:00,870 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-25 03:10:00,870 INFO L185 Difference]: Start difference. First operand has 168 places, 205 transitions, 3456 flow. Second operand 11 states and 2119 transitions. [2021-03-25 03:10:00,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 237 transitions, 4375 flow [2021-03-25 03:10:01,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 237 transitions, 4321 flow, removed 14 selfloop flow, removed 7 redundant places. [2021-03-25 03:10:01,224 INFO L241 Difference]: Finished difference. Result has 174 places, 201 transitions, 3388 flow [2021-03-25 03:10:01,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=3412, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3388, PETRI_PLACES=174, PETRI_TRANSITIONS=201} [2021-03-25 03:10:01,225 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 110 predicate places. [2021-03-25 03:10:01,225 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:10:01,225 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 201 transitions, 3388 flow [2021-03-25 03:10:01,225 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 174 places, 201 transitions, 3388 flow [2021-03-25 03:10:01,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 201 transitions, 3388 flow [2021-03-25 03:10:01,575 INFO L129 PetriNetUnfolder]: 2672/4989 cut-off events. [2021-03-25 03:10:01,575 INFO L130 PetriNetUnfolder]: For 24526/24549 co-relation queries the response was YES. [2021-03-25 03:10:01,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12923 conditions, 4989 events. 2672/4989 cut-off events. For 24526/24549 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 38055 event pairs, 8 based on Foata normal form. 14/3294 useless extension candidates. Maximal degree in co-relation 11925. Up to 1504 conditions per place. [2021-03-25 03:10:01,627 INFO L142 LiptonReduction]: Number of co-enabled transitions 2730 [2021-03-25 03:10:01,634 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:10:01,634 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:10:01,634 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 409 [2021-03-25 03:10:01,635 INFO L480 AbstractCegarLoop]: Abstraction has has 171 places, 201 transitions, 3388 flow [2021-03-25 03:10:01,635 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-25 03:10:01,635 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:10:01,635 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-25 03:10:01,635 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-03-25 03:10:01,635 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-25 03:10:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:10:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1857185558, now seen corresponding path program 1 times [2021-03-25 03:10:01,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:10:01,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724663692] [2021-03-25 03:10:01,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:10:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:10:01,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:10:01,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:10:01,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:10:01,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:10:01,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:10:01,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:10:01,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:10:01,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:10:01,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:10:01,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:10:01,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:01,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:10:01,791 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-25 03:10:01,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724663692] [2021-03-25 03:10:01,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:10:01,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:10:01,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586807912] [2021-03-25 03:10:01,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:10:01,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:10:01,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:10:01,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:10:01,794 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 348 [2021-03-25 03:10:01,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 201 transitions, 3388 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-25 03:10:01,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:10:01,795 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 348 [2021-03-25 03:10:01,795 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:10:03,075 INFO L129 PetriNetUnfolder]: 7344/10931 cut-off events. [2021-03-25 03:10:03,076 INFO L130 PetriNetUnfolder]: For 209022/209030 co-relation queries the response was YES. [2021-03-25 03:10:03,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58476 conditions, 10931 events. 7344/10931 cut-off events. For 209022/209030 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 65517 event pairs, 1525 based on Foata normal form. 132/8201 useless extension candidates. Maximal degree in co-relation 53366. Up to 3210 conditions per place. [2021-03-25 03:10:03,163 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 125 selfloop transitions, 52 changer transitions 39/241 dead transitions. [2021-03-25 03:10:03,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 241 transitions, 4366 flow [2021-03-25 03:10:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 03:10:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 03:10:03,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1756 transitions. [2021-03-25 03:10:03,165 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5606641123882503 [2021-03-25 03:10:03,165 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1756 transitions. [2021-03-25 03:10:03,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1756 transitions. [2021-03-25 03:10:03,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:10:03,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1756 transitions. [2021-03-25 03:10:03,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 195.11111111111111) internal successors, (1756), 9 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:10:03,167 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-25 03:10:03,167 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-25 03:10:03,167 INFO L185 Difference]: Start difference. First operand has 171 places, 201 transitions, 3388 flow. Second operand 9 states and 1756 transitions. [2021-03-25 03:10:03,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 241 transitions, 4366 flow [2021-03-25 03:10:03,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 241 transitions, 4167 flow, removed 35 selfloop flow, removed 15 redundant places. [2021-03-25 03:10:03,426 INFO L241 Difference]: Finished difference. Result has 163 places, 147 transitions, 2317 flow [2021-03-25 03:10:03,427 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2317, PETRI_PLACES=163, PETRI_TRANSITIONS=147} [2021-03-25 03:10:03,427 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 99 predicate places. [2021-03-25 03:10:03,427 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:10:03,427 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 147 transitions, 2317 flow [2021-03-25 03:10:03,427 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 163 places, 147 transitions, 2317 flow [2021-03-25 03:10:03,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 163 places, 147 transitions, 2317 flow [2021-03-25 03:10:03,653 INFO L129 PetriNetUnfolder]: 1814/3473 cut-off events. [2021-03-25 03:10:03,653 INFO L130 PetriNetUnfolder]: For 14439/14440 co-relation queries the response was YES. [2021-03-25 03:10:03,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8226 conditions, 3473 events. 1814/3473 cut-off events. For 14439/14440 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 25532 event pairs, 4 based on Foata normal form. 1/2248 useless extension candidates. Maximal degree in co-relation 7611. Up to 1120 conditions per place. [2021-03-25 03:10:03,692 INFO L142 LiptonReduction]: Number of co-enabled transitions 1852 [2021-03-25 03:10:03,708 INFO L154 LiptonReduction]: Checked pairs total: 288 [2021-03-25 03:10:03,708 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:10:03,708 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 281 [2021-03-25 03:10:03,708 INFO L480 AbstractCegarLoop]: Abstraction has has 163 places, 147 transitions, 2317 flow [2021-03-25 03:10:03,709 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-25 03:10:03,709 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:10:03,709 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-25 03:10:03,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-03-25 03:10:03,709 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-25 03:10:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:10:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 160984051, now seen corresponding path program 3 times [2021-03-25 03:10:03,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:10:03,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690037244] [2021-03-25 03:10:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:10:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:10:03,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:10:03,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 03:10:03,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 03:10:03,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:10:03,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:10:03,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 03:10:03,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:10:03,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:10:03,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:10:03,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:03,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:10:03,803 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-25 03:10:03,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690037244] [2021-03-25 03:10:03,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:10:03,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-03-25 03:10:03,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786388766] [2021-03-25 03:10:03,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 03:10:03,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:10:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 03:10:03,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-03-25 03:10:03,806 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 348 [2021-03-25 03:10:03,806 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 147 transitions, 2317 flow. Second operand has 11 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:10:03,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:10:03,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 348 [2021-03-25 03:10:03,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:10:04,626 INFO L129 PetriNetUnfolder]: 4862/7728 cut-off events. [2021-03-25 03:10:04,626 INFO L130 PetriNetUnfolder]: For 134029/134030 co-relation queries the response was YES. [2021-03-25 03:10:04,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38968 conditions, 7728 events. 4862/7728 cut-off events. For 134029/134030 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 50239 event pairs, 1331 based on Foata normal form. 109/5817 useless extension candidates. Maximal degree in co-relation 37109. Up to 4664 conditions per place. [2021-03-25 03:10:04,679 INFO L132 encePairwiseOnDemand]: 341/348 looper letters, 92 selfloop transitions, 7 changer transitions 36/163 dead transitions. [2021-03-25 03:10:04,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 163 transitions, 2759 flow [2021-03-25 03:10:04,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:10:04,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:10:04,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1358 transitions. [2021-03-25 03:10:04,680 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5574712643678161 [2021-03-25 03:10:04,680 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1358 transitions. [2021-03-25 03:10:04,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1358 transitions. [2021-03-25 03:10:04,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:10:04,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1358 transitions. [2021-03-25 03:10:04,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:10:04,682 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-25 03:10:04,682 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-25 03:10:04,682 INFO L185 Difference]: Start difference. First operand has 163 places, 147 transitions, 2317 flow. Second operand 7 states and 1358 transitions. [2021-03-25 03:10:04,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 163 transitions, 2759 flow [2021-03-25 03:10:04,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 163 transitions, 2388 flow, removed 47 selfloop flow, removed 13 redundant places. [2021-03-25 03:10:04,879 INFO L241 Difference]: Finished difference. Result has 158 places, 126 transitions, 1687 flow [2021-03-25 03:10:04,880 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1687, PETRI_PLACES=158, PETRI_TRANSITIONS=126} [2021-03-25 03:10:04,880 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 94 predicate places. [2021-03-25 03:10:04,880 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:10:04,880 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 126 transitions, 1687 flow [2021-03-25 03:10:04,880 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 126 transitions, 1687 flow [2021-03-25 03:10:04,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 148 places, 126 transitions, 1687 flow [2021-03-25 03:10:05,007 INFO L129 PetriNetUnfolder]: 870/1760 cut-off events. [2021-03-25 03:10:05,007 INFO L130 PetriNetUnfolder]: For 8311/8330 co-relation queries the response was YES. [2021-03-25 03:10:05,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5050 conditions, 1760 events. 870/1760 cut-off events. For 8311/8330 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 11644 event pairs, 1 based on Foata normal form. 18/1222 useless extension candidates. Maximal degree in co-relation 4643. Up to 488 conditions per place. [2021-03-25 03:10:05,036 INFO L142 LiptonReduction]: Number of co-enabled transitions 1484 [2021-03-25 03:10:05,047 INFO L154 LiptonReduction]: Checked pairs total: 216 [2021-03-25 03:10:05,047 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:10:05,047 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 167 [2021-03-25 03:10:05,048 INFO L480 AbstractCegarLoop]: Abstraction has has 148 places, 126 transitions, 1687 flow [2021-03-25 03:10:05,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 188.63636363636363) internal successors, (2075), 11 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:10:05,048 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:10:05,048 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-25 03:10:05,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-03-25 03:10:05,048 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-25 03:10:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:10:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1216579531, now seen corresponding path program 4 times [2021-03-25 03:10:05,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:10:05,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030451576] [2021-03-25 03:10:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:10:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:10:05,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:10:05,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 03:10:05,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 03:10:05,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 03:10:05,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:10:05,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:10:05,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:10:05,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:10:05,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 03:10:05,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 03:10:05,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:10:05,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:05,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:10:05,197 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-25 03:10:05,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030451576] [2021-03-25 03:10:05,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:10:05,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:10:05,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957247136] [2021-03-25 03:10:05,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:10:05,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:10:05,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:10:05,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:10:05,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 03:10:05,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 126 transitions, 1687 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-25 03:10:05,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:10:05,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 03:10:05,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:10:05,923 INFO L129 PetriNetUnfolder]: 2402/4124 cut-off events. [2021-03-25 03:10:05,923 INFO L130 PetriNetUnfolder]: For 52671/52672 co-relation queries the response was YES. [2021-03-25 03:10:05,938 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20167 conditions, 4124 events. 2402/4124 cut-off events. For 52671/52672 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 27301 event pairs, 394 based on Foata normal form. 279/3530 useless extension candidates. Maximal degree in co-relation 19029. Up to 1310 conditions per place. [2021-03-25 03:10:05,941 INFO L132 encePairwiseOnDemand]: 339/348 looper letters, 82 selfloop transitions, 11 changer transitions 52/171 dead transitions. [2021-03-25 03:10:05,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 171 transitions, 2536 flow [2021-03-25 03:10:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 03:10:05,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 03:10:05,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1341 transitions. [2021-03-25 03:10:05,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5504926108374384 [2021-03-25 03:10:05,943 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1341 transitions. [2021-03-25 03:10:05,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1341 transitions. [2021-03-25 03:10:05,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:10:05,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1341 transitions. [2021-03-25 03:10:05,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 191.57142857142858) internal successors, (1341), 7 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:10:05,945 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-25 03:10:05,945 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-25 03:10:05,945 INFO L185 Difference]: Start difference. First operand has 148 places, 126 transitions, 1687 flow. Second operand 7 states and 1341 transitions. [2021-03-25 03:10:05,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 171 transitions, 2536 flow [2021-03-25 03:10:06,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 171 transitions, 2342 flow, removed 14 selfloop flow, removed 22 redundant places. [2021-03-25 03:10:06,012 INFO L241 Difference]: Finished difference. Result has 134 places, 92 transitions, 1050 flow [2021-03-25 03:10:06,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1050, PETRI_PLACES=134, PETRI_TRANSITIONS=92} [2021-03-25 03:10:06,012 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 70 predicate places. [2021-03-25 03:10:06,012 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:10:06,012 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 92 transitions, 1050 flow [2021-03-25 03:10:06,012 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 92 transitions, 1050 flow [2021-03-25 03:10:06,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 92 transitions, 1050 flow [2021-03-25 03:10:06,042 INFO L129 PetriNetUnfolder]: 267/584 cut-off events. [2021-03-25 03:10:06,042 INFO L130 PetriNetUnfolder]: For 3507/3509 co-relation queries the response was YES. [2021-03-25 03:10:06,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 584 events. 267/584 cut-off events. For 3507/3509 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3052 event pairs, 0 based on Foata normal form. 2/427 useless extension candidates. Maximal degree in co-relation 1785. Up to 140 conditions per place. [2021-03-25 03:10:06,047 INFO L142 LiptonReduction]: Number of co-enabled transitions 936 [2021-03-25 03:10:06,049 INFO L154 LiptonReduction]: Checked pairs total: 48 [2021-03-25 03:10:06,049 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:10:06,050 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 03:10:06,050 INFO L480 AbstractCegarLoop]: Abstraction has has 124 places, 92 transitions, 1050 flow [2021-03-25 03:10:06,050 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-25 03:10:06,050 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 03:10:06,050 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-25 03:10:06,050 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-03-25 03:10:06,050 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-25 03:10:06,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 03:10:06,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1939254099, now seen corresponding path program 1 times [2021-03-25 03:10:06,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 03:10:06,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394194037] [2021-03-25 03:10:06,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 03:10:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 03:10:06,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 03:10:06,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 03:10:06,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 03:10:06,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 03:10:06,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 03:10:06,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:10:06,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 03:10:06,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 03:10:06,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 03:10:06,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 03:10:06,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 03:10:06,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 03:10:06,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 03:10:06,247 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-25 03:10:06,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394194037] [2021-03-25 03:10:06,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 03:10:06,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-03-25 03:10:06,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787437743] [2021-03-25 03:10:06,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 03:10:06,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 03:10:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 03:10:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-03-25 03:10:06,250 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 348 [2021-03-25 03:10:06,251 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 92 transitions, 1050 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-25 03:10:06,251 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 03:10:06,251 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 348 [2021-03-25 03:10:06,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 03:10:06,517 INFO L129 PetriNetUnfolder]: 744/1253 cut-off events. [2021-03-25 03:10:06,518 INFO L130 PetriNetUnfolder]: For 18093/18094 co-relation queries the response was YES. [2021-03-25 03:10:06,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7008 conditions, 1253 events. 744/1253 cut-off events. For 18093/18094 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 6439 event pairs, 75 based on Foata normal form. 49/1129 useless extension candidates. Maximal degree in co-relation 6979. Up to 605 conditions per place. [2021-03-25 03:10:06,522 INFO L132 encePairwiseOnDemand]: 342/348 looper letters, 0 selfloop transitions, 0 changer transitions 109/109 dead transitions. [2021-03-25 03:10:06,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 109 transitions, 1481 flow [2021-03-25 03:10:06,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 03:10:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 03:10:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1137 transitions. [2021-03-25 03:10:06,524 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5445402298850575 [2021-03-25 03:10:06,524 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1137 transitions. [2021-03-25 03:10:06,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1137 transitions. [2021-03-25 03:10:06,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 03:10:06,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1137 transitions. [2021-03-25 03:10:06,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 03:10:06,525 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-25 03:10:06,525 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-25 03:10:06,525 INFO L185 Difference]: Start difference. First operand has 124 places, 92 transitions, 1050 flow. Second operand 6 states and 1137 transitions. [2021-03-25 03:10:06,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 109 transitions, 1481 flow [2021-03-25 03:10:06,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 109 transitions, 1273 flow, removed 19 selfloop flow, removed 17 redundant places. [2021-03-25 03:10:06,543 INFO L241 Difference]: Finished difference. Result has 105 places, 0 transitions, 0 flow [2021-03-25 03:10:06,543 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=105, PETRI_TRANSITIONS=0} [2021-03-25 03:10:06,543 INFO L343 CegarLoopForPetriNet]: 64 programPoint places, 41 predicate places. [2021-03-25 03:10:06,543 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 03:10:06,543 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 0 transitions, 0 flow [2021-03-25 03:10:06,543 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 0 transitions, 0 flow [2021-03-25 03:10:06,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2021-03-25 03:10:06,543 INFO L129 PetriNetUnfolder]: 0/0 cut-off events. [2021-03-25 03:10:06,544 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 03:10:06,544 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-25 03:10:06,544 INFO L142 LiptonReduction]: Number of co-enabled transitions 0 [2021-03-25 03:10:06,544 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 03:10:06,544 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 03:10:06,544 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1 [2021-03-25 03:10:06,544 INFO L480 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2021-03-25 03:10:06,544 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-25 03:10:06,544 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-03-25 03:10:06,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:10:06 BasicIcfg [2021-03-25 03:10:06,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 03:10:06,548 INFO L168 Benchmark]: Toolchain (without parser) took 152650.76 ms. Allocated memory was 255.9 MB in the beginning and 15.6 GB in the end (delta: 15.4 GB). Free memory was 233.2 MB in the beginning and 14.8 GB in the end (delta: -14.5 GB). Peak memory consumption was 846.4 MB. Max. memory is 16.0 GB. [2021-03-25 03:10:06,548 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 255.9 MB. Free memory was 237.6 MB in the beginning and 237.5 MB in the end (delta: 178.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 03:10:06,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.11 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.2 MB in the beginning and 347.4 MB in the end (delta: -114.2 MB). Peak memory consumption was 56.4 MB. Max. memory is 16.0 GB. [2021-03-25 03:10:06,548 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.77 ms. Allocated memory is still 367.0 MB. Free memory was 347.4 MB in the beginning and 344.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 03:10:06,548 INFO L168 Benchmark]: Boogie Preprocessor took 29.78 ms. Allocated memory is still 367.0 MB. Free memory was 344.5 MB in the beginning and 343.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 03:10:06,548 INFO L168 Benchmark]: RCFGBuilder took 501.26 ms. Allocated memory is still 367.0 MB. Free memory was 343.5 MB in the beginning and 315.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. [2021-03-25 03:10:06,548 INFO L168 Benchmark]: TraceAbstraction took 151451.97 ms. Allocated memory was 367.0 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 315.2 MB in the beginning and 14.8 GB in the end (delta: -14.5 GB). Peak memory consumption was 817.3 MB. Max. memory is 16.0 GB. [2021-03-25 03:10:06,549 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 was 237.6 MB in the beginning and 237.5 MB in the end (delta: 178.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 626.11 ms. Allocated memory was 255.9 MB in the beginning and 367.0 MB in the end (delta: 111.1 MB). Free memory was 233.2 MB in the beginning and 347.4 MB in the end (delta: -114.2 MB). Peak memory consumption was 56.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 36.77 ms. Allocated memory is still 367.0 MB. Free memory was 347.4 MB in the beginning and 344.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.78 ms. Allocated memory is still 367.0 MB. Free memory was 344.5 MB in the beginning and 343.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 501.26 ms. Allocated memory is still 367.0 MB. Free memory was 343.5 MB in the beginning and 315.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 151451.97 ms. Allocated memory was 367.0 MB in the beginning and 15.6 GB in the end (delta: 15.3 GB). Free memory was 315.2 MB in the beginning and 14.8 GB in the end (delta: -14.5 GB). Peak memory consumption was 817.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2136.0ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 2304, positive: 2297, positive conditional: 0, positive unconditional: 2297, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1930, positive: 1923, positive conditional: 0, positive unconditional: 1923, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1930, positive: 1923, positive conditional: 0, positive unconditional: 1923, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2304, positive: 374, positive conditional: 0, positive unconditional: 374, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1930, unknown conditional: 0, unknown unconditional: 1930] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1201.6ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 244, positive conditional: 0, positive unconditional: 244, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 201, positive: 200, positive conditional: 0, positive unconditional: 200, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 201, positive: 200, positive conditional: 0, positive unconditional: 200, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 246, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 201, unknown conditional: 0, unknown unconditional: 201] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.3ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.1ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 226.4ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 256.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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 297.4ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 275.5ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 287.7ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 237.7ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 267.7ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 270.5ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 280.9ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 362.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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 383.8ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 520.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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 760.1ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 525.0ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 620.9ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 847.3ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 816.5ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1057.9ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1016.9ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1129.6ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1100.7ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1142.5ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1134.2ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 838.8ms, 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1014.3ms, 197 PlacesBefore, 197 PlacesAfterwards, 269 TransitionsBefore, 269 TransitionsAfterwards, 4196 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1003.9ms, 200 PlacesBefore, 200 PlacesAfterwards, 274 TransitionsBefore, 274 TransitionsAfterwards, 3998 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1053.4ms, 206 PlacesBefore, 206 PlacesAfterwards, 276 TransitionsBefore, 276 TransitionsAfterwards, 3934 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1086.9ms, 213 PlacesBefore, 213 PlacesAfterwards, 286 TransitionsBefore, 286 TransitionsAfterwards, 4104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1021.0ms, 207 PlacesBefore, 207 PlacesAfterwards, 268 TransitionsBefore, 268 TransitionsAfterwards, 3630 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 946.4ms, 205 PlacesBefore, 205 PlacesAfterwards, 257 TransitionsBefore, 257 TransitionsAfterwards, 3370 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 746.1ms, 201 PlacesBefore, 184 PlacesAfterwards, 234 TransitionsBefore, 234 TransitionsAfterwards, 3086 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 435.7ms, 176 PlacesBefore, 169 PlacesAfterwards, 220 TransitionsBefore, 220 TransitionsAfterwards, 2902 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 330.7ms, 168 PlacesBefore, 161 PlacesAfterwards, 197 TransitionsBefore, 197 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 298.6ms, 159 PlacesBefore, 149 PlacesAfterwards, 182 TransitionsBefore, 182 TransitionsAfterwards, 2518 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 237.8ms, 145 PlacesBefore, 143 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 2510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 237.2ms, 151 PlacesBefore, 148 PlacesAfterwards, 186 TransitionsBefore, 186 TransitionsAfterwards, 2510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 382.8ms, 154 PlacesBefore, 154 PlacesAfterwards, 211 TransitionsBefore, 211 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 555.4ms, 169 PlacesBefore, 169 PlacesAfterwards, 210 TransitionsBefore, 210 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 364.7ms, 172 PlacesBefore, 168 PlacesAfterwards, 205 TransitionsBefore, 205 TransitionsAfterwards, 2730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 409.1ms, 174 PlacesBefore, 171 PlacesAfterwards, 201 TransitionsBefore, 201 TransitionsAfterwards, 2730 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 281.1ms, 163 PlacesBefore, 163 PlacesAfterwards, 147 TransitionsBefore, 147 TransitionsAfterwards, 1852 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 288 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 36, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 166.8ms, 158 PlacesBefore, 148 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 1484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 216 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 27, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.0ms, 134 PlacesBefore, 124 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 936 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5ms, 105 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: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , 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): 6, Positive cache size: 4, Positive conditional cache size: 0, Positive unconditional cache size: 4, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - 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: 11.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 151153.9ms, OverallIterations: 47, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 116497.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2303.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1229 SDtfs, 2437 SDslu, 2708 SDs, 0 SdLazy, 10535 SolverSat, 1021 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5337.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 591 GetRequests, 49 SyntacticMatches, 15 SemanticMatches, 527 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 8359.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5834occurred in iteration=31, InterpolantAutomatonStates: 380, 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: 70.4ms SsaConstructionTime, 379.5ms SatisfiabilityAnalysisTime, 4938.6ms InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 852 ConstructedInterpolants, 0 QuantifiedInterpolants, 12606 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...