/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:34:28,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:34:28,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:34:28,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:34:28,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:34:28,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:34:28,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:34:28,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:34:28,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:34:28,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:34:28,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:34:28,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:34:28,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:34:28,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:34:28,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:34:28,698 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:34:28,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:34:28,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:34:28,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:34:28,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:34:28,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:34:28,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:34:28,710 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:34:28,711 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:34:28,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:34:28,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:34:28,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:34:28,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:34:28,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:34:28,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:34:28,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:34:28,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:34:28,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:34:28,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:34:28,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:34:28,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:34:28,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:34:28,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:34:28,727 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:34:28,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:34:28,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:34:28,729 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:34:28,765 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:34:28,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:34:28,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:34:28,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:34:28,767 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:34:28,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:34:28,768 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:34:28,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:34:28,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:34:28,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:34:28,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:34:28,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:34:28,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:34:28,770 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:34:28,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:34:28,770 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:34:28,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:34:28,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:34:28,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:34:28,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:34:28,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:34:28,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:34:28,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:34:28,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:34:28,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:34:28,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:34:28,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:34:28,773 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:34:28,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-06 04:34:29,137 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:34:29,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:34:29,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:34:29,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:34:29,163 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:34:29,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2022-12-06 04:34:30,230 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:34:30,516 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:34:30,517 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i [2022-12-06 04:34:30,537 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55ae32ef/269f5e314c1941e6a52a6651449f2a64/FLAGdd515dc9f [2022-12-06 04:34:30,549 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a55ae32ef/269f5e314c1941e6a52a6651449f2a64 [2022-12-06 04:34:30,552 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:34:30,553 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:34:30,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:34:30,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:34:30,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:34:30,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:30" (1/1) ... [2022-12-06 04:34:30,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2edfdc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:30, skipping insertion in model container [2022-12-06 04:34:30,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:34:30" (1/1) ... [2022-12-06 04:34:30,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:34:30,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:34:30,722 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i[945,958] [2022-12-06 04:34:30,886 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,903 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,906 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:34:30,917 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:34:30,929 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_tso.i[945,958] [2022-12-06 04:34:30,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,967 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,969 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,971 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,979 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:34:30,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:34:30,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:34:31,028 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:34:31,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31 WrapperNode [2022-12-06 04:34:31,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:34:31,030 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:34:31,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:34:31,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:34:31,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,084 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2022-12-06 04:34:31,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:34:31,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:34:31,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:34:31,085 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:34:31,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,106 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,118 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:34:31,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:34:31,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:34:31,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:34:31,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (1/1) ... [2022-12-06 04:34:31,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:34:31,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:34:31,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:34:31,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:34:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:34:31,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:34:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:34:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:34:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:34:31,201 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:34:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:34:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:34:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:34:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:34:31,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:34:31,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:34:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:34:31,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:34:31,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:34:31,205 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:34:31,364 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:34:31,366 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:34:31,572 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:34:31,578 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:34:31,579 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:34:31,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:31 BoogieIcfgContainer [2022-12-06 04:34:31,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:34:31,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:34:31,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:34:31,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:34:31,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:34:30" (1/3) ... [2022-12-06 04:34:31,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652db337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:34:31, skipping insertion in model container [2022-12-06 04:34:31,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:34:31" (2/3) ... [2022-12-06 04:34:31,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@652db337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:34:31, skipping insertion in model container [2022-12-06 04:34:31,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:34:31" (3/3) ... [2022-12-06 04:34:31,590 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_tso.i [2022-12-06 04:34:31,607 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:34:31,607 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:34:31,607 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:34:31,708 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:34:31,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 83 transitions, 181 flow [2022-12-06 04:34:31,776 INFO L130 PetriNetUnfolder]: 2/80 cut-off events. [2022-12-06 04:34:31,776 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:31,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 80 events. 2/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2022-12-06 04:34:31,780 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 83 transitions, 181 flow [2022-12-06 04:34:31,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 68 transitions, 145 flow [2022-12-06 04:34:31,785 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:31,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-06 04:34:31,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 68 transitions, 145 flow [2022-12-06 04:34:31,823 INFO L130 PetriNetUnfolder]: 1/68 cut-off events. [2022-12-06 04:34:31,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:31,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 68 events. 1/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 38 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 04:34:31,826 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 68 transitions, 145 flow [2022-12-06 04:34:31,826 INFO L188 LiptonReduction]: Number of co-enabled transitions 1044 [2022-12-06 04:34:34,166 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-06 04:34:34,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:34:34,198 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@33b48d8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:34:34,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 04:34:34,203 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-06 04:34:34,203 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:34,203 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:34,204 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:34,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:34,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1565970424, now seen corresponding path program 1 times [2022-12-06 04:34:34,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:34,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781644584] [2022-12-06 04:34:34,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:34,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:34,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781644584] [2022-12-06 04:34:34,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781644584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:34,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:34,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:34:34,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117408430] [2022-12-06 04:34:34,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:34,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:34:34,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:34,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:34:34,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:34:34,698 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 04:34:34,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 45 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:34,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:34,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 04:34:34,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:34,890 INFO L130 PetriNetUnfolder]: 553/883 cut-off events. [2022-12-06 04:34:34,891 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 04:34:34,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 883 events. 553/883 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3748 event pairs, 267 based on Foata normal form. 57/940 useless extension candidates. Maximal degree in co-relation 1810. Up to 531 conditions per place. [2022-12-06 04:34:34,904 INFO L137 encePairwiseOnDemand]: 9/18 looper letters, 24 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2022-12-06 04:34:34,904 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 139 flow [2022-12-06 04:34:34,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:34:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:34:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 04:34:34,915 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2022-12-06 04:34:34,917 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 45 flow. Second operand 3 states and 34 transitions. [2022-12-06 04:34:34,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 139 flow [2022-12-06 04:34:34,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 31 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:34:34,923 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 94 flow [2022-12-06 04:34:34,924 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-06 04:34:34,928 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 1 predicate places. [2022-12-06 04:34:34,928 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:34,929 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 94 flow [2022-12-06 04:34:34,931 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:34,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:34,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 94 flow [2022-12-06 04:34:34,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 94 flow [2022-12-06 04:34:34,958 INFO L130 PetriNetUnfolder]: 90/211 cut-off events. [2022-12-06 04:34:34,958 INFO L131 PetriNetUnfolder]: For 24/30 co-relation queries the response was YES. [2022-12-06 04:34:34,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 211 events. 90/211 cut-off events. For 24/30 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1031 event pairs, 40 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 466. Up to 85 conditions per place. [2022-12-06 04:34:34,960 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 94 flow [2022-12-06 04:34:34,960 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-06 04:34:34,979 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:34,981 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 53 [2022-12-06 04:34:34,981 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 94 flow [2022-12-06 04:34:34,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:34,982 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:34,982 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:34,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:34:34,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1300441929, now seen corresponding path program 1 times [2022-12-06 04:34:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:34,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855034161] [2022-12-06 04:34:34,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:34,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:35,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:35,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:35,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855034161] [2022-12-06 04:34:35,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855034161] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:35,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:35,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:34:35,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928917921] [2022-12-06 04:34:35,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:35,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:34:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:34:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:34:35,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:34:35,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 94 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:35,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:35,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:34:35,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:35,261 INFO L130 PetriNetUnfolder]: 527/844 cut-off events. [2022-12-06 04:34:35,261 INFO L131 PetriNetUnfolder]: For 378/378 co-relation queries the response was YES. [2022-12-06 04:34:35,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 844 events. 527/844 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3488 event pairs, 77 based on Foata normal form. 5/849 useless extension candidates. Maximal degree in co-relation 2480. Up to 474 conditions per place. [2022-12-06 04:34:35,268 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 31 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2022-12-06 04:34:35,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 42 transitions, 248 flow [2022-12-06 04:34:35,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:34:35,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:34:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 39 transitions. [2022-12-06 04:34:35,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5735294117647058 [2022-12-06 04:34:35,270 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 94 flow. Second operand 4 states and 39 transitions. [2022-12-06 04:34:35,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 42 transitions, 248 flow [2022-12-06 04:34:35,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:34:35,277 INFO L231 Difference]: Finished difference. Result has 32 places, 30 transitions, 164 flow [2022-12-06 04:34:35,278 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=32, PETRI_TRANSITIONS=30} [2022-12-06 04:34:35,278 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2022-12-06 04:34:35,278 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:35,279 INFO L89 Accepts]: Start accepts. Operand has 32 places, 30 transitions, 164 flow [2022-12-06 04:34:35,280 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:35,280 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:35,280 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 30 transitions, 164 flow [2022-12-06 04:34:35,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 164 flow [2022-12-06 04:34:35,295 INFO L130 PetriNetUnfolder]: 75/184 cut-off events. [2022-12-06 04:34:35,296 INFO L131 PetriNetUnfolder]: For 130/153 co-relation queries the response was YES. [2022-12-06 04:34:35,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 184 events. 75/184 cut-off events. For 130/153 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 828 event pairs, 12 based on Foata normal form. 1/182 useless extension candidates. Maximal degree in co-relation 511. Up to 78 conditions per place. [2022-12-06 04:34:35,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 30 transitions, 164 flow [2022-12-06 04:34:35,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 172 [2022-12-06 04:34:35,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:35,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:34:35,306 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 30 transitions, 164 flow [2022-12-06 04:34:35,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:35,306 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:35,306 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:35,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:34:35,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1300442921, now seen corresponding path program 1 times [2022-12-06 04:34:35,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:35,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610830906] [2022-12-06 04:34:35,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:35,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:35,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:35,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610830906] [2022-12-06 04:34:35,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610830906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:35,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:35,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:34:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157545585] [2022-12-06 04:34:35,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:35,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:34:35,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:35,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:34:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:34:35,477 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:34:35,477 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 30 transitions, 164 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:35,477 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:35,477 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:34:35,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:35,599 INFO L130 PetriNetUnfolder]: 507/814 cut-off events. [2022-12-06 04:34:35,599 INFO L131 PetriNetUnfolder]: For 703/703 co-relation queries the response was YES. [2022-12-06 04:34:35,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 814 events. 507/814 cut-off events. For 703/703 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3324 event pairs, 90 based on Foata normal form. 4/818 useless extension candidates. Maximal degree in co-relation 2710. Up to 478 conditions per place. [2022-12-06 04:34:35,606 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 39 selfloop transitions, 16 changer transitions 0/55 dead transitions. [2022-12-06 04:34:35,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 55 transitions, 384 flow [2022-12-06 04:34:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:34:35,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:34:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 04:34:35,607 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2022-12-06 04:34:35,608 INFO L175 Difference]: Start difference. First operand has 32 places, 30 transitions, 164 flow. Second operand 4 states and 43 transitions. [2022-12-06 04:34:35,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 55 transitions, 384 flow [2022-12-06 04:34:35,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:34:35,614 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 306 flow [2022-12-06 04:34:35,614 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2022-12-06 04:34:35,615 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-06 04:34:35,616 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:35,616 INFO L89 Accepts]: Start accepts. Operand has 38 places, 39 transitions, 306 flow [2022-12-06 04:34:35,617 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:35,617 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:35,617 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 39 transitions, 306 flow [2022-12-06 04:34:35,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 39 transitions, 306 flow [2022-12-06 04:34:35,632 INFO L130 PetriNetUnfolder]: 64/164 cut-off events. [2022-12-06 04:34:35,632 INFO L131 PetriNetUnfolder]: For 372/408 co-relation queries the response was YES. [2022-12-06 04:34:35,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 164 events. 64/164 cut-off events. For 372/408 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 705 event pairs, 4 based on Foata normal form. 2/164 useless extension candidates. Maximal degree in co-relation 617. Up to 72 conditions per place. [2022-12-06 04:34:35,634 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 39 transitions, 306 flow [2022-12-06 04:34:35,635 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 04:34:35,645 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:35,648 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 04:34:35,648 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 306 flow [2022-12-06 04:34:35,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:35,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:35,649 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:35,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:34:35,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1658994168, now seen corresponding path program 1 times [2022-12-06 04:34:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:35,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387808710] [2022-12-06 04:34:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387808710] [2022-12-06 04:34:35,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387808710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:35,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:35,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:34:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668942250] [2022-12-06 04:34:35,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:35,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:34:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:34:35,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:34:35,800 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 04:34:35,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:35,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:35,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 04:34:35,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:35,898 INFO L130 PetriNetUnfolder]: 392/691 cut-off events. [2022-12-06 04:34:35,898 INFO L131 PetriNetUnfolder]: For 1731/1731 co-relation queries the response was YES. [2022-12-06 04:34:35,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 691 events. 392/691 cut-off events. For 1731/1731 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3113 event pairs, 105 based on Foata normal form. 3/691 useless extension candidates. Maximal degree in co-relation 2774. Up to 529 conditions per place. [2022-12-06 04:34:35,906 INFO L137 encePairwiseOnDemand]: 13/17 looper letters, 36 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-06 04:34:35,906 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 53 transitions, 478 flow [2022-12-06 04:34:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:34:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:34:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:34:35,910 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 04:34:35,910 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 306 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:34:35,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 53 transitions, 478 flow [2022-12-06 04:34:35,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 53 transitions, 478 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:34:35,917 INFO L231 Difference]: Finished difference. Result has 41 places, 44 transitions, 381 flow [2022-12-06 04:34:35,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=381, PETRI_PLACES=41, PETRI_TRANSITIONS=44} [2022-12-06 04:34:35,919 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 14 predicate places. [2022-12-06 04:34:35,921 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:35,921 INFO L89 Accepts]: Start accepts. Operand has 41 places, 44 transitions, 381 flow [2022-12-06 04:34:35,923 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:35,924 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:35,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 44 transitions, 381 flow [2022-12-06 04:34:35,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 44 transitions, 381 flow [2022-12-06 04:34:35,940 INFO L130 PetriNetUnfolder]: 57/151 cut-off events. [2022-12-06 04:34:35,940 INFO L131 PetriNetUnfolder]: For 390/438 co-relation queries the response was YES. [2022-12-06 04:34:35,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 151 events. 57/151 cut-off events. For 390/438 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 628 event pairs, 3 based on Foata normal form. 2/151 useless extension candidates. Maximal degree in co-relation 623. Up to 67 conditions per place. [2022-12-06 04:34:35,942 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 44 transitions, 381 flow [2022-12-06 04:34:35,942 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 04:34:35,949 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:35,957 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-06 04:34:35,958 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 44 transitions, 381 flow [2022-12-06 04:34:35,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:35,958 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:35,958 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:35,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:34:35,958 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:35,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1222105076, now seen corresponding path program 1 times [2022-12-06 04:34:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:35,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601287834] [2022-12-06 04:34:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:35,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:35,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:36,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601287834] [2022-12-06 04:34:36,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601287834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:36,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:36,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:34:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045882956] [2022-12-06 04:34:36,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:36,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:34:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:34:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:34:36,100 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-06 04:34:36,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 381 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:36,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:36,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-06 04:34:36,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:36,224 INFO L130 PetriNetUnfolder]: 437/795 cut-off events. [2022-12-06 04:34:36,224 INFO L131 PetriNetUnfolder]: For 2431/2467 co-relation queries the response was YES. [2022-12-06 04:34:36,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3220 conditions, 795 events. 437/795 cut-off events. For 2431/2467 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3994 event pairs, 165 based on Foata normal form. 37/815 useless extension candidates. Maximal degree in co-relation 3197. Up to 405 conditions per place. [2022-12-06 04:34:36,232 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 34 selfloop transitions, 8 changer transitions 2/53 dead transitions. [2022-12-06 04:34:36,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 499 flow [2022-12-06 04:34:36,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:34:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:34:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-06 04:34:36,235 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 04:34:36,237 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 381 flow. Second operand 3 states and 32 transitions. [2022-12-06 04:34:36,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 499 flow [2022-12-06 04:34:36,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 492 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:34:36,245 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 380 flow [2022-12-06 04:34:36,245 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2022-12-06 04:34:36,247 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2022-12-06 04:34:36,247 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:36,247 INFO L89 Accepts]: Start accepts. Operand has 43 places, 42 transitions, 380 flow [2022-12-06 04:34:36,248 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:36,248 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:36,248 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 42 transitions, 380 flow [2022-12-06 04:34:36,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 380 flow [2022-12-06 04:34:36,264 INFO L130 PetriNetUnfolder]: 51/156 cut-off events. [2022-12-06 04:34:36,264 INFO L131 PetriNetUnfolder]: For 535/583 co-relation queries the response was YES. [2022-12-06 04:34:36,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 669 conditions, 156 events. 51/156 cut-off events. For 535/583 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 715 event pairs, 2 based on Foata normal form. 2/156 useless extension candidates. Maximal degree in co-relation 648. Up to 70 conditions per place. [2022-12-06 04:34:36,266 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 42 transitions, 380 flow [2022-12-06 04:34:36,267 INFO L188 LiptonReduction]: Number of co-enabled transitions 212 [2022-12-06 04:34:36,272 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:36,274 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 04:34:36,274 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 380 flow [2022-12-06 04:34:36,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:36,275 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:36,275 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:36,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:34:36,275 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:36,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:36,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1244777949, now seen corresponding path program 1 times [2022-12-06 04:34:36,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:36,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943012382] [2022-12-06 04:34:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:36,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:36,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943012382] [2022-12-06 04:34:36,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943012382] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:36,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:36,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:34:36,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052067535] [2022-12-06 04:34:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:36,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:34:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:34:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:34:36,430 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-06 04:34:36,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 380 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:36,430 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:36,430 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-06 04:34:36,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:36,541 INFO L130 PetriNetUnfolder]: 306/629 cut-off events. [2022-12-06 04:34:36,542 INFO L131 PetriNetUnfolder]: For 2876/2944 co-relation queries the response was YES. [2022-12-06 04:34:36,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2445 conditions, 629 events. 306/629 cut-off events. For 2876/2944 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3609 event pairs, 45 based on Foata normal form. 73/691 useless extension candidates. Maximal degree in co-relation 2421. Up to 331 conditions per place. [2022-12-06 04:34:36,546 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 69 selfloop transitions, 8 changer transitions 10/101 dead transitions. [2022-12-06 04:34:36,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 101 transitions, 1051 flow [2022-12-06 04:34:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:34:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:34:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-06 04:34:36,548 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6352941176470588 [2022-12-06 04:34:36,549 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 380 flow. Second operand 5 states and 54 transitions. [2022-12-06 04:34:36,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 101 transitions, 1051 flow [2022-12-06 04:34:36,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 101 transitions, 1018 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 04:34:36,555 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 428 flow [2022-12-06 04:34:36,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=428, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2022-12-06 04:34:36,558 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2022-12-06 04:34:36,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:36,558 INFO L89 Accepts]: Start accepts. Operand has 49 places, 49 transitions, 428 flow [2022-12-06 04:34:36,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:36,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:36,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 49 transitions, 428 flow [2022-12-06 04:34:36,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 49 transitions, 428 flow [2022-12-06 04:34:36,589 INFO L130 PetriNetUnfolder]: 125/328 cut-off events. [2022-12-06 04:34:36,589 INFO L131 PetriNetUnfolder]: For 921/1030 co-relation queries the response was YES. [2022-12-06 04:34:36,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 328 events. 125/328 cut-off events. For 921/1030 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2032 event pairs, 28 based on Foata normal form. 16/317 useless extension candidates. Maximal degree in co-relation 1243. Up to 183 conditions per place. [2022-12-06 04:34:36,593 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 49 transitions, 428 flow [2022-12-06 04:34:36,593 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 04:34:36,607 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [223] L740-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P1Thread1of1ForFork2_#res.offset_11|) (= (+ v_~__unbuffered_cnt~0_46 1) v_~__unbuffered_cnt~0_45)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-06 04:34:36,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [248] L755-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_19| 0) (= v_~__unbuffered_cnt~0_131 (+ v_~__unbuffered_cnt~0_132 1)) (= |v_P2Thread1of1ForFork0_#res.offset_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_131, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_19|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-06 04:34:36,662 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [238] L779-3-->L2: Formula: (and (= (mod v_~main$tmp_guard0~0_32 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|) (= v_~main$tmp_guard0~0_32 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_95) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_33|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_39|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [242] L725-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_114 1) v_~__unbuffered_cnt~0_113) (= |v_P0Thread1of1ForFork1_#res.offset_7| 0) (= |v_P0Thread1of1ForFork1_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] [2022-12-06 04:34:36,722 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:34:36,723 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 165 [2022-12-06 04:34:36,723 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 404 flow [2022-12-06 04:34:36,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:36,724 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:36,724 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:36,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:34:36,725 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:36,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash 182798233, now seen corresponding path program 1 times [2022-12-06 04:34:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:36,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171267374] [2022-12-06 04:34:36,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:36,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:36,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171267374] [2022-12-06 04:34:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171267374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:36,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:36,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:34:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389022194] [2022-12-06 04:34:36,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:34:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:34:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:34:36,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:34:36,859 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 404 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:36,859 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:36,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:34:36,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:36,978 INFO L130 PetriNetUnfolder]: 426/780 cut-off events. [2022-12-06 04:34:36,978 INFO L131 PetriNetUnfolder]: For 2557/2557 co-relation queries the response was YES. [2022-12-06 04:34:36,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3820 conditions, 780 events. 426/780 cut-off events. For 2557/2557 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3760 event pairs, 64 based on Foata normal form. 5/785 useless extension candidates. Maximal degree in co-relation 3792. Up to 375 conditions per place. [2022-12-06 04:34:36,985 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 45 selfloop transitions, 21 changer transitions 4/70 dead transitions. [2022-12-06 04:34:36,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 690 flow [2022-12-06 04:34:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:34:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:34:36,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 04:34:36,989 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6176470588235294 [2022-12-06 04:34:36,989 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 404 flow. Second operand 4 states and 42 transitions. [2022-12-06 04:34:36,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 690 flow [2022-12-06 04:34:36,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 678 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:34:36,996 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 498 flow [2022-12-06 04:34:36,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=498, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2022-12-06 04:34:36,997 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 24 predicate places. [2022-12-06 04:34:36,997 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:36,997 INFO L89 Accepts]: Start accepts. Operand has 51 places, 45 transitions, 498 flow [2022-12-06 04:34:36,998 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:36,999 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:36,999 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 498 flow [2022-12-06 04:34:37,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 498 flow [2022-12-06 04:34:37,028 INFO L130 PetriNetUnfolder]: 132/334 cut-off events. [2022-12-06 04:34:37,029 INFO L131 PetriNetUnfolder]: For 1118/1171 co-relation queries the response was YES. [2022-12-06 04:34:37,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 334 events. 132/334 cut-off events. For 1118/1171 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 1971 event pairs, 42 based on Foata normal form. 5/319 useless extension candidates. Maximal degree in co-relation 1349. Up to 214 conditions per place. [2022-12-06 04:34:37,033 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 498 flow [2022-12-06 04:34:37,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 04:34:37,034 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:37,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 38 [2022-12-06 04:34:37,035 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 498 flow [2022-12-06 04:34:37,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:37,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:37,036 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:37,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:34:37,036 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash 980730762, now seen corresponding path program 1 times [2022-12-06 04:34:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:37,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338011340] [2022-12-06 04:34:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:37,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:37,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338011340] [2022-12-06 04:34:37,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338011340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:37,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:37,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:34:37,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810490515] [2022-12-06 04:34:37,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:37,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:34:37,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:37,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:34:37,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:34:37,150 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:34:37,150 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 498 flow. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:37,150 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:37,150 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:34:37,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:37,273 INFO L130 PetriNetUnfolder]: 491/918 cut-off events. [2022-12-06 04:34:37,274 INFO L131 PetriNetUnfolder]: For 4283/4283 co-relation queries the response was YES. [2022-12-06 04:34:37,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4725 conditions, 918 events. 491/918 cut-off events. For 4283/4283 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4721 event pairs, 115 based on Foata normal form. 5/923 useless extension candidates. Maximal degree in co-relation 4694. Up to 499 conditions per place. [2022-12-06 04:34:37,279 INFO L137 encePairwiseOnDemand]: 9/17 looper letters, 40 selfloop transitions, 21 changer transitions 7/68 dead transitions. [2022-12-06 04:34:37,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 786 flow [2022-12-06 04:34:37,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:34:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:34:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 04:34:37,281 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2022-12-06 04:34:37,281 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 498 flow. Second operand 4 states and 40 transitions. [2022-12-06 04:34:37,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 786 flow [2022-12-06 04:34:37,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 784 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-06 04:34:37,291 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 505 flow [2022-12-06 04:34:37,291 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2022-12-06 04:34:37,293 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2022-12-06 04:34:37,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:37,293 INFO L89 Accepts]: Start accepts. Operand has 55 places, 42 transitions, 505 flow [2022-12-06 04:34:37,295 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:37,295 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:37,296 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 42 transitions, 505 flow [2022-12-06 04:34:37,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 42 transitions, 505 flow [2022-12-06 04:34:37,329 INFO L130 PetriNetUnfolder]: 161/407 cut-off events. [2022-12-06 04:34:37,329 INFO L131 PetriNetUnfolder]: For 1432/1503 co-relation queries the response was YES. [2022-12-06 04:34:37,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1614 conditions, 407 events. 161/407 cut-off events. For 1432/1503 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 2608 event pairs, 62 based on Foata normal form. 5/382 useless extension candidates. Maximal degree in co-relation 1583. Up to 295 conditions per place. [2022-12-06 04:34:37,334 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 42 transitions, 505 flow [2022-12-06 04:34:37,334 INFO L188 LiptonReduction]: Number of co-enabled transitions 214 [2022-12-06 04:34:37,366 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:37,368 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 75 [2022-12-06 04:34:37,368 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 505 flow [2022-12-06 04:34:37,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:37,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:37,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:34:37,369 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:37,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash -103999155, now seen corresponding path program 1 times [2022-12-06 04:34:37,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:37,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176490663] [2022-12-06 04:34:37,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:37,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:37,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:37,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176490663] [2022-12-06 04:34:37,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176490663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:37,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:37,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:34:37,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106560840] [2022-12-06 04:34:37,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:37,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:34:37,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:37,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:34:37,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:34:37,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-06 04:34:37,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 505 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:37,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:37,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-06 04:34:37,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:37,630 INFO L130 PetriNetUnfolder]: 238/563 cut-off events. [2022-12-06 04:34:37,630 INFO L131 PetriNetUnfolder]: For 3614/3732 co-relation queries the response was YES. [2022-12-06 04:34:37,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2775 conditions, 563 events. 238/563 cut-off events. For 3614/3732 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3513 event pairs, 22 based on Foata normal form. 80/626 useless extension candidates. Maximal degree in co-relation 2741. Up to 363 conditions per place. [2022-12-06 04:34:37,634 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 32 selfloop transitions, 7 changer transitions 45/92 dead transitions. [2022-12-06 04:34:37,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 92 transitions, 1229 flow [2022-12-06 04:34:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:34:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:34:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 04:34:37,635 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6372549019607843 [2022-12-06 04:34:37,635 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 505 flow. Second operand 6 states and 65 transitions. [2022-12-06 04:34:37,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 92 transitions, 1229 flow [2022-12-06 04:34:37,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 1152 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 04:34:37,643 INFO L231 Difference]: Finished difference. Result has 61 places, 33 transitions, 410 flow [2022-12-06 04:34:37,643 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=61, PETRI_TRANSITIONS=33} [2022-12-06 04:34:37,644 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 34 predicate places. [2022-12-06 04:34:37,644 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:34:37,644 INFO L89 Accepts]: Start accepts. Operand has 61 places, 33 transitions, 410 flow [2022-12-06 04:34:37,645 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:34:37,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:37,645 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 33 transitions, 410 flow [2022-12-06 04:34:37,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 33 transitions, 410 flow [2022-12-06 04:34:37,655 INFO L130 PetriNetUnfolder]: 24/90 cut-off events. [2022-12-06 04:34:37,655 INFO L131 PetriNetUnfolder]: For 442/496 co-relation queries the response was YES. [2022-12-06 04:34:37,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 90 events. 24/90 cut-off events. For 442/496 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 336 event pairs, 3 based on Foata normal form. 4/91 useless extension candidates. Maximal degree in co-relation 474. Up to 61 conditions per place. [2022-12-06 04:34:37,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 33 transitions, 410 flow [2022-12-06 04:34:37,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 04:34:37,658 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [186] L752-->L755: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0] and [211] $Ultimate##0-->L722: Formula: (and (= v_~z~0_30 2) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~z~0=v_~z~0_30, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork1_~arg.offset, ~z~0, P0Thread1of1ForFork1_~arg.base] [2022-12-06 04:34:37,754 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:34:37,755 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 04:34:37,755 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 32 transitions, 413 flow [2022-12-06 04:34:37,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:37,755 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:34:37,755 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:37,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:34:37,756 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 04:34:37,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:34:37,756 INFO L85 PathProgramCache]: Analyzing trace with hash 684821, now seen corresponding path program 1 times [2022-12-06 04:34:37,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:34:37,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860796038] [2022-12-06 04:34:37,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:34:37,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:34:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:34:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:34:37,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:34:37,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860796038] [2022-12-06 04:34:37,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860796038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:34:37,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:34:37,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:34:37,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025271880] [2022-12-06 04:34:37,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:34:37,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:34:37,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:34:37,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:34:37,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:34:37,854 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2022-12-06 04:34:37,854 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 32 transitions, 413 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:37,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:34:37,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2022-12-06 04:34:37,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:34:37,901 INFO L130 PetriNetUnfolder]: 50/124 cut-off events. [2022-12-06 04:34:37,901 INFO L131 PetriNetUnfolder]: For 1025/1084 co-relation queries the response was YES. [2022-12-06 04:34:37,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 124 events. 50/124 cut-off events. For 1025/1084 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 462 event pairs, 8 based on Foata normal form. 33/151 useless extension candidates. Maximal degree in co-relation 737. Up to 62 conditions per place. [2022-12-06 04:34:37,902 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2022-12-06 04:34:37,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 43 transitions, 583 flow [2022-12-06 04:34:37,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:34:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:34:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-12-06 04:34:37,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2022-12-06 04:34:37,904 INFO L175 Difference]: Start difference. First operand has 58 places, 32 transitions, 413 flow. Second operand 5 states and 46 transitions. [2022-12-06 04:34:37,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 43 transitions, 583 flow [2022-12-06 04:34:37,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 410 flow, removed 26 selfloop flow, removed 14 redundant places. [2022-12-06 04:34:37,908 INFO L231 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2022-12-06 04:34:37,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2022-12-06 04:34:37,909 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2022-12-06 04:34:37,909 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:34:37,909 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 0 transitions, 0 flow [2022-12-06 04:34:37,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:34:37,910 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:34:37,910 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:34:37,910 INFO L83 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. [2022-12-06 04:34:37,910 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:34:37,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:34:37,910 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:34:37,911 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 04:34:37,911 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:34:37,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:34:37,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 04:34:37,913 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 04:34:37,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 04:34:37,914 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 04:34:37,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:34:37,915 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:34:37,918 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:34:37,918 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:34:37,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:34:37 BasicIcfg [2022-12-06 04:34:37,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:34:37,921 INFO L158 Benchmark]: Toolchain (without parser) took 7368.77ms. Allocated memory was 185.6MB in the beginning and 304.1MB in the end (delta: 118.5MB). Free memory was 159.2MB in the beginning and 147.9MB in the end (delta: 11.4MB). Peak memory consumption was 131.4MB. Max. memory is 8.0GB. [2022-12-06 04:34:37,922 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:34:37,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 475.18ms. Allocated memory is still 185.6MB. Free memory was 158.8MB in the beginning and 135.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-12-06 04:34:37,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.30ms. Allocated memory is still 185.6MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:34:37,922 INFO L158 Benchmark]: Boogie Preprocessor took 36.57ms. Allocated memory is still 185.6MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 04:34:37,923 INFO L158 Benchmark]: RCFGBuilder took 458.69ms. Allocated memory is still 185.6MB. Free memory was 132.2MB in the beginning and 119.0MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 04:34:37,923 INFO L158 Benchmark]: TraceAbstraction took 6338.18ms. Allocated memory was 185.6MB in the beginning and 304.1MB in the end (delta: 118.5MB). Free memory was 118.6MB in the beginning and 147.9MB in the end (delta: -29.3MB). Peak memory consumption was 90.5MB. Max. memory is 8.0GB. [2022-12-06 04:34:37,924 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.10ms. Allocated memory is still 185.6MB. Free memory is still 162.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 475.18ms. Allocated memory is still 185.6MB. Free memory was 158.8MB in the beginning and 135.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.30ms. Allocated memory is still 185.6MB. Free memory was 135.8MB in the beginning and 134.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.57ms. Allocated memory is still 185.6MB. Free memory was 133.7MB in the beginning and 132.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 458.69ms. Allocated memory is still 185.6MB. Free memory was 132.2MB in the beginning and 119.0MB in the end (delta: 13.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 6338.18ms. Allocated memory was 185.6MB in the beginning and 304.1MB in the end (delta: 118.5MB). Free memory was 118.6MB in the beginning and 147.9MB in the end (delta: -29.3MB). Peak memory consumption was 90.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 77 PlacesBefore, 27 PlacesAfterwards, 68 TransitionsBefore, 18 TransitionsAfterwards, 1044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 733, independent: 694, independent conditional: 694, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 733, independent: 694, independent conditional: 0, independent unconditional: 694, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 733, independent: 694, independent conditional: 0, independent unconditional: 694, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 733, independent: 694, independent conditional: 0, independent unconditional: 694, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 654, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 654, independent: 613, independent conditional: 0, independent unconditional: 613, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 125, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 733, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 654, unknown conditional: 0, unknown unconditional: 654] , Statistics on independence cache: Total cache size (in pairs): 944, Positive cache size: 912, Positive conditional cache size: 0, Positive unconditional cache size: 912, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 22, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 4, independent unconditional: 18, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 29, independent conditional: 29, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 29, independent conditional: 6, independent unconditional: 23, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 84, independent conditional: 27, independent unconditional: 57, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, independent: 150, independent conditional: 150, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 162, independent: 150, independent conditional: 50, independent unconditional: 100, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 162, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 32, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 105, independent conditional: 105, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 116, independent: 105, independent conditional: 36, independent unconditional: 69, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 116, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 116, independent: 105, independent conditional: 0, independent unconditional: 105, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 116, independent: 104, independent conditional: 0, independent unconditional: 104, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 49 PlacesBefore, 47 PlacesAfterwards, 49 TransitionsBefore, 45 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 127, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 127, independent: 127, independent conditional: 127, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 127, independent: 127, independent conditional: 87, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 127, independent: 127, independent conditional: 87, independent unconditional: 40, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 9, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 127, independent: 112, independent conditional: 78, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 9, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 9, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 40, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 9, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 45, Positive conditional cache size: 9, Positive unconditional cache size: 36, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 59 PlacesBefore, 58 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 8, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 50, Positive conditional cache size: 10, Positive unconditional cache size: 40, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 50, Positive conditional cache size: 10, Positive unconditional cache size: 40, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: 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 with 1 thread instances CFG has 7 procedures, 106 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 147 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 424 IncrementalHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 30 mSDtfsCounter, 424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred in iteration=8, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 109 NumberOfCodeBlocks, 109 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2022-12-06 04:34:37,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...